Enumeration of corner polyhedra and 3-connected Schnyder labelings - Base de données, Automate, Analyse d'agorithmes et Modèles Access content directly
Journal Articles The Electronic Journal of Combinatorics Year : 2023

Enumeration of corner polyhedra and 3-connected Schnyder labelings


We show that corner polyhedra and 3-connected Schnyder labelings join the growing list of planar structures that can be set in exact correspondence with (weighted) models of quadrant walks via a bijection due to Kenyon, Miller, Sheffield and Wilson. Our approach leads to a first polynomial time algorithm to count these structures, and to the determination of their exact asymptotic growth constants: the number p_n of corner polyhedra and s_n of 3-connected Schnyder woods of size n respectively satisfy (p_n)^1/n → 9/2 and (s_n)^1/n → 16/3 as n goes to infinity. While the growth rates are rational, like in the case of previously known instances of such correspondences, the exponent of the asymptotic polynomial correction to the exponential growth does not appear to follow from the now standard Denisov-Wachtel approach, due to a bimodal behavior of the step set of the underlying tandem walk. However a heuristic argument suggests that these exponents are −1 − π/ arccos(9/16) ≈ −4.23 for p_n and −1 − π/ arccos(22/27) ≈ −6.08 for s_n, which would imply that the associated series are not D-finite.
Fichier principal
Vignette du fichier
corner_schnyder.pdf (3.52 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03826426 , version 1 (24-10-2022)
hal-03826426 , version 2 (21-10-2023)
hal-03826426 , version 3 (16-11-2023)



Éric Fusy, Erkan Narmanli, Gilles Schaeffer. Enumeration of corner polyhedra and 3-connected Schnyder labelings. The Electronic Journal of Combinatorics, 2023, 30 (2), pp.P2.17. ⟨10.37236/11174⟩. ⟨hal-03826426v2⟩
98 View
24 Download



Gmail Facebook X LinkedIn More