Numerical semigroups, polyhedra, and posets I: the group cone
From MaRDI portal
Publication:5048457
DOI10.5070/C61055385zbMath1501.52009arXiv1912.03741OpenAlexW4206431465MaRDI QIDQ5048457
Nathan Kaplan, Christopher O'Neill
Publication date: 16 November 2022
Published in: Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.03741
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Commutative semigroups (20M14)
Related Items (3)
Numerical semigroups, polyhedra, and posets. III: Minimal presentations and face dimension ⋮ WHEN IS A NUMERICAL SEMIGROUP A QUOTIENT? ⋮ Length density and numerical semigroups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- On the number of numerical semigroups containing two coprime integers \(p\) and \(q\).
- The power of pyramid decomposition in Normaliz
- Numerical semigroups.
- Fibonacci-like growth of numerical semigroups of a given genus.
- Numerical semigroups and Kunz polytopes
- Degree asymptotics of the numerical semigroup tree.
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Some polyhedra related to combinatorial problems
- SYSTEMS OF INEQUALITIES AND NUMERICAL SEMIGROUPS
- Wilf’s conjecture in fixed multiplicity
- The Group-Theoretic Approach in Mixed Integer Programming
- Polytopes, Rings, and K-Theory
- On the linear diophantine problem of Frobenius.
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- Lectures on Polytopes
- Counting Numerical Semigroups
- Numerical Sets, Core Partitions, and Integer Points in Polytopes
- Computing the Continuous Discretely
This page was built for publication: Numerical semigroups, polyhedra, and posets I: the group cone