scholarly journals EL-labelings and canonical spanning trees for subword complexes

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Vincent Pilaud ◽  
Christian Stump

International audience We describe edge labelings of the increasing flip graph of a subword complex on a finite Coxeter group, and study applications thereof. On the one hand, we show that they provide canonical spanning trees of the facet-ridge graph of the subword complex, describe inductively these trees, and present their close relations to greedy facets. Searching these trees yields an efficient algorithm to generate all facets of the subword complex, which extends the greedy flip algorithm for pointed pseudotriangulations. On the other hand, when the increasing flip graph is a Hasse diagram, we show that the edge labeling is indeed an EL-labeling and derive further combinatorial properties of paths in the increasing flip graph. These results apply in particular to Cambrian lattices, in which case a similar EL-labeling was recently studied by M. Kallipoliti and H. Mühle.

Author(s):  
Fabrizio Caselli ◽  
Michele D’Adderio ◽  
Mario Marietti

Abstract We provide a weaker version of the generalized lifting property that holds in complete generality for all Coxeter groups, and we use it to show that every parabolic Bruhat interval of a finite Coxeter group is a Coxeter matroid. We also describe some combinatorial properties of the associated polytopes.


2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Bridget Eileen Tenner

International audience The Bruhat order gives a poset structure to any Coxeter group. The ideal of elements in this poset having boolean principal order ideals forms a simplicial poset. This simplicial poset defines the boolean complex for the group. In a Coxeter system of rank n, we show that the boolean complex is homotopy equivalent to a wedge of (n-1)-dimensional spheres. The number of these spheres is the boolean number, which can be computed inductively from the unlabeled Coxeter system, thus defining a graph invariant. For certain families of graphs, the boolean numbers have intriguing combinatorial properties. This work involves joint efforts with Claesson, Kitaev, and Ragnarsson. \par L'ordre de Bruhat munit tout groupe de Coxeter d'une structure de poset. L'idéal composé des éléments de ce poset engendrant des idéaux principaux ordonnés booléens, forme un poset simplicial. Ce poset simplicial définit le complexe booléen pour le groupe. Dans un système de Coxeter de rang n, nous montrons que le complexe booléen est homotopiquement équivalent à un bouquet de sphères de dimension (n-1). Le nombre de ces sphères est le nombre booléen, qui peut être calculé inductivement à partir du système de Coxeter non-étiquetté; définissant ainsi un invariant de graphe. Pour certaines familles de graphes, les nombres booléens satisfont des propriétés combinatoires intriguantes. Ce travail est une collaboration entre Claesson, Kitaev, et Ragnarsson.


2013 ◽  
Vol Vol. 15 no. 2 (Automata, Logic and Semantics) ◽  
Author(s):  
Marcella Anselmo ◽  
Maria Madonia

Automata, Logic and Semantics International audience The paper presents a condition necessarily satisfied by (tiling system) recognizable two-dimensional languages. The new recognizability condition is compared with all the other ones known in the literature (namely three conditions), once they are put in a uniform setting: they are stated as bounds on the growth of some complexity functions defined for two-dimensional languages. The gaps between such functions are analyzed and examples are shown that asymptotically separate them. Finally the new recognizability condition results to be the strongest one, while the remaining ones are its particular cases. The problem of deciding whether a two-dimensional language is recognizable is here related to the one of estimating the minimal size of finite automata recognizing a sequence of (one-dimensional) string languages.


2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Florent Hivert ◽  
Anne Schilling ◽  
Nicolas M. Thiéry

arXiv : http://arxiv.org/abs/0912.2212 International audience For any finite Coxeter group $W$, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on $W$. The construction of the biHecke monoid relies on the usual combinatorial model for the $0-Hecke$ algebra $H_0(W)$, that is, for the symmetric group, the algebra (or monoid) generated by the elementary bubble sort operators. The authors previously introduced the Hecke group algebra, constructed as the algebra generated simultaneously by the bubble sort and antisort operators, and described its representation theory. In this paper, we consider instead the monoid generated by these operators. We prove that it admits |W| simple and projective modules. In order to construct the simple modules, we introduce for each $w∈W$ a combinatorial module $T_w$ whose support is the interval $[1,w]_R$ in right weak order. This module yields an algebra, whose representation theory generalizes that of the Hecke group algebra, with the combinatorics of descents replaced by that of blocks and of the cutting poset. Pour tout groupe de Coxeter fini $W$, nous définissons deux nouveaux objets : son ordre de coupures et son monoïde de Hecke double. L'ordre de coupures, construit au moyen d'une généralisation de la notion de bloc dans les matrices de permutations, est presque un treillis sur $W$. La construction du monoïde de Hecke double s'appuie sur le modèle combinatoire usuel de la $0-algèbre$ de Hecke $H_0(W)$, pour le groupe symétrique, l'algèbre (ou le monoïde) engendré par les opérateurs de tri par bulles élémentaires. Les auteurs ont introduit précédemment l'algèbre de Hecke-groupe, construite comme l'algèbre engendrée conjointement par les opérateurs de tri et d'anti-tri, et décrit sa théorie des représentations. Dans cet article, nous considérons le monoïde engendré par ces opérateurs. Nous montrons qu'il admet $|W|$ modules simples et projectifs. Afin de construire ses modules simples, nous introduisons pour tout $w∈W$ un module combinatoire $T_w$ dont le support est l'intervalle [$1,w]_R$ pour l'ordre faible droit. Ce module détermine une algèbre dont la théorie des représentations généralise celle de l'algèbre de Hecke groupe, en remplaçant la combinatoire des descentes par celle des blocs et de l'ordre de coupures.


2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Aram Dermenjian ◽  
Christophe Hohlweg ◽  
Vincent Pilaud

International audience We investigate a poset structure that extends the weak order on a finite Coxeter group W to the set of all faces of the permutahedron of W. We call this order the facial weak order. We first provide two alternative characterizations of this poset: a first one, geometric, that generalizes the notion of inversion sets of roots, and a second one, combinatorial, that uses comparisons of the minimal and maximal length representatives of the cosets. These characterizations are then used to show that the facial weak order is in fact a lattice, generalizing a well-known result of A. Bjo ̈rner for the classical weak order. Finally, we show that any lattice congruence of the classical weak order induces a lattice congruence of the facial weak order, and we give a geometric interpretation of its classes.


2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Saúl A. Blanco

International audience We define a poset using the shortest paths in the Bruhat graph of a finite Coxeter group $W$ from the identity to the longest word in $W, w_0$. We show that this poset is the union of Boolean posets of rank absolute length of $w_0$; that is, any shortest path labeled by reflections $t_1,\ldots,t_m$ is fully commutative. This allows us to give a combinatorial interpretation to the lowest-degree terms in the complete $\textbf{cd}$-index of $W$. Nous définissons un poset en utilisant le plus court chemin entre l'identité et le plus long mot de $W, w_0$, dans le graph de Bruhat du groupe finie Coxeter, $W$. Nous prouvons que ce poset est l'union de posets Boolean du même rang que la longueur absolute de $w_0$; ça signifie que tous les plus courts chemins, étiquetés par réflexions $t_1,\ldots, t_m$ sont totalement commutatives. Ça nous permet de donner une interprétation combinatoire aux termes avec le moindre grade dans le $\textbf{cd}$-index complet de $W$.


2006 ◽  
Vol Volume 5, Special Issue TAM... ◽  
Author(s):  
F. El Dabaghi ◽  
M. Bechchi ◽  
H. Henine

International audience This work presents the Adaptative Integrated Information System under Web (AIISW) for the management of hydrous resources. The AIISW is a natural extension of the IISW-WADI towards an adaptative and customised architecture according to the user profile or the context of use including : a research and indexation engine system, simulators, a GIS and meshing editors as well as graphic viewers. This AIISW allows on the one hand to manage in an automatic way data of simulators and on the other hand to exploit and calibrate eventually in real time the results of these simulations by corroborating them with extracted or identified parameters. Ce travail présente le Système d'Information Intégré Adaptatif sous Web (SIIAW) pour la gestion des ressources hydriques. Le SIIAW est une extension naturelle du S2IW-WADI vers une architechture adaptative et personnalisée en fonction de l'utilisateur et du contexte d'utilisation incluant: un système de recherche et d'indexation, des codes de simulations, un SIG et des mailleurs ainsi que des visualiseurs graphiques. Ce SIIAW permet ainsi d'une part de manipuler de manière automatique les données des simulateurs et d'autre part d'exploiter et de caler éventuellement en temps réel les résultats de ces simulations en les corroborant avec des paramètres extraits ou identifiés.


2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
C. Ceballos ◽  
T. Manneville ◽  
V. Pilaud ◽  
L. Pournin

International audience The $n$-dimensional associahedron is a polytope whose vertices correspond to triangulations of a convex $(n + 3)$-gon and whose edges are flips between them. It was recently shown that the diameter of this polytope is $2n - 4$ as soon as $n > 9$. We study the diameters of the graphs of relevant generalizations of the associahedron: on the one hand the generalized associahedra arising from cluster algebras, and on the other hand the graph associahedra and nestohedra. Related to the diameter, we investigate the non-leaving-face property for these polytopes, which asserts that every geodesic connecting two vertices in the graph of the polytope stays in the minimal face containing both. L’associaèdre de dimension $n$ est un polytope dont les sommets correspondent aux triangulations d’un $(n + 3)$-gone convexe et dont les arêtes sont les échanges entre ces triangulations. Il a été récemment démontré que le diamètre de ce polytope est $2n - 4$ dès que $n > 9$. Nous étudions les diamètres des graphes de certaines généralisations de l’associaèdre : d’une part les associaèdres généralisés provenant des algèbres amassées, et d’autre part les associaèdres de graphes et les nestoèdres. En lien avec le diamètre, nous étudions si toutes les géodésiques entre deux sommets de ces polytopes restent dans la plus petite face les contenant.


2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Vincent Pilaud

International audience 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. Un associaèdre est un polytope dont les sommets correspondent aux triangulations d’un polygone convexe et dont les arêtes correspondent aux flips entre ces triangulations. J.-L. Loday a donné une construction particulièrement élégante de l’associaèdre qui a été généralisée dans deux directions : d’une part pour obtenir des réalisations des associaèdres de graphes, et d’autre part pour obtenir de multiples réalisations de l’associaèdre paramétrées par une suite de signes. L’objectif de ce travail est d’unifier et d’étendre ces constructions aux associaèdres d’arbres signés.


2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Sabine Beil

International audience In this work triangular puzzles that are composed of unit triangles with labelled edges are considered. To be more precise, the labelled unit triangles that we allow are on the one hand the puzzle pieces that compute Schubert calculus and on the other hand the flipped K-theory puzzle piece. The motivation for studying such puzzles comes from the fact that they correspond to a class of oriented triangular fully packed loop configurations. The main result that is presented is an expression for the number of these puzzles with a fixed boundary in terms of Littlewood- Richardson coefficients.


Sign in / Sign up

Export Citation Format

Share Document