Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior

DOI10.19086/da.1254zbMath1404.11029arXiv1608.08520OpenAlexW3098542245MaRDI QIDQ4645009

No author found.

Publication date: 9 January 2019

Published in: Discrete Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.08520

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Counting solutions of Diophantine equations (11D45)

Related Items (6)

A Plethora of Polynomials: A Toolbox for Counting Problems ⋮ Periodic behavior in families of numerical and affine semigroups via parametric Presburger arithmetic ⋮ Parametric Presburger arithmetic: complexity of counting and quantifier elimination ⋮ On parametrized families of numerical semigroups ⋮ A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems ⋮ On factorization invariants and Hilbert functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The unreasonable ubiquitousness of quasi-polynomials
• Weak quantifier elimination for the full linear theory of the integers
• Quantifier elimination for modules with scalar variables
• Bounding quantification in parametric expansions of Presburger arithmetic
• The parametric Frobenius problem
• Integer hulls of linear polyhedra and scl in families
• Parametrizing an Integer Linear Program by an Integer
• Computing the Continuous Discretely
• On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
• Discretely ordered modules as a first-order extension of the cutting planes proof system
• Convex Polytopes
• Generalized Ehrhart polynomials

This page was built for publication: Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior