Frobenius problem and dead ends in integers
From MaRDI portal
Publication:2483162
Abstract: Let a and b be positive, relatively prime integers. We show that the following are equivalent: (i) d is a dead end in the (symmetric) Cayley graph of Z with respect to a and b, (ii) d is a Frobenius value with respect to a and b (it cannot be written as a non-negative or non-positive integer linear combination of a and b), and d is maximal (in the Cayley graph) with respect to this property. In addition, for given integers a and b, we explicitly describe all such elements in Z. Finally, we show that Z has only finitely many dead ends with respect to any finite symmetric generating set. In the appendix we show that every finitely generated group has a generating set with respect to which dead ends exist.
Recommendations
Cites work
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- A finitely presented group with unbounded dead-end depth
- Combinatorial properties of Thompson’s group 𝐹
- Dead end words in lamplighter groups and other wreath products
- Deep pockets in lattices and other groups.
- Frobenius problem and the covering radius of a lattice
- Infinite commensurable hyperbolic groups are bi-Lipschitz equivalent
- Lattice translates of a polytope and the Frobenius problem
- On amenability of group algebras. I.
- Representations of integers by linear forms in nonnegative integers
- Solution of the Burnside problem for exponent six
- Strict Dead-End Elements in Free Soluble Groups
- THE UNBOUNDED DEAD-END DEPTH PROPERTY IS NOT A GROUP INVARIANT
- The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
Cited in
(4)
This page was built for publication: Frobenius problem and dead ends in integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483162)