Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley

DOI10.1051/ITA/1991250302731zbMATH Open0739.05001OpenAlexW195251623MaRDI QIDQ3978769FDOQ3978769

Authors:

Publication date: 25 June 1992

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92393

Recommendations

• An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics
• The many aspects of counting lattice points in polytopes
• Computing the Continuous Discretely
• Publication:4938470
• scientific article; zbMATH DE number 66680

zbMATH Keywords

Dyck pathinteger points in a polytopeprincipal definitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• Decompositions of Rational Convex Polytopes
• Title not available (Why is that?)
• Algebraic languages and polyominoes enumeration
• Valuations and Euler-Type Relations on Certain Classes of Convex Polytopes
• Polynômes arithmétiques et méthode des polyedres en combinatoire
• Combinatorial reciprocity theorems
• Title not available (Why is that?)

Cited In (3)

• Enumeration of skew Ferrers diagrams and basic Bessel functions
• Computing the Continuous Discretely
• An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics

This page was built for publication: Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978769)