A comparison of dispersion and Markov constants
The postage stamp problem and arithmetic in base
Let be fixed positive integers, and let be any set of positive integers. Let denote the set of all integers representable as a sum of no more than elements of , and let denote the largest integer such that . Let , where the maximum is taken over all sets with elements. We determine when the elements of are in geometric progression. In particular, this results in the evaluation of and yields surprisingly sharp lower bounds for , particularly for .
Density of M-sets in arithmetic progression
Graphic sequences of trees and a problem of Frobenius
We give a necessary and sufficient condition for the existence of a tree of order with a given degree set. We relate this to a well-known linear Diophantine problem of Frobenius.
A note on the postage stamp problem.
On a linear Diophantine problem of Frobenius.
On the Frobenius problem for .
On a variation of the coin exchange problem for arithmetic progressions.
On the Frobenius problem for geometric sequences.
On a generalization of the coin exchange problem for three variables.
Page 1