Frobenius Problem and dead ends in integers

Details Frobenius Problem and dead ends in integers Frobenius Problem and dead ends in integers

2006-12-11

arxiv.org/abs/math/0612271v2

Mathematics

Number Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Frobenius Problem and dead ends in integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Frobenius Problem and dead ends in integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Frobenius Problem and dead ends in integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183607