Author:
Granville Andrew,Shakan George,Walker Aled
Abstract
AbstractLet $$A \subset {\mathbb {Z}}^d$$
A
⊂
Z
d
be a finite set. It is known that NA has a particular size ($$\vert NA\vert = P_A(N)$$
|
N
A
|
=
P
A
(
N
)
for some $$P_A(X) \in {\mathbb {Q}}[X]$$
P
A
(
X
)
∈
Q
[
X
]
) and structure (all of the lattice points in a cone other than certain exceptional sets), once N is larger than some threshold. In this article we give the first effective upper bounds for this threshold for arbitrary A. Such explicit results were only previously known in the special cases when $$d=1$$
d
=
1
, when the convex hull of A is a simplex or when $$\vert A\vert = d+2$$
|
A
|
=
d
+
2
Curran and Goldmakher (Discrete Anal. Paper No. 27, 2021), results which we improve.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference15 articles.
1. Bombieri, E., Vaaler, J.: On Siegel’s lemma. Invent. Math. 73(1), 11–32 (1983)
2. Graduate Texts in Mathematics;A Brøndsted,1983
3. Curran, M.J., Goldmakher, L.: Khovanskii’s theorem and effective results on sumset structure. Discrete Anal., pages Paper No. 27, 25 (2021)
4. Dixmier, J.: Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius. J. Number Theory 34(2), 198–209 (1990)
5. Granville, A., Shakan, G.: The Frobenius postage stamp problem, and beyond. Acta Math. Hungar. 161(2), 700–718 (2020)