Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Unlabeled $(2+2)$-fr ...
Conference paper

Unlabeled $(2+2)$-free posets, ascent sequences and pattern avoiding permutations

Mireille Bousquet-Mélou ORCID (1), Anders Claesson (2), Mark Dukes ORCID (3) (4), Sergey Kitaev ORCID (5)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) The Mathematics Institute, Reyjavik University
(3) Science Institute, University of Iceland
(4) University of Iceland [Reykjavik]
(5) Institute of Mathematics
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2008
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
Proceedings
DOI
10.46298/dmtcs.2723
License
https://about.hal.science/hal-authorisation-v1
French National Research Agency (ANR)
ANR-05-BLAN-0372
Indicators
731
Views
550
Downloads

Unlabeled $(2+2)$-free posets, ascent sequences and pattern avoiding permutations

Mireille Bousquet-Mélou ORCID (1), Anders Claesson (2), Mark Dukes ORCID (3) (4), Sergey Kitaev ORCID (5)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) The Mathematics Institute, Reyjavik University
(3) Science Institute, University of Iceland
(4) University of Iceland [Reykjavik]
(5) Institute of Mathematics
Abstract
English
We present statistic-preserving bijections between four classes of combinatorial objects. Two of them, the class of unlabeled $(\textrm{2+2})$-free posets and a certain class of chord diagrams (or involutions), already appeared in the literature, but were apparently not known to be equinumerous. The third one is a new class of pattern avoiding permutations, and the fourth one consists of certain integer sequences called $\textit{ascent sequences}$. We also determine the generating function of these classes of objects, thus recovering a non-D-finite series obtained by Zagier for chord diagrams. Finally, we characterize the ascent sequences that correspond to permutations avoiding the barred pattern $3\bar{1}52\bar{4}$, and enumerate those permutations, thus settling a conjecture of Pudwell.
French
Nous présentons des bijections, transportant de nombreuses statistiques, entre quatre classes d'objets. Deux d'entre elles, la classe des EPO (ensembles partiellement ordonnés) sans motif $(\textrm{2+2})$ et une certaine classe d'involutions, sont déjà apparues dans la littérature. La troisième est une classe de permutations à motifs exclus, et la quatrième une classe de suites que nous appelons $\textit{suites à montées}$. Nous déterminons ensuite la série génératrice de ces classes, retrouvant ainsi un résultat prouvé par Zagier pour les involutions sus-mentionnées. La série obtenue n'est pas D-finie. Apparemment, le fait qu'elle compte aussi les EPO sans motif $(\textrm{2+2})$ est nouveau. Finalement, nous caractérisons les suites à montées qui correspondent aux permutations évitant le motif barré $3\bar{1}52\bar{4}$ et énumérons ces permutations, ce qui démontre une conjecture de Pudwell.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • $(\mathrm{2+2})$-free poset
  • interval order
  • pattern-avoidance
  • enumeration
  • ascent sequence
  • kernel method
Cited by

Source: OpenCitations

  • Some open problems on permutation patterns

    arXiv (Cornell University)

    Authors : Einar Steingrímsson ORCID

    Journal reference : Volume , 2013, pp. 239-264

    DOI : 10.1017/cbo9781139506748.007
Preview
Loading PDF preview...