English
Related papers

Related papers: The number of roots of full support

200 papers

In a finite Coxeter group $W$ and with two given conjugacy classes of parabolic subgroups $[X]$ and $[Y]$, we count those parabolic subgroups of $W$ in $[Y]$ that are full support, while simultaneously being simple extensions (i.e.,…

Combinatorics · Mathematics 2022-09-14 Theo Douvropoulos

The reflections in a Coxeter group are defined as conjugates of a single generator, and thus admit palindromic expressions as products of generators. Our main result gives closed formulas providing a palindromic reduced expression for each…

Combinatorics · Mathematics 2025-04-08 Elizabeth Milićević

In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this expanded generating set. In this article we give a simple…

Combinatorics · Mathematics 2020-03-02 Joel Brewster Lewis , Jon McCammond , T. Kyle Petersen , Petra Schwer

For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections…

Combinatorics · Mathematics 2017-08-22 Elise delMas , Thomas Hameister , Victor Reiner

On etudie divers aspects d'une formule qui compte les reflexions pleines dans les groupes de Coxeter finis. ***** We study several points about a formula which counts reflexions in a finite Coxeter group whose reduced decompositions involve…

Representation Theory · Mathematics 2007-05-23 Frederic Chapoton

In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we…

Combinatorics · Mathematics 2010-10-25 Jon McCammond , T. Kyle Petersen

We follow the dual approach to Coxeter systems and show for Weyl groups a criterium which decides whether a set of reflections is generating the group depending on the root and the coroot lattice. Further we study special generating sets…

Group Theory · Mathematics 2019-05-01 Barbara Baumeister , Patrick Wegener

We give uniform formulas for the number of full reflection factorizations of a parabolic quasi-Coxeter element in a Weyl group or complex reflection group, generalizing the formula for the genus-0 Hurwitz numbers. This paper is the…

Combinatorics · Mathematics 2025-05-20 Theo Douvropoulos , Joel Brewster Lewis , Alejandro H. Morales

Orbits of the Weyl reflection groups attached to the simple Lie groups $A_2, C_2, G_2$ and Coxeter group $H_2$ are considered. For each of the groups products of any two orbits are decomposed into the union of the orbits. Results are…

Mathematical Physics · Physics 2014-02-18 Agnieszka Tereszkiewicz

Chapuy and Stump have given a nice generating series for the number of factorisations of a Coxeter element as a product of reflections. Their method is to evaluate case by case a character-theoretic expression. The goal of this note is to…

Representation Theory · Mathematics 2014-08-05 Jean Michel

We adapt the generalization of root systems of the second author and H. Yamane to the terminology of category theory. We introduce Cartan schemes, associated root systems and Weyl groupoids. After some preliminary general results, we…

Group Theory · Mathematics 2008-05-14 M. Cuntz , I. Heckenberger

The root systems appearing in the theory of Lie superalgebras and Nichols algebras admit a large symmetry extending properly the one coming from the Weyl group. Based on this observation we set up a general framework in which the symmetry…

Quantum Algebra · Mathematics 2007-05-23 I. Heckenberger , H. Yamane

Let $x$ be an eigenvector for an element of a finite irreducible reflection group $W$. Let $W_x$ denote the subgroup of $W$ which stabilises $x$. We provide an upper bound for the number of roots in the root system of $W_x$ . This…

Representation Theory · Mathematics 2015-12-08 Masoud Kamgarpour

For Coxeter groups with sufficiently large braid relations, we prove that the sequence of powers of a Coxeter element has unbounded reflection length. We establish a connection between the reflection length functions on arbitrary Coxeter…

Group Theory · Mathematics 2024-06-11 Marco Lotz

The reflection length of an element of a Coxeter group is the minimal number of conjugates of the standard generators whose product is equal to that element. In this paper we prove the conjecture of McCammond and Petersen that reflection…

Group Theory · Mathematics 2014-02-26 Kamil Duszenko

In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is…

Combinatorics · Mathematics 2015-06-12 Guillaume Chapuy , Christian Stump

This paper is a sequel to work of Dynkin on subroot lattices of root lattices and to work of Carter on presentations of Weyl group elements as products of reflections. The quotients $L/L_1$ are calculated for all irreducible root lattices…

Representation Theory · Mathematics 2016-04-28 Sven Balnojan , Claus Hertling

We give a criterion for a finitely generated odd-angled Coxeter group to have a proper finite index subgroup generated by reflections. The answer is given in terms of the least prime divisors of the exponents of the Coxeter relations.

Group Theory · Mathematics 2019-10-25 Anna Felikson , Jessica Fintzen , Pavel Tumarkin

In this article we study a second example of the phenomenon studied in "Complex Lorentzian Leech lattice and bimonster".(Arxiv. math.GR/0508228). The results and methods of proof are similar. We find 14 roots in the automorphism group of…

Group Theory · Mathematics 2016-09-07 Tathagata Basak

We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…

Combinatorics · Mathematics 2010-11-25 Jonas Sjostrand
‹ Prev 1 2 3 10 Next ›