Geometric group theory and arithmetic diameter

@article{Nathanson2011GeometricGT,
  title={Geometric group theory and arithmetic diameter},
  author={Melvyn B. Nathanson},
  journal={arXiv: Number Theory},
  year={2011}
}
  • M. Nathanson
  • Published 4 January 2011
  • Mathematics
  • arXiv: Number Theory
Let X be a group with identity e, let A be an infinite set of generators for X, and let (X,d_A) be the metric space with the word metric d_A induced by A. If the diameter of the space is infinite, then for every positive integer h there are infinitely many elements x in X with d_A(e,x)=h. It is proved that if P is a nonempty finite set of prime numbers and A is the set of positive integers whose prime factors all belong to P, then the diameter of the metric space (\Z,d_A) is infinite. Let… Expand
Representing integers as linear combinations of power products
Let P be a finite set of at least two prime numbers and A the set of positive integers that are products of powers of primes from P. Let F(k) denote the smallest positive integer which cannot beExpand
2 1 D ec 2 01 8 RIGIDITY SEQUENCES , KAZHDAN SETS AND GROUP TOPOLOGIES ON THE INTEGERS by Catalin Badea
— We study the relationships between three different classes of sequences (or sets) of integers, namely rigidity sequences, Kazhdan sequences (or sets) and nullpotent sequences. We prove thatExpand
An exploration of Nathanson's $g$-adic representations of integers
We use Nathanson's $g$-adic representation of integers to relate metric properties of Cayley graphs of the integers with respect to various infinite generating sets $S$ to problems in additive numberExpand
On locally infinite Cayley graphs of the integers
We compute metric properties of Cayley graphs of the integers with respect to various infinite generating sets. When the generating set $S$ is the set of all powers of a prime, we find explicitExpand
Rigidity sequences, Kazhdan sets and group topologies on the integers
We study the relationships between three different classes of sequences (or sets) of integers, namely rigidity sequences, Kazhdan sequences (or sets) and nullpotent sequences. We prove that rigidityExpand
Representing integers as sums or differences of general power products
We extend a result of Hajdu and Tijdeman concerning the smallest number which cannot be obtained as a sum of less than k power products of fixed primes. For this, we also generalize a classicalExpand
Representing integers as linear combinations of powers
At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. He proposed some related results on the representation of integers byExpand
Limit Points of Nathanson’s Lambda Sequences
We consider the set $A_{n}=\displaystyle\cup_{j=0}^{\infty}\{\varepsilon_{j}(n)\cdot n^j\colon\varepsilon_{j}(n)\in\{0,\pm1,\pm2,...,\pm\lfloor{{n}/{2}}\rfloor\}\} $. Let $\mathcal{S}_{\mathcal{A}}=Expand
Special Representations, Nathanson's Lambda Sequences and Explicit Bounds
Special Representations, Nathanson’s Lambda Sequences and Explicit Bounds.
...
1
2
...

References

SHOWING 1-8 OF 8 REFERENCES
Bi-Lipschitz equivalent metrics on groups, and a problem in additive number theory
There is a standard "word length" metric canonically associated to any set of generators for a group. In particular, for any integers a and b greater than 1, the additive group of integers hasExpand
Phase Transitions in Infinitely Generated Groups, and Related Problems in Additive Number Theory
TLDR
The purpose of this note is to determine all growth functions associated to infinite generating sets for groups. Expand
Distance Sequences In Locally Infinite Vertex-Transitive Digraphs
  • W. Pegden
  • Mathematics, Computer Science
  • Comb.
  • 2006
TLDR
It is shown that for a connected vertex-transitive undirected graph of infinite degree d, the authors have f(k)=d for all k, 1≤k<diam(G) and this answers a question by L. Babai. Expand
On Sums of Units
Abstract.It is shown that if R is a finitely generated integral domain of zero characteristic, then for every n there exist elements of R which are not sums of at most n units. This applies inExpand
Representing integers as linear combinations of powers
At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. He proposed some related results on the representation of integers byExpand
On distinguishing prime numbers from composite numbers
  • L. Adleman
  • Mathematics, Computer Science
  • 21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
A new algorithm for testing primality is presented. The algorithm is distinguishable from the lovely algorithms of Solvay and Strassen [36], Miller [27] and Rabin [32] in that its assertions ofExpand
Über die Anzahl der Teiler einer natürlichen Zahl, welche die Form p − 1 haben
  • Monatsh. Math
  • 1955