For a nonempty finite set with bounded doubling constant and a fixed positive integer , the Ruzsa modelling lemma finds a subset of size at least that is Freiman s-isomorphic to a dense subset of a finite cyclic group. The model order is at most when . The cyclic Freiman model of a small-doubling integer set gives an explicit order-eight version.
The integer, or appropriate torsion-free, setting matters. If , then for every . A Freiman 2-isomorphism into a cyclic group would force . All image differences would lie in its subgroup of elements killed by two, which has at most two elements. Thus no subset with more than two points can be Freiman 2-isomorphic to a cyclic model. General abelian groups need models retaining their torsion, rather than an unrestricted cyclic-model assertion.
A nonempty finite integer set has a subset of the displayed size Freiman s-isomorphic to a subset of . Embed in a sufficiently large auxiliary prime modulus and randomly dilate. Avoid the residues of every nonzero multiple of of absolute value less than that prime for all nonzero members of ; a union bound gives a successful dilation. Retain a most-populated one of short intervals of representatives. Its -term sum differences have absolute value less than the auxiliary prime, so reduction modulo both preserves and reflects relations. Under , this gives .
For , one can take . Embed in a much larger prime cyclic group and choose a dilation avoiding the residues of all nonzero multiples of of absolute value below that prime for every nonzero eightfold difference. A union bound ensures such a dilation. Retain a most-populated ninth-interval of representatives. Eight-term sums then have range shorter than the prime, and reduction modulo both preserves and reflects eight-term additive relations.
For a nonempty integer set with doubling constant at most , Plünnecke-Ruzsa inequality bounds by . Embed the set modulo a sufficiently large auxiliary prime , randomly dilate it, and select the more populated of two half-intervals of representatives. Differences of two pair sums on that half have absolute value less than , so the lift preserves original relations. Every nonzero original difference is uniformly dilated among nonzero residues; avoiding all residues represented by nonzero multiples of of absolute value less than has positive probability when . Reduction modulo then yields a Freiman 2-isomorphism on the selected half.
For a finite nonempty integer set , put . If an integer , some of size at least has a Freiman 2-isomorphism into . Choose an auxiliary prime so large that reduction is injective on and every nonzero element of remains nonzero. Dilate modulo by a uniformly chosen nonzero multiplier. The forbidden residues are those represented by nonzero multiples of of absolute value less than , at most residues. The nonzero elements of occur in opposite pairs; the two elements in each pair have the same bad event. The union bound therefore gives failure probability at most . Choose a multiplier avoiding all these events. Select the more populated of two half-intervals of residues modulo . Differences of two pair sums of representatives then have absolute value less than . An original additive relation must therefore lift to equality in the integers; conversely an equality modulo cannot have a nonzero lifted difference, by the forbidden-residue choice. Reduction modulo is the required isomorphism.

Articles by others on the same topic (0)

There are currently no matching articles.