Half-turn symmetric FPLs with rare couplings and tilings of hexagons
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | AVAL, Jean-Christophe | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| dc.contributor.author | DUCHON, Philippe | |
| dc.date.accessioned | 2024-04-15T09:47:01Z | |
| dc.date.available | 2024-04-15T09:47:01Z | |
| dc.date.created | 2011 | |
| dc.date.issued | 2013 | |
| dc.identifier.issn | 1879-2294 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198057 | |
| dc.description.abstractEn | In this work, we put to light a formula that relies the number of fully packed loop configurations (FPLs) associated to a given coupling pi to the number of half-turn symmetric FPLs (HTFPLs) of even size whose coupling is a punctured version of the coupling pi. When the coupling pi is the coupling with all arches parallel pi0 (the ''rarest'' one), this formula states the equality of the number of corresponding HTFPLs to the number of cyclically-symmetric plane partition of the same size. We provide a bijective proof of this fact. In the case of HTFPLs odd size, and although there is no similar expression, we study the number of HTFPLs whose coupling is a slit version of pi_0, and put to light new puzzling enumerative coincidence involving countings of tilings of hexagons and various symmetry classes of FPLs. | |
| dc.language.iso | en | |
| dc.publisher | Elsevier | |
| dc.subject.en | Fully packed loop configurations | |
| dc.subject.en | alternating sign matrices | |
| dc.subject.en | tilings of hexagons | |
| dc.title.en | Half-turn symmetric FPLs with rare couplings and tilings of hexagons | |
| dc.type | Article de revue | |
| dc.subject.hal | Mathématiques [math]/Combinatoire [math.CO] | |
| dc.identifier.arxiv | 1109.0366 | |
| bordeaux.journal | Theoretical Computer Science | |
| bordeaux.page | 143-152 | |
| bordeaux.volume | 502 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00618319 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00618319v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Theoretical%20Computer%20Science&rft.date=2013&rft.volume=502&rft.spage=143-152&rft.epage=143-152&rft.eissn=1879-2294&rft.issn=1879-2294&rft.au=AVAL,%20Jean-Christophe&DUCHON,%20Philippe&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||