Joel Lewis Brewster ; Yan X Zhang - Enumeration of Graded (3 + 1)-Avoiding Posets

dmtcs:3019 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) - https://doi.org/10.46298/dmtcs.3019
Enumeration of Graded (3 + 1)-Avoiding Posets

Authors: Joel Lewis Brewster 1; Yan X Zhang 1

  • 1 Massachusetts Institute of Technology

The notion of (3+1)-avoidance appears in many places in enumerative combinatorics, but the natural goal of enumerating all (3+1)-avoiding posets remains open. In this paper, we enumerate \emphgraded (3+1)-avoiding posets. Our proof consists of a number of structural theorems followed by some generating function magic.

https://doi.org/10.46298/dmtcs.3019
Source: HAL:hal-01283151v1
Volume: DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Section: Proceedings
Published on: January 1, 2012
Imported on: January 31, 2017
Keywords: posets, (3 + 1)-avoiding, generating functions,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.jcta.2013.03.012
  • 10.1016/j.jcta.2013.03.012
Enumeration of graded (3+1)-avoiding posets

Share and export

Consultation statistics

This page has been seen 182 times.
This article's PDF has been downloaded 167 times.