About maximal antichains in a product of two chains:A catch-all note
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912095234162688 |
|---|---|
| author | Bouyssou, Denis Marchant, Thierry Pirlot, Marc |
| author_facet | Bouyssou, Denis Marchant, Thierry Pirlot, Marc |
| contents | We establish one-to-one correspondences between maximal antichains in products of two finite linear orders and other mathematical objects, such as certain alignments of two strings, walks on a grid, lattice paths, words of two or three letters.
Leaning on these correspondences, we gather what is known about the number of maximal antichains in products of two finite linear orders and we establish some new results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_16243 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | About maximal antichains in a product of two chains:A catch-all note Bouyssou, Denis Marchant, Thierry Pirlot, Marc Combinatorics 06A07 (Primary) 05A05 (Secondary) G.2.1 We establish one-to-one correspondences between maximal antichains in products of two finite linear orders and other mathematical objects, such as certain alignments of two strings, walks on a grid, lattice paths, words of two or three letters. Leaning on these correspondences, we gather what is known about the number of maximal antichains in products of two finite linear orders and we establish some new results. |
| title | About maximal antichains in a product of two chains:A catch-all note |
| topic | Combinatorics 06A07 (Primary) 05A05 (Secondary) G.2.1 |
| url | https://arxiv.org/abs/2410.16243 |