COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS (Q3112587): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: numericalsgps / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0901.1228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short rational generating functions for lattice point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci-like behavior of the number of numerical semigroups of a given genus. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of numerical semigroups of a given genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a better understanding of the semigroup tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short rational functions for toric algebra and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on the number of numerical semigroups of a given genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Weierstrass numerical semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric integer programming algorithm for bilevel mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Counting Integral Points in a Convex Rational Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical semigroups with multiplicity three and four. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Frobenius problem for numerical semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical semigroups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYSTEMS OF INEQUALITIES AND NUMERICAL SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental gaps in numerical semigroups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting integer points in parametric polytopes using Barvinok's rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting with rational generating functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing numerical semigroups of a given genus. / rank
 
Normal rank

Latest revision as of 20:26, 4 July 2024

scientific article
Language Label Description Also known as
English
COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS
scientific article

    Statements

    COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS (English)
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    numerical semigroups
    0 references
    generating functions
    0 references
    counting algorithms
    0 references
    Frobenius numbers
    0 references
    multiplicities
    0 references
    genera
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references