26 research outputs found
The Freiman--Ruzsa Theorem over Finite Fields
Let G be a finite abelian group of torsion r and let A be a subset of G. The
Freiman--Ruzsa theorem asserts that if |A+A| < K|A| then A is contained in a
coset of a subgroup of G of size at most r^{K^4}K^2|A|. It was conjectured by
Ruzsa that the subgroup size can be reduced to r^{CK}|A| for some absolute
constant C >= 2. This conjecture was verified for r = 2 in a sequence of recent
works, which have, in fact, yielded a tight bound. In this work, we establish
the same conjecture for any prime torsion
Direct and inverse problems for restricted signed sumsets in integers
Let be a nonempty finite subset of an additive abelian group . For a positive integer , we let
be the -fold restricted signed sumset of . The direct problem for the restricted signed sumset is to find the minimum number of elements in in terms of , where is the cardinality of . The {\it inverse problem} for the restricted signed sumset is to determine the structure of the finite set for which the minimum value of is achieved. In this article, we solve some cases of both direct and inverse problems for in the group of integers. In this connection, we also mention some conjectures in the remaining cases
Direct and inverse problems for restricted signed sumsets in integers
Let be a nonempty finite subset of an additive abelian group . For a positive integer , we let
be the -fold restricted signed sumset of . The direct problem for the restricted signed sumset is to find the minimum number of elements in in terms of , where is the cardinality of . The {\it inverse problem} for the restricted signed sumset is to determine the structure of the finite set for which the minimum value of is achieved. In this article, we solve some cases of both direct and inverse problems for in the group of integers. In this connection, we also mention some conjectures in the remaining cases
Sumsets with a minimum number of distinct terms
For a non-empty -element set of an additive abelian group and a
positive integer , we consider the set of elements of that can be
written as a sum of elements of with at least distinct elements. We
denote this set as for integers . The set generalizes the classical sumsets and for and
, respectively. Thus, we call the set the generalized
sumset of . By writing the sumset in terms of the sumsets
and , we obtain the sharp lower bound on the size of over the groups and , where is a prime
number. We also characterize the set for which the lower bound on the size
of is tight in these groups. Further, using some elementary
arguments, we prove an upper bound for the minimum size of over
the group for any integer .Comment: 16 page
Some new inequalities in additive combinatorics
In the paper we find new inequalities involving the intersections of shifts of some subset from an abelian group. We apply the
inequalities to obtain new upper bounds for the additive energy of
multiplicative subgroups and convex sets and also a series another results on
the connection of the additive energy and so--called higher moments of
convolutions. Besides we prove new theorems on multiplicative subgroups
concerning lower bounds for its doubling constants, sharp lower bound for the
cardinality of sumset of a multiplicative subgroup and its subprogression and
another results.Comment: 39 page