English
Related papers

Related papers: Maximal length elements of excess zero in finite C…

200 papers

Let S be a finite set of words over an alphabet Sigma. The set S is said to be complete if every word w over the alphabet Sigma is a factor of some element of S*, i.e. w belongs to Fact(S*). Otherwise if S is not complete, we are interested…

Formal Languages and Automata Theory · Computer Science 2010-04-26 Gabriele Fici , Elena V. Pribavkina , Jacques Sakarovitch

Let $(W,S)$ be a Coxeter system, let $S=I \dot{\cup} J$ be a partition of $S$ such that no element of $I$ is conjugate to an element of $J$, let $\widetilde{J}$ be the set of $W_I$-conjugates of elements of $J$ and let $\widetilde{W}$ be…

Group Theory · Mathematics 2008-07-09 Cédric Bonnafé , Matthew J. Dyer

Let $(W, I)$ be a finite Coxeter group. In the case where $W$ is a Weyl group, Berenstein and Kazhdan in \cite{BK} constructed a monoid structure on the set of all subsets of $I$ using unipotent $\chi$-linear bicrystals. In this paper, we…

Group Theory · Mathematics 2009-04-14 Xuhua He

There are many different ways that the exponents of Weyl groups of irreducible root systems have been defined and put into practice. One of the most classical and algebraic definitions of the exponents is related to the eigenvalues of…

Combinatorics · Mathematics 2020-09-24 Tan Nhat Tran

The character of every irreducible finite-dimensional representation of a simple Lie algebra has the highest weight property. The invariance of the character under the action of the Weyl group W implies that there is a similar "extremal…

Quantum Algebra · Mathematics 2025-09-18 Edward Frenkel , David Hernandez

In this paper, we study the twist-conjecture for Coxeter systems and rigidity of Coxeter systems up to finite twists. For Coxeter systems $(W,R)$ and $(W,S)$, under the untangle-condition for conjugate subsets, we investigate separations…

Group Theory · Mathematics 2023-06-26 Tetsuya Hosaka

Let $(W,S)$ be a Coxeter system, and write $S=\{s_i:i\in I\}$, where $I$ is a finite index set. Fix a nonempty convex subset $\mathscr{L}$ of $W$. If $W$ is of type $A$, then $\mathscr{L}$ is the set of linear extensions of a poset, and…

Combinatorics · Mathematics 2025-05-06 Grant Barkley , Colin Defant , Eliot Hodges , Noah Kravitz , Mitchell Lee

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

Combinatorics · Mathematics 2025-12-23 Grant T. Barkley , David E Speyer

We lay the foundations of the first-order model theory of Coxeter groups. Firstly, with the exception of the $2$-spherical non-affine case (which we leave open), we characterize the superstable Coxeter groups of finite rank, which we show…

Logic · Mathematics 2022-02-02 Bernhard Muhlherr , Gianluca Paolini , Saharon Shelah

Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…

Group Theory · Mathematics 2025-01-30 Gideon Amir , Guy Blachar , Subhajit Ghosh , Uzi Vishne

We prove that even Coxeter groups, whose Coxeter diagrams contain no (4,4,2) triangles, are conjugacy separable. In particular, this applies to all right-angled Coxeter groups or word hyperbolic even Coxeter groups. For an arbitrary Coxeter…

Group Theory · Mathematics 2015-03-27 Pierre-Emmanuel Caprace , Ashot Minasyan

Given a class of groups C, a group G is strongly accessible over C if there is a bound on the number of terms in a sequence L(1), L(2), ..., L(n) of graph of groups decompositions of G with edge groups in C such that L(1) is the trivial…

Group Theory · Mathematics 2010-03-02 Michael L. Mihalik , Steven Tschantz

The aim of the article is to show that there are many finite extensions of arithmetic groups which are not residually finite. Suppose $G$ is a simple algebraic group over the rational numbers satisfying both strong approximation, and the…

Number Theory · Mathematics 2018-07-31 Richard Hill

A Coxeter group admits infinite-dimensional irreducible complex representations if and only if it is not finite or affine. In this paper, we provide a construction of some of those representations for certain Coxeter groups using some…

Representation Theory · Mathematics 2025-03-25 Hongsheng Hu

Given an affine Coxeter group $W$, the corresponding Shi arrangement is a refinement of the corresponding Coxeter hyperplane arrangements that was introduced by Shi to study Kazhdan-Lusztig cells for $W$. In particular, Shi showed that each…

Combinatorics · Mathematics 2024-12-13 Nathan Chapelier-Laget , Christophe Hohlweg

In this paper, we study the structure of finite groups with a large number of conjugacy classes of $p$-elements for some prime $p$. As consequences, we obtain some new criteria for the existence of normal $p$-complements in finite groups.

Group Theory · Mathematics 2020-12-09 Hung P. Tong-Viet

The depth statistic was defined by Petersen and Tenner for an element of an arbitrary Coxeter group in terms of factorizations of the element into a product of reflections. It can also be defined as the minimal cost, given certain…

Combinatorics · Mathematics 2017-01-13 Eli Bagno , Riccardo Biagioli , Mordechai Novick , Alexander Woo

Studying geodesics in Cayley graphs of groups has been a very active area of research over the last decades. We introduce the notion of a uniquely labelled geodesic, abbreviated with u.l.g. These will be studied first in finite Coxeter…

Group Theory · Mathematics 2017-09-22 Elisabeth Fink , Kirill Zainoulline

Let $(W,S)$ be a Coxeter system and suppose that $w \in W$ is fully commutative (in the sense of Stembridge) and has a reduced expression beginning (respectively, ending) with $s \in S$. If there exists $t\in S$ such that $s$ and $t$ do not…

Combinatorics · Mathematics 2018-01-04 Dana C. Ernst

In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…

Group Theory · Mathematics 2014-10-01 Michael Mihalik , John Ratcliffe , Steven Tschantz