Skip to main content Accessibility help
×
Home

PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS

  • KEVIN WOODS (a1)

Abstract

Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be represented by rational generating functions; a geometric characterization of such sets is also given. In addition, if p = (p1, . . . , pn) are a subset of the free variables in a Presburger formula, we can define a counting function g(p) to be the number of solutions to the formula, for a given p. We show that every counting function obtained in this way may be represented as, equivalently, either a piecewise quasi-polynomial or a rational generating function. Finally, we translate known computational complexity results into this setting and discuss open directions.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS
      Available formats
      ×

Copyright

References

Hide All
[1]Barvinok, Alexander, A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Mathematics of Operations Research, vol. 19 (1994), no. 4, pp. 769779.
[2]Barvinok, Alexander, A Course in Convexity, Graduate Studies in Mathematics, vol. 54, American Mathematical Society, Providence, RI, 2002.
[3]Barvinok, Alexander, The complexity of generating functions for integer points in polyhedra and beyond, International Congress of Mathematicians. Vol. III, European Mathematical Society, Zürich, 2006, pp. 763787.
[4]Barvinok, Alexander and Pommersheim, James, An algorithmic theory of lattice points in polyhedra, New perspectives in algebraic combinatorics (Berkeley, CA, 1996–97), Mathematical Sciences Research Institute Publications, vol. 38, Cambridge University Press, Cambridge, 1999, pp. 91147.
[5]Barvinok, Alexander and Woods, Kevin, Short rational generating functions for lattice point problems. Journal of the American Mathematical Society, vol. 16 (2003), no. 4, pp. 957979.
[6]Beck, Matthias, The partial-fractions method for counting solutions to integral linear systems. Discrete & Computational Geometry, vol. 32 (2004), no. 4, pp. 437446.
[7]Beck, Matthias and Robins, Sinai, Computing the continuous discretely, Undergraduate Texts in Mathematics, Springer, New York, 2007.
[8]Berman, Leonard, The complexity of logical theories. Theoretical Computer Science, vol. 11 (1980), no. 1, pp. 57, 71–77.
[9]Blanco, Víctor, García-Sánchez, Pedro A., and Puerto, Justo, Counting numerical semigroups with short generating functions. International Journal of Algebra and Computation, vol. 21 (2011), no. 7, pp. 12171235.
[10]Boudet, Alexandre and Comon, Hubert, Diophantine equations, Presburger arithmetic and finite automata, Trees in algebra and programming—CAAP ’96 (Linköping, 1996), Lecture Notes in Computer Science, vol. 1059, Springer, Berlin, 1996, pp. 3043.
[11]Brion, Michel, Points entiers dans les polyèdres convexes. Annales scientifiques de l’École Normale Supérieure, vol. 4 (1988), pp. 653663.
[12]Richard Büchi, J., Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 6 (1960), pp. 6692.
[13]Cassels, J. W. S., An introduction to the geometry of numbers, Classics in Mathematics, Springer-Verlag, Berlin, 1997. Corrected reprint of the 1971 edition.
[14]Clauss, Phillipe and Loechner, Vincent, Parametric analysis of polyhedral iteration spaces. Journal of VLSI Signal Processing, vol. 19 (1998), no. 2, pp. 179194.
[15]Cobham, Alan, On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory, vol. 3 (1969), pp. 186192.
[16]Comon, Hubert and Jurski, Yan, Multiple counters automata, safety analysis and Presburger arithmetic, Computer aided verification (Vancouver, BC, 1998), Lecture Notes in Computer Science, vol. 1427, Springer, Berlin, 1998, pp. 268279.
[17]Cooper, D.C., Theorem proving in arithmetic without multiplication. Machine Intelligence, vol. 7 (1972), pp. 9199.
[18]D’alessandro, Flavio, Intrigila, Benedetto, and Varricchio, Stefano, Quasi-polynomials, linear Diophantine equations and semi-linear sets. Theoretical Computer Science, vol. 416 (2012), pp. 116.
[19]Davis, Martin, Hilbert’s tenth problem is unsolvable. American Mathematical Monthly, vol. 80 (1973), pp. 233269.
[20]De Loera, Jesus, Haws, David, Hemmecke, Raymond, Huggins, Peter, Sturmfels, Bernd, and Yoshida, Ruriko, Short rational functions for toric algebra and applications. Journal of Symbolic Computation, vol. 38 (2004), no. 2, pp. 959973.
[21]Ehrhart, Eugène, Sur les polyèdres rationnels homothétiques à n dimensions. Comptes rendus de l’Académie des sciences Paris, vol. 254 (1962), pp. 616618.
[22]Ferrante, Jeanne and Rackoff, Charles W., The computational complexity of logical theories, Lecture Notes in Mathematics, vol. 718, Springer, Berlin, 1979.
[23]Fischer, Michael and Rabin, Michael, Super-exponential complexity of Presburger arithmetic, Complexity of computation (Proceedings of SIAM-AMS symposium, New York, 1973), American Mathematical Society, Providence, R.I, 1974, pp. 2741. SIAM-AMS Proceedings, Vol. VII.
[24]Fulton, William, Introduction to Toric Varieties, Annals of Mathematics Studies, vol. 131, Princeton University Press, Princeton, NJ, 1993.
[25]Fürer, Martin, The complexity of Presburger arithmetic with bounded quantifier alternation depth. Theoretical Computer Science, vol. 18 (1982), no. 1, pp. 105111.
[26]Ginsburg, Seymour and Spanier, Edwin, Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics, vol. 16 (1966), no. 2, pp. 285296.
[27]Gödel, Kurt, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I. Monatshefte für Mathematik, vol. 149 (2006), no. 1, pp. 130. Reprinted from Monatshefte für Mathematik und Physik. 38(1931), 173–198. With an introduction by Sy-David Friedman.
[28]Grädel, Erich, Subclasses of Presburger arithmetic and the polynomial-time hierarchy. Theoretical Computer Science, vol. 56 (1988), no. 3, pp. 289301.
[29]Grädel, Erich, Dominoes and the complexity of subclasses of logical theories. Annals of Pure and Applied Logic, vol. 43 (1989), no. 1, pp. 130.
[30]Guo, Alan and Miller, Ezra, Lattice point methods for combinatorial games. Advances in Applied Mathematics, vol. 46 (2011), no. 1–4, pp. 363378.
[31]Haase, Christoph, Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy, Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (CSL/LICS’14), ACM Press, Vienna, Austria, 2014.
[32]Hoşten, Serkan and Sturmfels, Bernd, Computing the integer programming gap. Combinatorica. An International Journal on Combinatorics and the Theory of Computing, vol. 27 (2007), no. 3, pp. 367382.
[33]Kannan, Ravi, Test sets for integer programs, ∀∃ sentences, Polyhedral combinatorics (Morristown, NJ, 1989), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 1, American Mathematical Society, Providence, RI, 1990, pp. 3947.
[34]Klaedtke, Felix, Bounds on the automata size for Presburger arithmetic. ACM Transactions on Computational Logic, vol. 9 (2008), no. 2, pp. Art. 11, 34.
[35]Lenstra, Hendrik Jr., Integer programming with a fixed number of variables. Mathematics of Operations Research, vol. 8 (1983), no. 4, pp. 538548.
[36]Matousek, Jiri, Lectures on Discrete Geometry, Graduate Texts in Mathematics, vol. 212, Springer-Verlag, New York, 2002.
[37]Miller, Ezra and Sturmfels, Bernd, Combinatorial commutative algebra, Graduate Texts in Mathematics, vol. 227, Springer-Verlag, New York, 2005.
[38]Oppen, Derek, A superexponential upper bound on the complexity of Presburger arithmetic. Journal of Computer and System Sciences, vol. 16 (1978), no. 3, pp. 323332.
[39]Parker, Erin and Chatterjee, Siddhartha, An automata-theoretic algorithm for counting solutions to Presburger formulas, Compiler construction, Springer, 2004, pp. 104119.
[40]Presburger, Mojżesz, On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation, History and Philosophy of Logic, vol. 12 (1991), no. 2, pp. 225233. Translated from the German and with commentaries by Dale Jacquette.
[41]Pugh, William, Counting solutions to Presburger formulas: how and why. SIGPLAN Notices, vol. 29 (1994), no. 6, pp. 121134.
[42]Ramírez Alfonsín, J. L., The Diophantine Frobenius problem, Oxford Lecture Series in Mathematics and its Applications, vol. 30, Oxford University Press, Oxford, 2005.
[43]Reddy, Cattamanchi R and Loveland, Donald W, Presburger arithmetic with bounded quantifier alternation, Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, ACM, 1978, pp. 320325.
[44]Scarf, Herbert, Test sets for integer programs. Mathematical Programming, vol. 79 (1997), no. 1–3, Series B, pp. 355368.
[45]Scarpellini, Bruno, Complexity of subcases of Presburger arithmetic. Transactions of the American Mathematical Society, vol. 284 (1984), no. 1, pp. 203218.
[46]Schöning, Uwe, Complexity of Presburger arithmetic with fixed quantifier dimension. Theory of Computing Systems, vol. 30 (1997), no. 4, pp. 423428.
[47]Schrijver, Alexander, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons Ltd., Chichester, 1986.
[48]Schrijver, Alexander, Combinatorial optimization. Polyhedra and efficiency, Algorithms and Combinatorics, vol. 24, Springer-Verlag, Berlin, 2003.
[49]Stanley, Richard P., Decompositions of rational convex polytopes, Annals of Discrete Mathematics, vol. 6 (1980), pp. 333342.
[50]Sturmfels, Bernd, On vector partition functions. Journal of Combinatorial Theory, Series A, vol. 72 (1995), no. 2, pp. 302309.
[51]Sturmfels, Bernd, Gröbner Bases and Convex Polytopes, University Lecture Series, vol. 8, American Mathematical Society, Providence, RI, 1996.
[52]Thomas, Rekha, A geometric Buchberger algorithm for integer programming. Mathematics of Operations Research, vol. 20 (1995), no. 4, pp. 864884.
[53]Thomas, Rekha, The structure of group relaxations, Handbooks in Operations Research and Management Science, vol. 12, Elsevier, Amsterdam, 2005, pp. 123170.
[54]Verdoolaege, Sven and Woods, Kevin, Counting with rational generating functions. Journal of Symbolic Computation, vol. 43 (2008), no. 2, pp. 7591.
[55]Wolper, Pierre and Boigelot, Bernard, An automata-theoretic approach to Presburger arithmetic constraints, Static analysis, 2nd international symposium, Lecture Notes in Computer Science, vol. 983, Springer, Berlin, 1995, pp. 2132.
[56]Woods, Kevin, Rational generating functions and lattice point sets, Ph.D. thesis, University of Michigan, Ann Arbor, 2004.

Keywords

PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS

  • KEVIN WOODS (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed