SearcharxivSearch

arXiv subjects

G. A. Freiman

Publications and source records attributed to G. A. Freiman.

5 recordsLinked to original sources

On Doubling and Volume: Chains

The well--known Freiman--Ruzsa Theorem provides a structural description of a set $A$ of integers with $|2A|\le c|A|$ as a subset of a $d$--dimensional arithmetic progression $P$ with $|P|\le c'|A|$, where $d$ and $c'$ depend only on $c$. The estimation of the constants $d$ and $c'$ involved in the statement has been the object of intense research. Freiman conjectured in 2008 a formula for the largest volume of such a set. In this paper we prove the conjecture for a general class of sets called chains.

math.NT

Inverse problems in Additive Number Theory and in Non-Abelian Group Theory

The aim of this paper is threefold: a) Finding new direct and inverse results in the additive number theory concerning Minkowski sums of dilates. b) Finding a connection between the above results and some direct and inverse problems in the theory of Baumslag-Solitar (non-abelian) groups. c) Solving certain inverse problems in Baumslag-Solitar groups or monoids, assuming appropriate small doubling properties.

math.NT

Inverse Additive Problems for Minkowski Sumsets I

We give the structure of discrete two-dimensional finite sets $A,\,B\subseteq \R^2$ which are extremal for the recently obtained inequality $|A+B|\ge (\frac{|A|}{m}+\frac{|B|}{n}-1)(m+n-1)$, where $m$ and $n$ are the minimum number of parallel lines covering $A$ and $B$ respectively. Via compression techniques, the above bound also holds when $m$ is the maximal number of points of $A$ contained in one of the parallel lines covering $A$ and $n$ is the maximal number of points of $B$ contained in one of the parallel lines covering $B$. When $m,\,n\geq 2$, we are able to characterize the case of equality in this bound as well. We also give the structure of extremal sets in the plane for the projection version of Bonnesen's sharpening of the Brunn-Minkowski inequality: $μ(A+B)\ge (μ(A)/m+μ(B)/n)(m+n)$, where $m$ and $n$ are the lengths of the projections of $A$ and $B$ onto a line.

math.NT

Inverse Additive Problems for Minkowski Sumsets II

The Brunn-Minkowski Theorem asserts that $μ_d(A+B)^{1/d}\geq μ_d(A)^{1/d}+μ_d(B)^{1/d}$ for convex bodies $A,\,B\subseteq \R^d$, where $μ_d$ denotes the $d$-dimensional Lebesgue measure. It is well-known that equality holds if and only if $A$ and $B$ are homothetic, but few characterizations of equality in other related bounds are known. Let $H$ be a hyperplane. Bonnesen later strengthened this bound by showing $$μ_d(A+B)\geq (M^{1/(d-1)}+N^{1/(d-1)})^{d-1}(\frac{μ_d(A)}{M}+\frac{μ_d(B)}{N}),$$ where $M=\sup\{μ_{d-1}((\mathbf x+H)\cap A)\mid \mathbf x\in \R^d\}$ and $N=\sup\{μ_{d-1}((\mathbf y+H)\cap B)\mid \mathbf y\in \R^d\}$. Standard compression arguments show that the above bound also holds when $M=μ_{d-1}(π(A))$ and $N=μ_{d-1}(π(B))$, where $π$ denotes a projection of $\mathbb R^d$ onto $H$, which gives an alternative generalization of the Brunn-Minkowski bound. In this paper, we characterize the cases of equality in this later bound, showing that equality holds if and only if $A$ and $B$ are obtained from a pair of homothetic convex bodies by `stretching' along the direction of the projection, which is made formal in the paper. When $d=2$, we characterize the case of equality in the former bound as well.

math.NT