The Descent Set and Connectivity Set of a Permutation
The descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w).
Stanley, Richard P.
core +1 more source
What Does It Take to Solve the 3D Ising Model? Minimal Necessary Conditions for a Valid Solution. [PDF]
Viswanathan GM+3 more
europepmc +1 more source
Bijections for Dyck paths with colored hills [PDF]
Kostas Manes, Ioannis Tasoulas
doaj +1 more source
Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area [PDF]
Cyril Banderier, Bernhard Gittenberger
openalex +1 more source
Lessons in Enumerative Combinatorics. By Ömer Eğecioğlu and Adriano M. Garsia. Springer, 2021. Softcover, pp. xvi + 479. ISBN 978-3-030-71252-5. Price EUR 68.56. [PDF]
Firdous Ahmad Mala
openalex +1 more source
The mysterious story of square ice, piles of cubes, and bijections. [PDF]
Fischer I, Konvalinka M.
europepmc +1 more source
Combinatoric results for graphical enumeration and the higher Catalan numbers
Virgil U. Pierce
openalex +2 more sources
Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models. [PDF]
Chauve C, Ponty Y, Wallner M.
europepmc +1 more source
Defining and demonstrating an equivalence way of thinking in enumerative combinatorics
E. Lockwood, Zackery Reed
semanticscholar +1 more source