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
05A05: Permutations, words, matrices
06A07: Combinatorics of partially ordered sets
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
An operator on ascent sequences, The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group, Congruences for Taylor expansions of quantum modular forms, Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics, Partitions and partial matchings avoiding neighbor patterns, Asymptotics for the number of row-Fishburn matrices, (2+2)-free posets, ascent sequences and pattern avoiding permutations