Notes on a short-cut to the proof of the $\mathbf{M}_3$-$\mathbf{N}_5$ Theorem
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_ | 1866913241122209792 |
|---|---|
| author | Emamy-K., M. R. Ríos, Gustavo A. Meléndez |
| author_facet | Emamy-K., M. R. Ríos, Gustavo A. Meléndez |
| contents | This paper presents two shortcuts to a classical proof of the $\mathbf{M}_3$-$\mathbf{N}_5$ Theorem, which can be found in B. Davey and H. Priestley [2] and S. Burris and H. Sankappanavar [1]. To be precise, the shortcuts pertain a particular step of the proof that requires showing an algebraic equality. In addition, we briefly discuss how to compare the lengths of the three proofs (the original and our two proposed shortcuts). To do so, we introduce two methods to compare the lengths of proofs based on algebraic lattice expressions. We call them the proof count method and the proof poset method. Both methods indicate that our proofs are shorter but the difference is more pronounced in the former.
Keywords: lattices, posets |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_14931 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Notes on a short-cut to the proof of the $\mathbf{M}_3$-$\mathbf{N}_5$ Theorem Emamy-K., M. R. Ríos, Gustavo A. Meléndez Combinatorics This paper presents two shortcuts to a classical proof of the $\mathbf{M}_3$-$\mathbf{N}_5$ Theorem, which can be found in B. Davey and H. Priestley [2] and S. Burris and H. Sankappanavar [1]. To be precise, the shortcuts pertain a particular step of the proof that requires showing an algebraic equality. In addition, we briefly discuss how to compare the lengths of the three proofs (the original and our two proposed shortcuts). To do so, we introduce two methods to compare the lengths of proofs based on algebraic lattice expressions. We call them the proof count method and the proof poset method. Both methods indicate that our proofs are shorter but the difference is more pronounced in the former. Keywords: lattices, posets |
| title | Notes on a short-cut to the proof of the $\mathbf{M}_3$-$\mathbf{N}_5$ Theorem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2402.14931 |