Polyhedral omega: a new algorithm for solving linear Diophantine systems
From MaRDI portal
Publication:2363492
DOI10.1007/s00026-017-0349-xzbMath1432.11182arXiv1501.07773OpenAlexW2964324789WikidataQ59607217 ScholiaQ59607217MaRDI QIDQ2363492
Felix Breuer, Zafeirakis Zafeirakopoulos
Publication date: 19 July 2017
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07773
linear inequality systemgenerating functionrational functionpartition analysisinteger solutionsimplementationpolyhedral geometrypartition theorylinear Diophantine systemOmega operatorsymbolic cone
Combinatorial aspects of partitions of integers (05A17) Computer solution of Diophantine equations (11Y50) Linear Diophantine equations (11D04)
Related Items
Polyhedral omega: a new algorithm for solving linear Diophantine systems, A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins, Interview with Peter Paule, Matrix Analysis and Omega Calculus, Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras, Matrix computations with the Omega calculus
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formal Laurent series in several variables
- A Euclid style algorithm for MacMahon's partition analysis
- Combinatorics and topology of the situation of affine hyperplanes in real space
- Computing the volume, counting integral points, and exponential sums
- The power of pyramid decomposition in Normaliz
- Dedekind-Carlitz polynomials as lattice-point enumerators in rational polyhedra
- Integer points in polyhedra
- Triangulations. Structures for algorithms and applications
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Valuations and polarity
- Lecture hall partitions
- MacMahon's partition analysis. IV: Hypergeometric multisums
- Combinatorial face enumeration in convex polytopes
- MacMahon's partition analysis. VI: A new reduction algorithm
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A fast algorithm for MacMahon's partition analysis
- \(s\)-lecture hall partitions, self-reciprocal polynomials, and Gorenstein cones
- Perturbation of transportation polytopes
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- Linear homogeneous Diophantine equations and magic labelings of graphs
- Short rational functions for toric algebra and applications
- Effective lattice point counting in rational convex polytopes
- Macmahon's partition analysis IX:K-gon partitions
- Pareto Optima of Multicriteria Integer Linear Programs
- Integer Programming with a Fixed Number of Variables
- Staircases in
- How to integrate a polynomial over a simplex
- Computing the Continuous Discretely
- Points entiers dans les polyèdres convexes
- Lectures on Polytopes
- Residue formulae, vector partition functions and lattice points in rational polytopes
- Short rational generating functions for lattice point problems
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Integer Polynomial Optimization in Fixed Dimension
- MacMahon's partition analysis XII: Plane partitions
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- The maximum numbers of faces of a convex polytope
- On Counting Integral Points in a Convex Rational Polytope
- An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
- MacMahon's partition analysis: The Omega package
- MacMahon's partition analysis. VIII: Plane partition diamonds
