Quasi-polynomials, linear Diophantine equations and semi-linear sets

DOI10.1016/J.TCS.2011.10.014zbMATH Open1253.11042OpenAlexW2089841370MaRDI QIDQ764313FDOQ764313

Stefano Varricchio, Flavio D'Alessandro, Benedetto Intrigila

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.014

zbMATH Keywords

quasi-polynomialssemi-linear setssystems of linear Diophantine equations

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Algebraic theory of languages and automata (68Q70) Linear Diophantine equations (11D04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex Analysis
• Computing the Continuous Discretely
• Residue formulae for vector partitions and Euler-Maclaurin sums.
• The many aspects of counting lattice points in polytopes
• Topics in hyperplane arrangements, polytopes and box-splines
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• Vector partition functions and generalized Dahmen and Micchelli spaces
• The Number of Solutions to Linear Diophantine Equations and Multivariate Splines
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• On vector partition functions
• On the structure of the counting function of sparse context-free languages.
• Remarks on piecewise-linear algebra
• The Parikh counting functions of sparse context-free languages are quasi-polynomials
• Every semilinear set is a finite union of disjoint linear sets
• Counting integer flows in networks
• Interpolated Denumerants and Lambert Series

Cited In (7)

• On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
• Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials
• On the Commutative Equivalence of Algebraic Formal Series and Languages
• D-finite multivariate series with arithmetic restrictions on their coefficients
• On the commutative equivalence of bounded context-free and regular languages: the code case
• On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)
• On bounded linear codes and the commutative equivalence

This page was built for publication: Quasi-polynomials, linear Diophantine equations and semi-linear sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764313)