(2+2)-free posets, ascent sequences and pattern avoiding permutations
type: Item
instance of: scholarly article
title: (2+2)-free posets, ascent sequences and pattern avoiding permutations
zbMATH Open document ID: 1225.05026
author: Mireille Bousquet-Mélou
author: Anders Claesson
author: Mark Dukes
author: Sergey Kitaev
published in: Journal of Combinatorial Theory. Series A
publication date: 2010-08-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/0806.0666
Mathematics Subject Classification ID: 05A19
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 5768644
zbMATH Keywords: (2+2)-free poset
zbMATH Keywords: ascent sequence
zbMATH Keywords: pattern avoiding permutation
zbMATH Keywords: chord diagram
zbMATH Keywords: involution
zbMATH Keywords: encode
zbMATH Keywords: enumerate
zbMATH Keywords: non-D-finite series
describes a project that uses: OEIS
describes a project that uses: ROTA
MaRDI profile type: Publication
OpenAlex ID: W2121947368
Wikidata QID: Q60692211
arXiv ID: 0806.0666
cites work: Permutation classes of polynomial growth
cites work: Restricted permutations and the wreath product
cites work: Generalized permutation patterns and a classification of the Mahonian statistics
cites work: An obvious proof of Fishburn's interval order theorem
cites work: Forest-like permutations
cites work: Crossings and nestings of matchings and partitions
cites work: A direct encoding of Stoimenow's matchings as ascent sequences
cites work: Q4918392
cites work: Betweenness, orders and interval graphs
cites work: Intransitive Indifference in Preference Theory: A Survey
cites work: Intransitive indifference with unequal indifference intervals
cites work: Counting interval orders
cites work: Height counting of unlabeled interval and \(N\)-free posets.
cites work: Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
cites work: Q4834167
cites work: A characterization of \((3+1)\)-free posets
cites work: Q4344108
cites work: Q4236280
cites work: ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
cites work: Generating trees and the Catalan and Schröder numbers
cites work: Resurrecting the asymptotics of linear recurrences
cites work: Vassiliev invariants and a strange identity related to the Dedekind eta-function
cites work: The umbral transfer-matrix method. I: Foundations
DBLP publication ID: journals/jct/Bousquet-MelouCDK10
DOI: 10.1016/J.JCTA.2009.12.007
Recommended article: Q3176569
Recommended article: Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
Recommended article: Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
Recommended article: Enumerating \((2 + 2)\)-free posets by indistinguishable elements
Recommended article: On a conjecture about enumerating \((2+2)\)-free posets
Recommended article: Q4591345
Recommended article: Pattern avoidance in poset permutations
Recommended article: Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
Recommended article: Asymptotic enumeration of permutations avoiding generalized patterns
Recommended article: Q4591306
description: scientific article