Signed permutations and the four color theorem
| dc.creator | Eliahou, Shalom | |
| dc.creator | Lecouvey, Cedric | |
| dc.date | 2006-06-28 | |
| dc.date.accessioned | 2026-07-07T07:17:48Z | |
| dc.date.available | 2026-07-07T07:17:48Z | |
| dc.description | To each permutation $σ$ in $S_{n}$ we associate a triangulation of a fixed $(n+2)$-gon. We then determine the fibers of this association and show that they coincide with the sylvester classes depicted By Novelli, Hivert and Thibon. A signed version of this construction allows us to reformulate the four color theorem in terms of the existence of a signable path between any two permutations in the Cayley graph of the symmetric group $S_{n}. | |
| dc.description | 29 pages, 9 figures | |
| dc.identifier | https://arxiv.org/abs/math/0606726 | |
| dc.identifier | http://arxiv.org/abs/math/0606726 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/114076 | |
| dc.subject | Combinatorics | |
| dc.title | Signed permutations and the four color theorem | |
| dc.type | text |