Enumeration of Graded (3 + 1)-Avoiding Posets
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 generat...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2012-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/3019/pdf |
| _version_ | 1797270312343044096 |
|---|---|
| author | Joel Lewis Brewster Yan X Zhang |
| author_facet | Joel Lewis Brewster Yan X Zhang |
| author_sort | Joel Lewis Brewster |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T02:02:16Z |
| format | Article |
| id | doaj.art-d4b44c8e773f4745b803910109e032ca |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T02:02:16Z |
| publishDate | 2012-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-d4b44c8e773f4745b803910109e032ca2024-03-07T14:51:45ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502012-01-01DMTCS Proceedings vol. AR,...Proceedings10.46298/dmtcs.30193019Enumeration of Graded (3 + 1)-Avoiding PosetsJoel Lewis Brewster0Yan X Zhang1Massachusetts Institute of TechnologyMassachusetts Institute of TechnologyThe 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://dmtcs.episciences.org/3019/pdfposets(3 + 1)-avoidinggenerating functions[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Joel Lewis Brewster Yan X Zhang Enumeration of Graded (3 + 1)-Avoiding Posets Discrete Mathematics & Theoretical Computer Science posets (3 + 1)-avoiding generating functions [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | Enumeration of Graded (3 + 1)-Avoiding Posets |
| title_full | Enumeration of Graded (3 + 1)-Avoiding Posets |
| title_fullStr | Enumeration of Graded (3 + 1)-Avoiding Posets |
| title_full_unstemmed | Enumeration of Graded (3 + 1)-Avoiding Posets |
| title_short | Enumeration of Graded (3 + 1)-Avoiding Posets |
| title_sort | enumeration of graded 3 1 avoiding posets |
| topic | posets (3 + 1)-avoiding generating functions [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/3019/pdf |
| work_keys_str_mv | AT joellewisbrewster enumerationofgraded31avoidingposets AT yanxzhang enumerationofgraded31avoidingposets |