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. Four Variations on G ...
Conference paper

Four Variations on Graded Posets

Yan X Zhang (1)
(1) Department of Mathematics [Berkeley]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2014
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Proceedings
DOI
10.46298/dmtcs.2492
License
Attribution 4.0 International (CC BY 4.0)
Indicators
667
Views
2323
Downloads

Four Variations on Graded Posets

Yan X Zhang (1)
(1) Department of Mathematics [Berkeley]
Abstract
English
We explore the enumeration of some natural classes of graded posets, including $(2 + 2)$-avoiding graded posets, $(3 + 1)$-avoiding graded posets, $(2 + 2)$- and $(3 + 1)$-avoiding graded posets, and the set of all graded posets. As part of this story, we discuss a situation when we can switch between enumeration of labeled and unlabeled objects with ease, which helps us generalize a result by Postnikov and Stanley from the theory of hyperplane arrangements, answer a question posed by Stanley, and see an old result of Klarner in a new light.
French
Nous étudions l’énumération de certaines classes naturelles de posets gradués, y compris ceux qui évitent les motifs $(2+2)$, $(3+1)$, $(2+2)$ et $(3+1)$, et l’ensemble de tous les posets gradués. En particulier, nous considérons une situation où l’énumération d’objets marqués et non marqués sont reliées de façon simple, ce qui nous permet de généraliser un résultat de Postnikov et Stanley en théorie des arrangements d’hyperplans, répondre à une question posée par Stanley, et voir sous un nouveau jour un vieux résultat de Klarner et Kreweras.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • posets
  • combinatorics
  • generating functions
  • poset avoidance
  • linear algebra
Cited by

Source: OpenCitations

  • Structure and Enumeration of (3+1)-Free Posets

    arXiv (Cornell University)

    Authors : Mathieu Guay-Paquet, Alejandro H. Morales, Eric Rowland

    Journal reference : Volume 18, 2014, pp. 645-674

    DOI : 10.1007/s00026-014-0249-2
Preview
Loading PDF preview...