Signed tree associahedra

Vincent Pilaud

Signed tree associahedra

Vincent Pilaud

Résultats de recherche: Contribution à un journal › Article de conférence › Revue par des pairs

Résumé

An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. J.-L. Loday gave a particularly elegant realization of the associahedron, which was then generalized in two directions: on the one hand to obtain realizations of graph associahedra, and on the other hand to obtain multiple realizations of the associahedron parametrized by a sequence of signs. The goal of this paper is to unify and extend these two constructions to signed tree associahedra.

langue originale	Anglais
Pages (de - à)	309-320
Nombre de pages	12
journal	Discrete Mathematics and Theoretical Computer Science
état	Publié - 1 janv. 2014
Evénement	26th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2014 - Chicago, États-Unis Durée: 29 juin 2014 → 3 juil. 2014

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

@article{daf94142409e4573aef362a4f968be3a,

title = "Signed tree associahedra",

abstract = "An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. J.-L. Loday gave a particularly elegant realization of the associahedron, which was then generalized in two directions: on the one hand to obtain realizations of graph associahedra, and on the other hand to obtain multiple realizations of the associahedron parametrized by a sequence of signs. The goal of this paper is to unify and extend these two constructions to signed tree associahedra.",

keywords = "Graph associahedra, Nested complexes, Permutahedra, Polytopal realizations, Signed spines",

author = "Vincent Pilaud",

note = "Publisher Copyright: {\textcopyright} 2014 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France; 26th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2014 ; Conference date: 29-06-2014 Through 03-07-2014",

year = "2014",

month = jan,

day = "1",

language = "English",

pages = "309--320",

journal = "Discrete Mathematics and Theoretical Computer Science",

issn = "1462-7264",

}

TY - JOUR

T1 - Signed tree associahedra

AU - Pilaud, Vincent

PY - 2014/1/1

Y1 - 2014/1/1

N2 - An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. J.-L. Loday gave a particularly elegant realization of the associahedron, which was then generalized in two directions: on the one hand to obtain realizations of graph associahedra, and on the other hand to obtain multiple realizations of the associahedron parametrized by a sequence of signs. The goal of this paper is to unify and extend these two constructions to signed tree associahedra.

AB - An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. J.-L. Loday gave a particularly elegant realization of the associahedron, which was then generalized in two directions: on the one hand to obtain realizations of graph associahedra, and on the other hand to obtain multiple realizations of the associahedron parametrized by a sequence of signs. The goal of this paper is to unify and extend these two constructions to signed tree associahedra.

KW - Graph associahedra

KW - Nested complexes

KW - Permutahedra

KW - Polytopal realizations

KW - Signed spines

UR - https://www.scopus.com/pages/publications/85082963822

M3 - Conference article

AN - SCOPUS:85082963822

SN - 1462-7264

SP - 309

EP - 320

JO - Discrete Mathematics and Theoretical Computer Science

JF - Discrete Mathematics and Theoretical Computer Science

T2 - 26th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2014

Y2 - 29 June 2014 through 3 July 2014

ER -

Signed tree associahedra

Résumé

Autres fichiers et liens

Empreinte digitale

Contient cette citation