Abstract
We study VC-dimensions of short formulas in Presburger Arithmetic, defined to have a bounded number of variables, quantifiers and atoms. We give both lower and upper bounds, which are tight up to a polynomial factor in the bit length of the formula.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Aschenbrenner, A. Dolich, D. Haskell, D. Macpherson and S. Starchenko: Vapnik-Chervonenkis density in some theories without the inde-pendence property, I, Trans. AMS 368 (2016), 5889–5949.
A. Barvinok and K. Woods: Short rational generating functions for lattice point problems, Jour. AMS 16 (2003), 957–979.
A. Chernikov: Models theory and combinatorics, course notes, UCLA; available electronically at https://tinyurl.com/y8ob6uyv.
M. J. Fischer and M. O. Rabin: Super-Exponential Complexity of Presburger Arithmetic, in: Proc. SIAM-AMS Symposium in Applied Mathematics, AMS, Providence, RI, 1974, 27–41.
M. Karpinski and A. Macintyre: Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks, J. Comput. System Sci. 54 (1997), 169–176.
M. Karpinski and A. Macintyre: Approximating volumes and integrals in o-minimal and p-minimal theories, in: Connections between model theory and algebraic and analytic geometry, Seconda Univ. Napoli, Caserta, 2000, 149–177.
D. Nguyen and I. Pak: Enumeration of integer points in projections of unbounded polyhedra, SIAM J. Discrete Math. 32 (2018), 986–1002.
D. Nguyen and I. Pak: Short Presburger Arithmetic is hard, in: Proc. 58th FOCS, IEEE, Los Alamitos, CA, 2017, 37–48.
J. C. Lagarias and A. M. Odlyzko: Computing π(x): an analytic method, J. Al-gorithms 8 (1987), 173–191.
D. C. Oppen: A 222pn upper bound on the complexity of Presburger arithmetic, J. Comput. System Sci. 16 (1978), 323–332.
N. Sauer: On the density of families of sets, J. Combin. Theory, Ser. A 13 (1972), 145–147.
S. Shelah: A combinatorial problem; stability and order for models and theories in infinitary languages, Pacific J. Math. 41 (1972), 247–261.
L. J. Stockmeyer and A. R. Meyer: Word problems requiring exponential time: preliminary report, in: Proc. Fifth STOC, ACM, New York, 1973, 1–9.
T. Tao, E. Croot and H. Helfgott: Deterministic methods to find primes, Math. Comp. 81 (2012), 1233–1246.
V. N. Vapnik and A. Ja. Červonenkis: The uniform convergence of frequencies of the appearance of events to their probabilitie, Theor. Probability Appl. 16 (1971), 264–280.
V. N. Vapnik: Statistical learning theory, John Wiley, New York, 1998.
V. D. Weispfenning: Complexity and uniformity of elimination in Presburger arithmetic, in: Proc. 1997 ISSAC, ACM, New York, 1997, 48–53.
