Distances sets that are a shift of the integers and Fourier basis for planar convex sets

The aim of this paper is to prove that if a planar set $A$ has a difference set $\Delta(A)$ satisfying $\Delta(A)\subset \Z^++s$ for suitable $s$ than $A$ has at most 3 elements. This result is motivated by the conjecture that the disk has not more than 3 orthogonal exponentials. Further, we prove that if $A$ is a set of exponentials mutually orthogonal with respect to any symmetric convex set $K$ in the plane with a smooth boundary and everywhere non-vanishing curvature, then # (A \cap {[-q,q]}^2) \leq C(K) q where $C(K)$ is a constant depending only on $K$. This extends and clarifies in the plane the result of Iosevich and Rudnev. As a corollary, we obtain the result from \cite{IKP01} and \cite{IKT01} that if $K$ is a centrally symmetric convex body with a smooth boundary and non-vanishing curvature, then $L^2(K)$ does not possess an orthogonal basis of exponentials

On the directions determined by a Cartesian product in an affine Galois plane

We prove that the number of directions contained in a set of the form $A \times B \subset AG(2,p)$, where $p$ is prime, is at least $|A||B| - \min\{|A|,|B|\} + 2$. Here $A$ and $B$ are subsets of $GF(p)$ each with at least two elements and $|A||B| <p$. This bound is tight for an infinite class of examples. Our main tool is the use of the R\'edei polynomial with Sz\H{o}nyi's extension. As an application of our main result, we obtain an upper bound on the clique number of a Paley graph, matching the current best bound obtained recently by Hanson and Petridis.Comment: 8 page

Matching structure and bargaining outcomes in buyer–seller networks

We examine the relationship between the matching structure of a bipartite (buyer-seller) network and the (expected) shares of the unit surplus that each connected pair in this network can create. We show that in different bargaining environments, these shares are closely related to the Gallai-Edmonds Structure Theorem. This theorem characterizes the structure of maximum matchings in an undirected graph. We show that the relationship between the (expected) shares and the tructure Theorem is not an artefact of a particular bargaining mechanism or trade centralization. However, this relationship does not necessarily generalize to non-bipartite networks or to networks with heterogeneous link values

The Szemeredi-Trotter Theorem in the Complex Plane

It is shown that $n$ points and $e$ lines in the complex Euclidean plane ${\mathbb C}^2$ determine $O(n^{2/3}e^{2/3}+n+e)$ point-line incidences. This bound is the best possible, and it generalizes the celebrated theorem by Szemer\'edi and Trotter about point-line incidences in the real Euclidean plane ${\mathbb R}^2$.Comment: 24 pages, 5 figures, to appear in Combinatoric