scholarly journals Tamari Lattices for Parabolic Quotients of the Symmetric Group

10.37236/7844 ◽  
2019 ◽  
Vol 26 (4) ◽  
Author(s):  
Henri Mühle ◽  
Nathan Williams
Keyword(s):  
Symmetric Group ◽  
Coxeter Group ◽  
Main Ingredient ◽  
Set Partitions ◽  
Tamari Lattice ◽  
Finite Coxeter Group ◽  
Tamari Lattices

We generalize the Tamari lattice by extending the notions of $231$-avoiding permutations, noncrossing set partitions, and nonnesting set partitions to parabolic quotients of the symmetric group $\mathfrak{S}_{n}$.  We show bijectively that these three objects are equinumerous.  We show how to extend these constructions to parabolic quotients of any finite Coxeter group.  The main ingredient is a certain aligned condition of inversion sets; a concept which can in fact be generalized to any reduced expression of any element in any (not necessarily finite) Coxeter group.

scholarly journals Tamari Lattices for Parabolic Quotients of the Symmetric Group

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Henri Mühle ◽  
Nathan Williams
Keyword(s):  
Symmetric Group ◽  
Coxeter Groups ◽  
Weak Order ◽  
Set Partitions ◽  
Tamari Lattice ◽  
Nous Montrons ◽  
International Audience ◽  
Tamari Lattices

International audience We present a generalization of the Tamari lattice to parabolic quotients of the symmetric group. More precisely, we generalize the notions of 231-avoiding permutations, noncrossing set partitions, and nonnesting set partitions to parabolic quotients, and show bijectively that these sets are equinumerous. Furthermore, the restriction of weak order on the parabolic quotient to the parabolic 231-avoiding permutations is a lattice quotient. Lastly, we suggest how to extend these constructions to all Coxeter groups. Nous présentons une généralisation du treillis de Tamari aux quotients paraboliques du groupe symétrique. Plus précisément, nous généralisons les notions de permutations qui évitent le motif 231, les partitions non-croisées, et les partitions non-emboîtées aux quotients paraboliques, et nous montrons de façon bijective que ces ensembles sont équipotents. En restreignant l’ordre faible du quotient parabolique aux permutations paraboliques qui évitent le motif 231, on obtient un quotient de treillis d’ordre faible. Enfin, nous suggérons comment étendre ces constructions à tous les groupes de Coxeter.

scholarly journals Noncrossing Arc Diagrams, Tamari Lattices, and Parabolic Quotients of the Symmetric Group

2021 ◽  
Author(s):  
Henri Mühle
Keyword(s):  
Symmetric Group ◽  
Partial Order ◽  
Structural Investigation ◽  
Canonical Representation ◽  
Weak Order ◽  
Noncrossing Partitions ◽  
Tamari Lattice ◽  
Semidistributive Lattice ◽  
Tamari Lattices

AbstractOrdering permutations by containment of inversion sets yields a fascinating partial order on the symmetric group: the weak order. This partial order is, among other things, a semidistributive lattice. As a consequence, every permutation has a canonical representation as a join of other permutations. Combinatorially, these canonical join representations can be modeled in terms of arc diagrams. Moreover, these arc diagrams also serve as a model to understand quotient lattices of the weak order. A particularly well-behaved quotient lattice of the weak order is the well-known Tamari lattice, which appears in many seemingly unrelated areas of mathematics. The arc diagrams representing the members of the Tamari lattices are better known as noncrossing partitions. Recently, the Tamari lattices were generalized to parabolic quotients of the symmetric group. In this article, we undertake a structural investigation of these parabolic Tamari lattices, and explain how modified arc diagrams aid the understanding of these lattices.

scholarly journals An extension of Tamari lattices

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Louis-François Préville-Ratelle ◽  
Xavier Viennot
Keyword(s):  
Symmetric Group ◽  
Binary Tree ◽  
Prime Numbers ◽  
Binary Trees ◽  
Square Lattice ◽  
Reverse Order ◽  
Tamari Lattice ◽  
Nous Montrons ◽  
International Audience ◽  
Tamari Lattices

International audience For any finite path $v$ on the square lattice consisting of north and east unit steps, we construct a poset Tam$(v)$ that consists of all the paths lying weakly above $v$ with the same endpoints as $v$. For particular choices of $v$, we recover the traditional Tamari lattice and the $m$-Tamari lattice. In particular this solves the problem of extending the $m$-Tamari lattice to any pair $(a; b)$ of relatively prime numbers in the context of the so-called rational Catalan combinatorics.For that purpose we introduce the notion of canopy of a binary tree and explicit a bijection between pairs $(u; v)$ of paths in Tam$(v)$ and binary trees with canopy $v$. Let $(\overleftarrow{v})$ be the path obtained from $v$ by reading the unit steps of $v$ in reverse order and exchanging east and north steps. We show that the poset Tam$(v)$ is isomorphic to the dual of the poset Tam$(\overleftarrow{v})$ and that Tam$(v)$ is isomorphic to the set of binary trees having the canopy $v$, which is an interval of the ordinary Tamari lattice. Thus the usual Tamari lattice is partitioned into (smaller) lattices Tam$(v)$, where the $v$’s are all the paths of length $n-1$ on the square lattice.We explain possible connections between the poset Tam$(v)$ and (the combinatorics of) the generalized diagonal coinvariant spaces of the symmetric group. Pour tout chemin $v$ sur le réseau carré formé de pas Nord et Est, nous construisons un ensemble partiellement ordonné Tam $(v)$ dont les éléments sont les chemins au dessus de $v$ et ayant les mêmes extrémités. Pour certains choix de $v$ nous retrouvons le classique treillis de Tamari ainsi que son extension $m$-Tamari. En particulier nous résolvons le problème d’étendre le treillis $m$-Tamari à toute paire $(a; b)$ d’entiers premiers entre eux dans le contexte de la combinatoire rationnelle de Catalan.Pour ceci nous introduisons la notion de canopée d’un arbre binaire et explicitons une bijection entre les paires $(u; v)$ de chemins dans Tam$(v)$ et les arbres binaires ayant la canopée $v$. Soit $(\overleftarrow{v})$ le chemin obtenu en lisant les pas en ordre inverse et en échangeant les pas Est et Nord. Nous montrons que Tam$(v)$ est isomorphe au dual de Tam$(\overleftarrow{v})$ et que Tam$(v)$ est isomorphe à l’ensemble des arbres binaires ayant la canopée $v$, qui est un intervalle du treillis de Tamari ordinaire. Ainsi le traditionnel treillis de Tamari admet une partition en plus petits treillis Tam$(v)$, où les $v$ sont tous les chemins de longueur $n-1$ sur le réseau carré. Enfin nous explicitons les liens possibles entre l’ensemble ordonné Tam$(v)$ et (la combinatoire des) espaces diagonaux coinvariants généralisés du groupe symétrique.

scholarly journals A Consecutive Lehmer Code for Parabolic Quotients of the Symmetric Group

2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Wenjie Fang ◽  
Henri Mühle ◽  
Jean-Christophe Novelli
Keyword(s):  
Symmetric Group ◽  
Simple Proof ◽  
Open Problem ◽  
Lattice Isomorphism ◽  
Tamari Lattice ◽  
Lehmer Code

In this article we define an encoding for parabolic permutations that distinguishes between parabolic $231$-avoiding permutations. We prove that the componentwise order on these codes realizes the parabolic Tamari lattice, and conclude a direct and simple proof that the parabolic Tamari lattice is isomorphic to a certain $\nu$-Tamari lattice, with an explicit bijection. Furthermore, we prove that this bijection is closely related to the map $\Theta$ used when the lattice isomorphism was first proved in (Ceballos, Fang and Mühle, 2020), settling an open problem therein.

scholarly journals Some remarks on the algebraic structure of the finite Coxeter groupF4

1999 ◽  
Vol 22 (1) ◽  
pp. 81-84
Author(s):  
Muhammad A. Albar ◽  
Norah Al-Saleh
Keyword(s):  
Coxeter Group ◽  
Algebraic Structure ◽  
Finite Coxeter Group

We consider in this paper the algebraic structure and some properties of the finite Coxeter groupF4.

The polytopes of the H 3 group with 60 vertices and their orbit decompositions

2019 ◽  
Vol 75 (3) ◽  
pp. 541-550
Author(s):  
Emmanuel Bourret ◽  
Zofia Grabowiecka
Keyword(s):  
Coxeter Group ◽  
Dynkin Diagram ◽  
Geometrical Structure ◽  
Three Dimensions ◽  
Icosahedral Group ◽  
Finite Coxeter Group

The goal of this article is to compare the geometrical structure of polytopes with 60 vertices, generated by the finite Coxeter group H 3, i.e. an icosahedral group in three dimensions. The method of decorating a Coxeter–Dynkin diagram is used to easily read the structure of the reflection-generated polytopes. The decomposition of the vertices of the polytopes into a sum of orbits of subgroups of H 3 is given and presented as a `pancake structure'.

scholarly journals Generalized Descent Algebras

2007 ◽  
Vol 50 (4) ◽  
pp. 535-546
Author(s):  
Christophe Hohlweg
Keyword(s):  
Group Algebra ◽  
Coxeter Group ◽  
Descent Algebra ◽  
Finite Coxeter Group ◽  
Solomon Descent Algebra ◽  
Descent Algebras

AbstractIf A is a subset of the set of reflections of a finite Coxeter group W, we define a sub-ℤ-module of the group algebra ℤW. We discuss cases where this submodule is a subalgebra. This family of subalgebras includes strictly the Solomon descent algebra, the group algebra and, if W is of type B, the Mantaci–Reutenauer algebra.

scholarly journals Weak Generalized Lifting Property, Bruhat Intervals, and Coxeter Matroids

2020 ◽  
Author(s):  
Fabrizio Caselli ◽  
Michele D’Adderio ◽  
Mario Marietti
Keyword(s):  
Coxeter Group ◽  
Coxeter Groups ◽  
Combinatorial Properties ◽  
Coxeter Matroid ◽  
Finite Coxeter Group ◽  
Bruhat Intervals

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.

scholarly journals Special involutions and bulky parabolic subgroups in finite Coxeter groups

2005 ◽  
Vol 79 (1) ◽  
pp. 141-147 ◽  
Author(s):  
Götz Pfeiffer ◽  
Gerhard Röhrle
Keyword(s):  
Coxeter Group ◽  
Coxeter Groups ◽  
Hyperplane Arrangement ◽  
Conjugacy Classes ◽  
Parabolic Subgroups ◽  
Finite Coxeter Group

AbstractThe conjugacy classes of so-called special involutions parameterize the constituents of the action of a finite Coxeter group on the cohomology of the complement of its complexified hyperplane arrangement. In this note we give a short intrinsic characterisation of special involutions in terms of so-called bulky parabolic subgroups.

Sign in / Sign up

Export Citation Format

Share Document