A direct encoding of Stoimenow's matchings as ascent sequences
From MaRDI portal
Publication:3090464
zbMath1228.05232arXiv0910.1619MaRDI QIDQ3090464
Mark Dukes, Anders Claesson, Sergey Kitaev
Publication date: 31 August 2011
Full work available at URL: https://arxiv.org/abs/0910.1619
Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Congruences for Taylor expansions of quantum modular forms ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics ⋮ Partitions and partial matchings avoiding neighbor patterns ⋮ (2+2)-free posets, ascent sequences and pattern avoiding permutations ⋮ Asymptotics for the number of row-Fishburn matrices ⋮ An operator on ascent sequences
This page was built for publication: A direct encoding of Stoimenow's matchings as ascent sequences
