Small doublings in abelian groups of prime power torsion
Yifan Jing, Souktik Roy

TL;DR
This paper proves a conjecture by Ruzsa regarding the structure of subsets with small doubling in finite abelian groups of prime power torsion, extending previous results to this broader class.
Contribution
It confirms Ruzsa's conjecture for groups with prime power torsion, providing a tight bound and extending prior work from prime torsion cases.
Findings
Confirmed Ruzsa's conjecture for prime power torsion groups.
Established tight bounds for subset containment in cosets.
Extended previous results from prime to prime power torsion groups.
Abstract
Let be a subset of , where is a finite abelian group of torsion . It was conjectured by Ruzsa that if , then is contained in a coset of of size at most for some constant . The case received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when is a prime. In this paper, we confirm the conjecture when is a power of prime. In particular, the bound we obtain is tight.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · graph theory and CDMA systems
Small doublings in abelian groups
of prime power torsion
Yifan Jing
Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL, USA
and
Souktik Roy
Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL, USA
Abstract.
Let be a subset of , where is a finite abelian group of torsion . It was conjectured by Ruzsa that if , then is contained in a coset of of size at most for some constant . The case received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when is a prime. In this paper, we confirm the conjecture when is a power of prime. In particular, the bound we obtain is tight.
Key words and phrases:
Keywords: sumset, abelian group, compression, doubling
1991 Mathematics Subject Classification:
MSC numbers: 11P70, 05D05
1. Introduction
The study of sums of sets inside ambient groups constitutes a fundamental aspect of additive combinatorics and number theory. Given sets inside an ambient abelian group , the sum set of is defined by
[TABLE]
The doubling constant of is defined to be the quantity . In a qualitative sense, a small value of this quantity points towards the set possessing some approximate algebraic structure. Depending on the ambient group one arrives at various notions of approximate algebraicity (indeed, the doubling constant makes sense even in non-abelian settings). Mathematical study along these lines can be traced back to a crucial theorem of Freiman [7] which asserts that any non-empty finite set of integers in with small sum set can be efficiently contained in a generalized arithmetic progression.
In this paper, we restrict our attention to an abelian group with finite torsion , and a finite set in . The affine span of , denoted by , is defined to be the smallest subgroup or coset of a subgroup containing . Since the structure of both and remain unaffected if we translate all elements of by some fixed constant, we shall assume throughout this paper that the identity element [math] is in . Under this assumption, the affine span is easily seen to be exactly the minimal subgroup of containing . The spanning constant of is defined by . The Freiman–Ruzsa Theorem [15] explores the relation between the doubling constant and the spanning constant of .
Theorem 1.1** (Freiman–Ruzsa Theorem).**
Let be a finite subset of an abelian group with torsion . Suppose there is a constant such that , then
[TABLE]
Then a natural question is to ask how tight this bound is. For applications, one may hope for polynomial dependence on , for example, but Ruzsa observed that the dependence on is at least exponential. In the same paper he conjectured that this was essentially the worst case.
Conjecture 1.2** (Ruzsa [15]).**
Let be a finite subset of an abelian group with torsion , and there exists a constant such that . Then there exists some constant such that
[TABLE]
Green and Ruzsa [9] improved the bound to . The special case has received considerable attention, see [3, 4, 5, 8, 9, 10, 11, 12, 14, 16]. In particular, Green and Tao [8] confirmed the conjecture when by showing the spanning constant of is at most , and the tight upper bound was finally determined by Even-Zohar [5]. Later, Even-Zohar and Lovett [6] settled the conjecture when the ambient group has prime torsion. In this paper, we consider ambient groups of prime power torsion (i.e. we set to be for some prime ), where we exploit extremal set theoretic methods first used for Freiman type theorems in [8]. We refine the method by introducing two different total orders on and considering compression operators acting on based on these orders, and arrive at structural results for the extremal sets of fixed size and affine span in . Analysing these deductions about structure gives us the following main result.
Theorem 1.3**.**
Let be a finite subset of an abelian group of torsion , where is a prime and is a positive integer. Suppose for some constant , and . Then
[TABLE]
This confirms Ruzsa’s Conjecture for prime power torsions. The constant in the theorem depends on the ambient group , and an example in Section 5 shows that the dependence is necessary. The following result allows us to remove the dependence on .
Theorem 1.4**.**
Let be a finite subset of an abelian group of torsion , where is a prime and is a positive integer. Suppose and . If , we have If , we have
We have a similar result when .
Theorem 1.5**.**
Let be a finite subset of an abelian group of torsion . Then for every , and , we have .
The following well-known construction shows that the bound we obtain in Theorem 1.3 is tight. Let , where is the basis of , where and . In this case, the doubling constant is and the spanning constant is .
Note that for the group with torsion , without loss of generality we may assume , otherwise we can take the preimage of under the quotient map to obtain the same doubling and spanning constant.
Notation
In this paper, we always let be a prime, and for some integer . We write if and . Suppose are groups and , we use to denote the collection of -cosets.
Overview
The paper is organized as follows. In Section 2, we introduce two orders in and discuss the properties of the orders. In Section 3, we define compression operators under the orders we defined in section 2, and prove some structural results pertaining to the compressed sets. Section 4 contains the proof of our main results.
2. Sum order and Pseudo-sum order
We first consider the elements in , where is a power of prime. Since contains non-trivial subgroups, the natural order used in the proofs of other cases [5, 6, 8] will not work. We define the sum order of as follows. Let , and where . We define if for some and when . Let be the -th element in under this order.
Example 2.1**.**
In , we have , and , , .
Let be a group such that
[TABLE]
where are integers for every . We also define the sum order of the elements in . For every , let and , where . We say if for some we have and for every .
For every , we define the height function the index of under the sum order. Given , . We define the initial segment of size of , denoted by , is the set of smallest elements in . When , we simply write . The following lemma is the basic property of the sum order.
Lemma 2.2**.**
Let be the ambient group. Suppose are positive integers and . Then
[TABLE]
Proof.
Suppose . We prove it by induction on . The base case follows the basic property of arithmetic progressions. Now we move to the induction step. If , it is clear that the inductive hypothesis applied. We may assume , and let , where .
We consider first that . We have
[TABLE]
Suppose . Let where and . We obtain
[TABLE]
which finishes the proof. ∎
Note that in the sum order, [math] is always the smallest element, but is quite large. In fact, we have when . Sometimes we want is small as well. We define the pseudo-sum order () of , for every and , where if , or for some and for all . Let , we define be the initial segment of size of . It is not hard to see, Lemma 2.2 does not hold for pseudo-sum order.
3. Structure of Compressed sets
3.1. Compressions
In this section, we will use cosets to partition , where . For every , let be the smallest subgroup (or the coset of a subgroup) containing . The -compression of a subset is
[TABLE]
When , we simply write -compression of as . If , we say is -compressed. Clearly, is -compressed, and .
The following theorem [13] is an analogue of Cauchy–Davenport Theorem [1, 2].
Theorem 3.1** ([13]).**
Let be non-empty finite subsets of . Then
[TABLE]
The following lemma shows, compression operators under sum order behave well on sumsets. In our proof, it suffices to consider the case when is a single vector, and the same proof works for the general case as well.
Lemma 3.2**.**
Suppose and . Then
[TABLE]
Proof.
Let , where . Note that . Suppose , where S_{x}=x+\big{(}\mathbb{Z}/q\mathbb{Z}\big{)}v and S_{y}=y+\big{(}\mathbb{Z}/q\mathbb{Z}\big{)}v. Let be the largest integer such that . Without loss of generality, we may assume , where . Otherwise we can apply an affine transform on .
Assume and , . By applying Theorem 3.1 we have
[TABLE]
The latter follows by Lemma 2.2 and definition of the sum order of at its -th coordinate, and same as in and . Therefore,
[TABLE]
Now we take union of all . Thus, we obtain , which implies . ∎
Now we consider the properties of compression operators under pseudo-sum order.
Lemma 3.3**.**
Let , and suppose for every , , we have . Let . Then
[TABLE]
Proof.
Let . Let be the largest integer such that , and we may assume that , where . If , this case is proved in Lemma 3.2. We now consider .
Suppose S_{x}=x+\big{(}\mathbb{Z}/q\mathbb{Z}\big{)}v and S_{y}=y+\big{(}\mathbb{Z}/q\mathbb{Z}\big{)}v. Assume , such that and . We assume , otherwise . Then we have
[TABLE]
By taking union of all , we have , which implies . ∎
Lemma 3.3 shows that when has certain structure, the compression operators under pseudo-sum order also behave well on sumset of .
3.2. Compressions preserve affine spanning
We first consider the compressions under sum order. Note that for every , after we apply compression operator to , Lemma 3.2 implies the doubling constant does not change. The main idea of the proof is reduction the problem to compressed sets. If we also have , we are able to apply induction on . However, in most of the cases, . In this subsection, we study the compressions which preserve the affine spanning of .
Let be the affine basis of and . We say is -compressed, if for every , implies is -compressed. The lemmas below give us the rough structure of the -compressed sets.
Lemma 3.4**.**
Suppose is -compressed and . Then for every and , we have the following property. If , then is -compressed, for every which is divisible by . When , is -compressed for every .
Proof.
We first consider the case when . Let , recall that
[TABLE]
where S=x+\big{(}\mathbb{Z}/q_{i}\mathbb{Z}\big{)}b_{i} for some . When , it is clear that is the smallest element in the coset e_{j}+\big{(}\mathbb{Z}/q_{i}\mathbb{Z}\big{)}b_{i} except for [math]. Now we consider the coset e_{i}+\big{(}\mathbb{Z}/q_{i}\mathbb{Z}\big{)}b_{i}. By the definition of , we can see that is still the smallest element in e_{i}+\big{(}\mathbb{Z}/q_{i}\mathbb{Z}\big{)}b_{i}, since and when . This implies is -compressed for every .
When we have , then for , we still have that is the smallest element in . For , note that is the second smallest element in while the smallest one is . Thus implies that is -compressed. ∎
Let be the maximum subgroup of such that . The following lemma gives us some information of the structure of compressed set.
Lemma 3.5**.**
Suppose is -compressed, and let be defined as above. Therefore,
- (i)
for every and , we have , where is divisible by . 2. (ii)
for every and , if there is some such that for some and . Then for every , we have .
Proof.
By the way we define , it is clear that F+\big{(}\mathbb{Z}/q_{f+1}\mathbb{Z}\big{)}e_{f+1}\nsubseteq A. That is, there exists some such that . Given t\in\big{(}\mathbb{Z}/q_{f+j}\mathbb{Z}\big{)}\setminus\{0\} with and , we have , for every . Both of them lie in the coset , then Lemma 3.4 implies that .
Suppose , for some and . Then for every and every , we have . Since both of them lie on \ell(s)e_{f+j}+v+\mathbb{Z}/q_{f+j}\mathbb{Z}\big{(}(\ell(i)-\ell(s))e_{f+j}+(u-v)\big{)}, and , implies . ∎
In the rest of the section, we consider the pseudo-sum order of . We still assume that contains as a subset. The following observation provides some information the compression operators preserve affine spanning.
Lemma 3.6**.**
For every , the compression operator preserve the affine spanning of .
Proof.
Note that all the elements in the coset smaller than are already in . Also is the smallest element in when . Thus, preserves the affine spanning of . ∎
The following lemma gives us a rough structure of the compressed set under pseudo-sum order.
Lemma 3.7**.**
Given is -compressed for every . Suppose , where and when . Then we have the following properties.
- (i)
. 2. (ii)
If is not a subgroup or a coset of a subgroup, we have and .
Proof.
For every , both of and lies on the coset v+ie_{n}+\big{(}\mathbb{Z}/q\mathbb{Z}\big{)}e_{n}, and . This means if , then . Hence we have .
Let and . Consider the cosets and , we can see that both of the and are not in , that is . Then for every , we have and . Since is not a subgroup or a coset of a subgroup, we only have . By the assumption, , which implies . Then .
Note that since for every . Then there is such that . Consider the coset , we have and both of them lie in the coset. Then , which is . Therefore, by (i) we obtain . ∎
4. Proof of the main results
We make use of the following results obtained by Even-Zohar [5] and by Even-Zohar and Lovett [6].
Theorem 4.1** ([5]).**
Let . For , denote by the unique integer for which . For such that , we have , where
[TABLE]
* grows as .*
Theorem 4.2** ([6]).**
Let prime and . Suppose is a subset of an abelian group of torsion . If , then . Here is a constant.
We now have all the machinery needed to prove Theorem 1.3.
Proof of Theorem 1.3.
Suppose and
[TABLE]
where . We may assume . Without loss of generality, we may also assume that contains the affine basis of , that is, . Suppose we have
[TABLE]
for some . We are going to show that the doubling constant of is at least . The proof goes by induction on under sum order.
We consider first when is not -compressed. Then there exists such that and . Since , and by Lemma 3.2, the inductive hypothesis applied.
Now we assume that is -compressed. We are going to prove the theorem by induction on . The base case is when is a finite field, and it is obtained by Theorem 4.2. It is easy to see that when , both of the doubling constant and the spanning constant of are .
Suppose . In this case, we have , which implies
[TABLE]
a contradiction when .
Now we assume that . Note that is -compressed, by Lemma 3.5, we have that for every with and every . Let () be the largest integer such that for some . Let () be the subset of such that for every , we have for every , and if . We write for the convenience.
By Lemma 3.5, we have for every , and . We denote by for since all of them are same. We have .
Suppose there is some such that . We have . Therefore,
[TABLE]
which cannot happen when .
Now we have , that is, . We write for every . That means
[TABLE]
In the rest of the proof, let us consider the pseudo-sum order of . Let be the set obtained from be applying all the possible compressions for every . Note that we also have where if . We simply write .
Suppose is a subgroup or a coset of a subgroup of . Thus
[TABLE]
contradicts .
Now we apply Lemma 3.7. This gives us . By induction hypothesis, there exists such that
[TABLE]
and .
Apply Lemma 3.3, we have
[TABLE]
Note that
[TABLE]
by the monotonicity of the function we have
[TABLE]
This finishes the proof. ∎
In the proof of Theorem 1.3 we apply induction on , so we require , which implies will depend on the ambient group . This dependence is necessary, and we will discuss it in the next section. Theorem 1.4 gives us a result for all , which provides more information when the doubling constant is small relative to the dimension of the ambient group. Theorem 1.4 is proved identically to Theorem 1.3, the only different being our inductive step. When we apply induction, instead of using the result in Theorem 4.2 for the prime torsion case, we use the following theorem.
Theorem 4.3**.**
Let be a group of torsion and is a subset of where is a prime. Suppose there is such that . If , we have . If , we have .
The proof of Theorem 4.3 follows the same steps as the proof of Theorem 4.2 in [6], with a slightly different computation. We omit the further details.
Note that all the results in Section 2 and Section 3 works when . The proof of Theorem 1.5 goes exactly the same as the proof of Theorem 1.3, except that in the induction step, the base case is by Theorem 4.1 when the ambient group is instead. By a careful computation we can also obtain a tight bound in this case since the result in Theorem 4.1 is tight. We leave the proof to the readers.
5. Concluding remarks
The constant in Theorem 1.3 obtained from the proof depends on the ambient group . Suppose and . Let be the smallest integer such that , and let . From the inductive argument in the proof above, we can see that we obtained is at least , where comes from Theorem 4.2. The following example shows that that dependence is needed, and we obtained is almost the best possible.
Let and G_{2}=\big{(}\mathbb{Z}/3^{m}\mathbb{Z}\big{)}^{\alpha}. Let and is a basis of . Suppose and . Then the doubling constant of is
[TABLE]
On the other hand we have
[TABLE]
This fact shows that in this case should be at least .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. L. Cauchy. Recherches sur les nombres. J. École Polytechnique , 9 99–123, 1813.
- 2[2] H. Davenport. On the addition of residue classes. Journal of the London Mathematical Society , 1(1) 30, 1935.
- 3[3] J. M. Deshouillers, F. Hennecart and A. Plagne. On small sumsets in ( ℤ / ℤ 2 ) n superscript ℤ subscript ℤ 2 𝑛 (\mathbb{Z}/\mathbb{Z}_{2})^{n} . Combinatorica , 24 53–68, 2004.
- 4[4] H. Diao. Freiman–Ruzsa-type theory for small doubling constant. Math. Proc. Camb. Phil. Soc. , 146 269–276, 2009.
- 5[5] C. Even-Zohar. On Sums of Generating Sets in ℤ 2 n superscript subscript ℤ 2 𝑛 \mathbb{Z}_{2}^{n} . Combinatorics, Probability and Computing , 21(6) 916–941, 2012.
- 6[6] C. Even-Zohar and S. Lovett. The Freiman–Ruzsa theorem over finite fields. Journal of Combinatorial Theory. Series A , 125 333–341, 2014.
- 7[7] G. Freiman. Foundations of a structural theory of set addition. Translated from the Russian. Translations of Mathematical Monographs , 37 , American Mathematical Society, Providence, R.I., 1973.
- 8[8] B. Green and T. Tao. Freiman’s theorem in finite fields via extremal set theory. Combinatorics, Probability and Computing , 18(03) 335–355, 2009.
