Lonely points in simplices

DOI10.1007/s00454-022-00428-2OpenAlexW2945233983MaRDI QIDQ2679594

Manuel Kauers, Laura Kovács, Maximilian Jaroschek

Publication date: 23 January 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

polytopesinteger pointscongruence modulo latticesdiscrete geomtry

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorial aspects of packing and covering (05B40) Combinatorial complexity of geometric structures (52C45)

Uses Software

• Cfinite
• Dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal Laurent series in several variables
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Factorization of $C$-finite sequences
• The \(C\)-finite ansatz
• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• Polynomials whose powers are sparse
• Computing the Continuous Discretely
• Decision Problems for Linear Recurrence Sequences
• Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences
• Polynomial Invariants for Affine Programs
• Ideals, Varieties, and Algorithms