Geodesic
h * -vectors of graph polytopes using activities of dissecting spanning trees
Kálmán, Tamás1 ; Tóthmérész, Lilla2
1 Department of Mathematics, Tokyo Institute of Technology, H-214, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8551 and International Institute for Sustainability with Knotted Chiral Meta Matter (WPI-SKCM 2 ), Hiroshima University, 1-3-1 Kagamiyama, Higashi-Hiroshima, Hiroshima 739-8526, Japan
2 ELTE Eötvös Loránd University and HUN-REN–ELTE Egerváry Research Group on Combinatorial Optimization 1117, Pázmány Péter sétány 1/C, Budapest, Hungary
Algebraic Combinatorics, Tome 6 (2023) no. 6, pp. 1637-1651

Voir la notice de l'article provenant de la source Numdam

Symmetric edge polytopes of graphs and root polytopes of semi-balanced digraphs are two classes of lattice polytopes whose h * -polynomials have interesting properties and generalize important graph polynomials. For both types of polytopes there is a large, natural class of dissections into unimodular simplices. These are such that the simplices correspond to certain spanning trees.

We show that for any “spanning tree dissection” of the symmetric edge polytope of a graph, or the root polytope of a semi-balanced digraph, the h * -polynomial of the polytope can be computed as a generating function of certain activities of the corresponding spanning trees. Apart from giving simple and flexible algorithms for computing these polynomials, our results also reveal that all dissections in question are surprisingly similar to each other: the distributions of many statistics of spanning tree dissections are in fact independent of the actual dissection.

Reçu le :
Accepté le :
Publié le :
DOI : 10.5802/alco.318
Classification : 52B20, 05C31
Keywords: symmetric edge polytope, root polytope, $h^*$-vector, activity

Kálmán, Tamás 1 ; Tóthmérész, Lilla 2

1 Department of Mathematics, Tokyo Institute of Technology, H-214, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8551 and International Institute for Sustainability with Knotted Chiral Meta Matter (WPI-SKCM 2 ), Hiroshima University, 1-3-1 Kagamiyama, Higashi-Hiroshima, Hiroshima 739-8526, Japan
2 ELTE Eötvös Loránd University and HUN-REN–ELTE Egerváry Research Group on Combinatorial Optimization 1117, Pázmány Péter sétány 1/C, Budapest, Hungary
Licence : CC-BY 4.0
Droits d'auteur : Les auteurs conservent leurs droits 
@article{ALCO_2023__6_6_1637_0,
     author = {K\'alm\'an, Tam\'as and T\'othm\'er\'esz, Lilla},
     title = {$h^*$-vectors of graph polytopes using activities of dissecting spanning trees},
     journal = {Algebraic Combinatorics},
     pages = {1637--1651},
     publisher = {The Combinatorics Consortium},
     volume = {6},
     number = {6},
     year = {2023},
     doi = {10.5802/alco.318},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.5802/alco.318/}
}
TY  - JOUR
AU  - Kálmán, Tamás
AU  - Tóthmérész, Lilla
TI  - $h^*$-vectors of graph polytopes using activities of dissecting spanning trees
JO  - Algebraic Combinatorics
PY  - 2023
SP  - 1637
EP  - 1651
VL  - 6
IS  - 6
PB  - The Combinatorics Consortium
UR  - http://geodesic.mathdoc.fr/articles/10.5802/alco.318/
DO  - 10.5802/alco.318
LA  - en
ID  - ALCO_2023__6_6_1637_0
ER  - 
%0 Journal Article
%A Kálmán, Tamás
%A Tóthmérész, Lilla
%T $h^*$-vectors of graph polytopes using activities of dissecting spanning trees
%J Algebraic Combinatorics
%D 2023
%P 1637-1651
%V 6
%N 6
%I The Combinatorics Consortium
%U http://geodesic.mathdoc.fr/articles/10.5802/alco.318/
%R 10.5802/alco.318
%G en
%F ALCO_2023__6_6_1637_0
Kálmán, Tamás; Tóthmérész, Lilla. $h^*$-vectors of graph polytopes using activities of dissecting spanning trees. Algebraic Combinatorics, Tome 6 (2023) no. 6, pp. 1637-1651. doi: 10.5802/alco.318

Cité par Sources :