SMALL DOUBLING IN ORDERED GROUPS
- 1 February 2014
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 96 (3) , 316-325
Abstract
We prove that if $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}S$ is a finite subset of an ordered group that generates a nonabelian ordered group, then $|S^2|\geq 3|S|-2$ . This generalizes a classical result from the theory of set addition.
Keywords
This publication has 11 references indexed in Scilit:
- Freiman's Theorem in Finite Fields via Extremal Set TheoryCombinatorics, Probability and Computing, 2009
- Product set estimates for non-commutative groupsCombinatorica, 2008
- A Note on Freĭman's Theorem in Vector SpacesCombinatorics, Probability and Computing, 2008
- Freiman's theorem in an arbitrary abelian groupJournal of the London Mathematical Society, 2007
- A polynomial bound in Freiman's theoremDuke Mathematical Journal, 2002
- Partially Ordered Groups1999
- On Subsets with Small Product in Torsion-Free GroupsCombinatorica, 1998
- Generalized arithmetical progressions and sumsetsActa Mathematica Hungarica, 1994
- On linearly ordered groups.Journal of the Mathematical Society of Japan, 1948
- Arithmetische gesetze im gebiete diskreter gruppenRendiconti del Circolo Matematico di Palermo Series 2, 1913