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.

scholarly journals On the Hurwitz action in finite Coxeter groups

2017 ◽  
Vol 20 (1) ◽  
Author(s):  
Barbara Baumeister ◽  
Thomas Gobet ◽  
Kieran Roberts ◽  
Patrick Wegener
Keyword(s):  
Parabolic Subgroup ◽  
Coxeter Group ◽  
Coxeter Groups ◽  
Coxeter Element ◽  
Necessary And Sufficient Condition ◽  
Reduced Decompositions ◽  
Finite Coxeter Group ◽  
Definition Of ◽  
Necessary And Sufficient ◽  
Hurwitz Action

AbstractWe provide a necessary and sufficient condition on an element of a finite Coxeter group to ensure the transitivity of the Hurwitz action on its set of reduced decompositions into products of reflections. We show that this action is transitive if and only if the element is a parabolic quasi-Coxeter element. We call an element of the Coxeter group parabolic quasi-Coxeter element if it has a factorization into a product of reflections that generate a parabolic subgroup. We give an unusual definition of a parabolic subgroup that we show to be equivalent to the classical one for finite Coxeter groups.

scholarly journals The facial weak order in finite Coxeter groups

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Aram Dermenjian ◽  
Christophe Hohlweg ◽  
Vincent Pilaud
Keyword(s):  
Coxeter Group ◽  
Coxeter Groups ◽  
Geometric Interpretation ◽  
Weak Order ◽  
Maximal Length ◽  
Lattice Congruence ◽  
Finite Coxeter Group ◽  
International Audience

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.

scholarly journals Shortest path poset of finite Coxeter groups

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Saúl A. Blanco
Keyword(s):  
Shortest Path ◽  
Coxeter Group ◽  
Coxeter Groups ◽  
Shortest Paths ◽  
Combinatorial Interpretation ◽  
Nous Permet ◽  
Finite Coxeter Group ◽  
International Audience ◽  
Absolute Length ◽  
Bruhat Graph

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$.

scholarly journals IRREDUCIBLE COXETER GROUPS

2007 ◽  
Vol 17 (03) ◽  
pp. 427-447 ◽  
Author(s):  
LUIS PARIS
Keyword(s):  
Direct Product ◽  
Finite Index ◽  
Coxeter Group ◽  
Coxeter Groups ◽  
Index Subgroup ◽  
Central Automorphism ◽  
Finite Coxeter Group ◽  
Irreducible Components ◽  
Finite Index Subgroup ◽  
Finite Index Subgroups

We prove that a non-spherical irreducible Coxeter group is (directly) indecomposable and that an indefinite irreducible Coxeter group is strongly indecomposable in the sense that all its finite index subgroups are (directly) indecomposable. Let W be a Coxeter group. Write W = WX1 × ⋯ × WXb × WZ3, where WX1, … , WXb are non-spherical irreducible Coxeter groups and WZ3 is a finite one. By a classical result, known as the Krull–Remak–Schmidt theorem, the group WZ3 has a decomposition WZ3 = H1 × ⋯ × Hq as a direct product of indecomposable groups, which is unique up to a central automorphism and a permutation of the factors. Now, W = WX1 × ⋯ × WXb × H1 × ⋯ × Hq is a decomposition of W as a direct product of indecomposable subgroups. We prove that such a decomposition is unique up to a central automorphism and a permutation of the factors. Write W = WX1 × ⋯ × WXa × WZ2 × WZ3, where WX1, … , WXa are indefinite irreducible Coxeter groups, WZ2 is an affine Coxeter group whose irreducible components are all infinite, and WZ3 is a finite Coxeter group. The group WZ2 contains a finite index subgroup R isomorphic to ℤd, where d = |Z2| - b + a and b - a is the number of irreducible components of WZ2. Choose d copies R1, … , Rd of ℤ such that R = R1 × ⋯ × Rd. Then G = WX1 × ⋯ × WXa × R1 × ⋯ × Rd is a virtual decomposition of W as a direct product of strongly indecomposable subgroups. We prove that such a virtual decomposition is unique up to commensurability and a permutation of the factors.

scholarly journals Maximal length elements of excess zero in finite Coxeter groups

2018 ◽  
Vol 21 (5) ◽  
pp. 817-837
Author(s):  
Sarah B. Hart ◽  
Peter J. Rowley
Keyword(s):  
Conjugacy Class ◽  
Coxeter Group ◽  
Coxeter Groups ◽  
Maximal Length ◽  
Length Function ◽  
Finite Coxeter Group

Abstract In this paper we prove that for W a finite Coxeter group and C a conjugacy class of W, there is always an element of C of maximal length in C which has excess zero. An element {w\in W} has excess zero if there exist elements {\sigma,\tau\in W} such that {\sigma^{2}=\tau^{2}=1,w=\sigma\tau} and {\ell(w)=\ell(\sigma)+\ell(\tau)} , {\ell} being the length function on W.

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

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Vincent Pilaud ◽  
Christian Stump
Keyword(s):  
Coxeter Group ◽  
Efficient Algorithm ◽  
Spanning Trees ◽  
The Other ◽  
Combinatorial Properties ◽  
Finite Coxeter Group ◽  
International Audience ◽  
Flip Graph ◽  
The One ◽  
Subword Complex

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.

scholarly journals The -Version Segal-Bargmann Transform for Finite Coxeter Groups Defined by the Restriction Principle

2011 ◽  
Vol 2011 ◽  
pp. 1-23 ◽  
Author(s):  
Stephen Bruce Sontz
Keyword(s):  
Coxeter Group ◽  
Coxeter Groups ◽  
Reproducing Kernel ◽  
Basic Result ◽  
Bargmann Transform ◽  
Restriction Principle ◽  
Finite Coxeter Group ◽  
Bargmann Transforms ◽  
Definition Of ◽  
Special Case

We apply a special case, the restriction principle (for which we give a definition simpler than the usual one), of a basic result in functional analysis (the polar decomposition of an operator) in order to define , the -version of the Segal-Bargmann transform, associated with a finite Coxeter group acting in and a given value of Planck's constant, where is a multiplicity function on the roots defining the Coxeter group. Then we immediately prove that is a unitary isomorphism. To accomplish this we identify the reproducing kernel function of the appropriate Hilbert space of holomorphic functions. As a consequence we prove that the Segal-Bargmann transforms for Versions , , and are also unitary isomorphisms though not by a direct application of the restriction principle. The point is that the -version is the only version where a restriction principle, in our definition of this method, applies directly. This reinforces the idea that the -version is the most fundamental, most natural version of the Segal-Bargmann transform.

scholarly journals -GRAPHS AND GYOJA’S -GRAPH ALGEBRA

2017 ◽  
Vol 226 ◽  
pp. 1-43 ◽  
Author(s):  
JOHANNES HAHN
Keyword(s):  
Irreducible Representation ◽  
Coxeter Group ◽  
Coxeter Groups ◽  
Hecke Algebra ◽  
Path Algebra ◽  
Explicit Description ◽  
Graph Algebra ◽  
Finite Coxeter Group ◽  
General Conjecture

Let $(W,S)$ be a finite Coxeter group. Kazhdan and Lusztig introduced the concept of $W$-graphs, and Gyoja proved that every irreducible representation of the Iwahori–Hecke algebra $H(W,S)$ can be realized as a $W$-graph. Gyoja defined an auxiliary algebra for this purpose which—to the best of the author’s knowledge—was never explicitly mentioned again in the literature after Gyoja’s proof (although the underlying ideas were reused). The purpose of this paper is to resurrect this $W$-graph algebra, and to study its structure and its modules. A new explicit description of it as a quotient of a certain path algebra is given. A general conjecture is proposed which would imply strong restrictions on the structure of $W$-graphs. This conjecture is then proven for Coxeter groups of type $I_{2}(m)$, $B_{3}$ and $A_{1}$–$A_{4}$.

scholarly journals The Minimal Growth Rate of Cocompact Coxeter Groups in Hyperbolic 3-space

2014 ◽  
Vol 66 (2) ◽  
pp. 354-372 ◽  
Author(s):  
Ruth Kellerhals ◽  
Alexander Kolpakov
Keyword(s):  
Growth Rate ◽  
Coxeter Group ◽  
Coxeter Groups ◽  
Triangle Group ◽  
Minimal Growth ◽  
Salem Number

AbstractDue to work of W. Parry it is known that the growth rate of a hyperbolic Coxeter group acting cocompactly on H3 is a Salem number. This being the arithmetic situation, we prove that the simplex group (3,5,3) has the smallest growth rate among all cocompact hyperbolic Coxeter groups, and that it is, as such, unique. Our approach provides a different proof for the analog situation in H2 where E. Hironaka identified Lehmer's number as the minimal growth rate among all cocompact planar hyperbolic Coxeter groups and showed that it is (uniquely) achieved by the Coxeter triangle group (3,7).

Sign in / Sign up

Export Citation Format

Share Document