Image de couverture de livre

Counting Lattice Points in Generalized Permutohedra From A to B

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Thawinrak, Warut
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Short Proof for the Polynomiality of the Stretched Littlewood-Richardson Coefficients
par: Thawinrak, Warut
Publié: (2022)

Parking Function Polytopes
par: Liu, Fu, et autres
Publié: (2025)

The Syntax Of Polytopal Projections: From Permutohedra To Associahedra
par: Adžić, Miloš, et autres
Publié: (2026)

Lattices from Pointed Building Sets: Generalized Ornamentation Lattices
par: Sack, Andrew
Publié: (2026)

Sums of Weighted Lattice Points of Polytopes
par: De Loera, Jesús A., et autres
Publié: (2024)

Closed-Form Decomposition for Simplicial Cones and PDBarv Algorithm for Lattice Point Counting
par: Tao, Sihao, et autres
Publié: (2025)

Counting (and Randomly Generating) Hamiltonian Cycles in Rectangular Grids
par: Blanco, Pablo, et autres
Publié: (2026)

Point Count of the Top-dimensional Open Positroid Variety
par: Yost-Wolff, Calvin
Publié: (2026)

Derangements and Generalizations: A Counting Note on the Matching Problem
par: Luciano, Antoine
Publié: (2025)

Discrepancy Beyond Additive Functions with Applications to Fair Division
par: Hollender, Alexandros, et autres
Publié: (2025)

Counting Spinal Tree-Child Networks via Word Encodings and Generating Functions
par: Vives, Pau, et autres
Publié: (2026)

Counting Triangles in Triangles
par: Propp, Jim, et autres
Publié: (2024)

A Relationship for LYM Inequalities between Boolean Lattices and Linear Lattices with Applications
par: Liu, Jiuqiang, et autres
Publié: (2024)

Making Walks Count: From Silent Circles to Hamiltonian Cycles
par: Alekseyev, Max A., et autres
Publié: (2016)

Generalizing Lattice Structures to Hypergraphs: Spectra of Clique and Hyperedge-based Laplacians
par: Andreotti, Eleonora
Publié: (2025)

Isomorphisms between Covering-Induced Lattices and Classical Geometric Lattices
par: Cabrera, Elvis, et autres
Publié: (2025)

Counting degree-constrained orientations
par: Yu, Jing, et autres
Publié: (2025)

Matchings with Prescribed Color Counts
par: Popescu, Tudor
Publié: (2025)

Counting cycles in planar triangulations
par: Lo, On-Hei Solomon, et autres
Publié: (2022)

Counting triangles in regular graphs
par: He, Jialin, et autres
Publié: (2023)

Lattice-free Schubitopes
par: Dou, Jinren, et autres
Publié: (2026)

Problems on the Triangular Lattice
par: Brouwer, Gaston A., et autres
Publié: (2024)

Efficient Weighted Counting of Multiset Derangements
par: Ekhad, Shalosh B., et autres
Publié: (2025)

Counting cliques with prescribed intersection sizes
par: Zhao, Yuhao, et autres
Publié: (2025)

Counting Graph Homomorphisms in Bipartite Settings
par: Sason, Igal
Publié: (2025)

Counting spanning subgraphs in dense hypergraphs
par: Montgomery, Richard, et autres
Publié: (2023)

Counting subgraphs in locally dense graphs
par: Bradač, Domagoj, et autres
Publié: (2024)

Counting substructures and eigenvalues II: quadrilaterals
par: Ning, Bo, et autres
Publié: (2021)

Counting independent sets in structured graphs
par: Bucić, Matija, et autres
Publié: (2024)

A New and Faster Representation for Counting Integer Points in Parametric Polyhedra
par: Gribanov, D., et autres
Publié: (2023)

Tiling of Strip Lattices and Asymptotics
par: Milchev, Valcho
Publié: (2025)

Lattices of flats for symplectic matroids
par: Raz, Or
Publié: (2022)

Lattice polytopes with the minimal volume
par: Hamano, Ginji, et autres
Publié: (2024)

Counting fixed-point-free Cayley permutations
par: Cerbai, Giulio, et autres
Publié: (2025)

Counting cospectral graphs obtained via switching
par: Abiad, Aida, et autres
Publié: (2025)

Counting alternating permutations with restricted prefix and suffix
par: Pan, Ran, et autres
Publié: (2025)

Counting cliques without generalized theta graphs
par: Gao, Jun, et autres
Publié: (2023)

Counting rainbow triangles in edge-colored graphs
par: Li, Xueliang, et autres
Publié: (2021)

Counting tight Hamilton cycles in Dirac hypergraphs
par: Joos, Felix, et autres
Publié: (2026)

Counting lattice triangulations: Fredholm equations in combinatorics
par: Orevkov, S. Yu.
Publié: (2022)