Computing the Ehrhart quasi-polynomial of a rational simplex (Q5470061): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LattE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0504444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds in some transference theorems in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Ehrhart polynomial of a convex lattice polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the volume, counting integral points, and exponential sums / 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: Q4938470 / 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: Irrational proofs for three theorems of Stanley / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3278470 / 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: The Ehrhart polynomial of a lattice polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4309969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice invariant valuations on rational polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3317685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pick's theorem and the Todd class of a toric variety / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles representing the Todd class of a toric variety / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987679810 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:21, 30 July 2024

scientific article; zbMATH DE number 5028544
Language Label Description Also known as
English
Computing the Ehrhart quasi-polynomial of a rational simplex
scientific article; zbMATH DE number 5028544

    Statements

    Computing the Ehrhart quasi-polynomial of a rational simplex (English)
    0 references
    29 May 2006
    0 references
    Rational polytope
    0 references
    lattice points
    0 references
    Ehrhart quasipolynomial
    0 references
    poly-nomial-time algorithm
    0 references

    Identifiers