A Euclid style algorithm for MacMahon's partition analysis (Q482232): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LattE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Omega / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981750187 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1208.6074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Equality Constrained Integer Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MacMahon's partition analysis: The Omega package / rank
 
Normal rank
Property / cites work
 
Property / cites work: MacMahon's partition analysis. VI: A new reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936005 / 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: Computing the Continuous Discretely / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer points in polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many aspects of counting lattice points in polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective lattice point counting in rational convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Counting Lattice Points in Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynômes arithmétiques et méthode des polyedres en combinatoire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariants, Kronecker products, and combinatorics of some remarkable Diophantine systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Barvinok Algorithm Based on Irrational Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic invariants of five qubits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial reciprocity theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for MacMahon's partition analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of Stanley's monster reciprocity theorem / rank
 
Normal rank

Latest revision as of 12:04, 9 July 2024

scientific article
Language Label Description Also known as
English
A Euclid style algorithm for MacMahon's partition analysis
scientific article

    Statements

    A Euclid style algorithm for MacMahon's partition analysis (English)
    0 references
    0 references
    19 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    MacMahon's partition analysis
    0 references
    polytopes
    0 references
    lattice points
    0 references
    Ehrhart polynomials
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references