Multiplicativity of the gamma factors of Rankin–Selberg integrals for SO 2l × GL n

Let SO _2l be the special even orthogonal group, split or quasi–split, defined over a local non–Archimedian field. The Rankin–Selberg method for a pair of generic representations of SO _2l × GL _n constructs a family of integrals, which are used to define γ and L-factors. Here we prove full multiplicative properties for the γ-factor, namely that it is multiplicative in each variable. As a corollary, the γ-factor is identical with Shahidi’s standard γ-factor.     

Sums and products along sparse graphs

In their seminal paper from 1983, Erdős and Szemerédi showed that any n distinct integers induce either n ^1+ɛ distinct sums of pairs or that many distinct products, and conjectured a lower bound of n ^2−o(1). They further proposed a generalization of this problem, in which the sums and products are taken along the edges of a given graph G on n labeled vertices. They conjectured a version of the sum-product theorem for general graphs that have at least n ^1+ɛ edges.     

Privileged users in zero-error transmission over a noisy channel

The k-th power of a graph G is the graph whose vertex set is V(G) ^k , where two distinct k-tuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon capacity of G, c(G), is lim _k→∞ α(G ^k )^1/k , where α(G) denotes the independence number of G. When G is the characteristic graph of a channel C, c(G) measures the effective alphabet size of C in a zero-error protocol. A sum of channels, C = Σ _i C _i , describes a setting when there are t ≥ 2 senders, each with his own channel C _i , and each letter in a word can be selected from any of the channels. This corresponds to a disjoint union of the characteristic graphs, G = Σ _i G _i . It is well known that c(G) ≥ Σ _i c(G _i ), and in [1] it is shown that in fact c(G) can be larger than any fixed power of the above sum. We extend the ideas of [1] and show that for every F, a family of subsets of [t], it is possible to assign a channel C _i to each sender i ∈ [t], such that the capacity of a group of senders X ⊂ [t] is high iff X contains some F ∈ F. This corresponds to a case where only privileged subsets of senders are allowed to transmit in a high rate. For instance, as an analogue to secret sharing, it is possible to ensure that whenever at least k senders combine their channels, they obtain a high capacity, however every group of k − 1 senders has a low capacity (and yet is not totally denied of service). In the process, we obtain an explicit Ramsey construction of an edge-coloring of the complete graph on n vertices by t colors, where every induced subgraph on exp vertices contains all t colors. Research supported in part by a USA-Israeli BSF grant, by the Israel Science Foundation and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University. Research partially supported by a Charles Clore Foundation Fellowship.     

On the number of rectangulations of a planar point set

We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (nonintersecting) segments, such that every point lies on a segment. We show that when the relative order of the points forms a separable permutation, the number of rectangulations is exactly the (n+1)st Baxter number. We also show that no matter what the order of the points is, the number of guillotine rectangulations is always the nth Schröder number, and the total number of rectangulations is O(n²⁰/n⁴).     

On the maximum number of edges in quasi-planar graphs

A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, M. Sharir, Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1) (1997) 1-9] proved that these graphs have a linear number of edges. We give a simple proof for this fact that yields the better upper bound of 8n edges for n vertices. Our best construction with 7n−O(1) edges comes very close to this bound. Moreover, we show matching upper and lower bounds for several relaxations and restrictions of this problem. In particular, we show that the maximum number of edges of a simple quasi-planar topological graph (i.e., every pair of edges have at most one point in common) is 6.5n−O(1), thereby exhibiting that non-simple quasi-planar graphs may have many more edges than simple ones.     

Spanners of additively weighted point sets

We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs (p,r) where p is a point in the plane and r is a real number. The distance between two points (pi,ri) and (pj,rj) is defined as |pipj|−ri−rj. We show that in the case where all ri are positive numbers and |pipj|?ri+rj for all i, j (in which case the points can be seen as non-intersecting disks in the plane), a variant of the Yao graph is a (1+?)-spanner that has a linear number of edges. We also show that the Additively Weighted Delaunay graph (the face-dual of the Additively Weighted Voronoi diagram) has a spanning ratio bounded by a constant. The straight-line embedding of the Additively Weighted Delaunay graph may not be a plane graph. Given the Additively Weighted Delaunay graph, we show how to compute a plane straight-line embedding that also has a spanning ratio bounded by a constant in time.     

Using the near-field coupling of a sharp tip to tune fluorescence-emission fluctuations during quantum-dot blinking

We demonstrate that the cycling between internal states of quantum dots during fluorescence blinking can be used to tune the near-field coupling with a sharp tip. In particular, the fluorescence emission from states with high quantum yield is quenched due to energy transfer, while that from low-yield states is elevated due to field enhancement. Thus, as a quantum dot blinks, its emission fluctuations are progressively suppressed upon approach of a tip.     

The Langlands parameter of a simple supercuspidal representation: symplectic groups

The Ramanujan Journal - Let $$\pi $$ be a simple supercuspidal representation of the symplectic group $${\mathrm {Sp}}_{2l}(F)$$, over a p-adic field F. In this work, we explicitly compute the...