English
Related papers

Related papers: The dominance hierarchy in root systems of Coxeter…

200 papers

Brink and Howlett have introduced a partial ordering, called dominance, on the positive roots in the Tits realization of Coxeter groups (Math. Ann. 296 (1993), 179--190). Recently a concept called $\infty$-height is introduced to each…

Representation Theory · Mathematics 2013-06-19 Xiang Fu

In this article we provide a new finite class of elements in any Coxeter system (W,S) called low elements. They are defined from Brink and Howlett's small roots, which are strongly linked to the automatic structure of (W,S). Our first main…

Group Theory · Mathematics 2016-06-29 Matthew Dyer , Christophe Hohlweg

Let W be an infinite Coxeter group. We initiate the study of the set E of limit points of "normalized" positive roots (representing the directions of the roots) of W. We show that E is contained in the isotropic cone of the bilinear form B…

Group Theory · Mathematics 2019-08-15 Christophe Hohlweg , Jean-Philippe Labbé , Vivien Ripoll

Results are obtained concerning the roots of asymmetric geometric representations of Coxeter groups. These representations were independently introduced by Vinberg and Eriksson, and generalize the standard geometric representation of a…

Group Theory · Mathematics 2009-12-30 Robert G. Donnelly

Certain results on representations of quivers have analogs in the structure theory of general Coxeter groups. A fixed Coxeter element turns the Coxeter graph into an acyclic quiver, allowing for the definition of a preprojective root. A…

Group Theory · Mathematics 2017-02-08 Mark Kleiner

Let (W,S) be an infinite Coxeter system. To each geometric representation of W is associated a root system. While a root system lives in the positive side of the isotropy cone of its associated bilinear form, an imaginary cone lives in the…

Group Theory · Mathematics 2016-02-03 Matthew Dyer , Christophe Hohlweg , Vivien Ripoll

Let $W$ be a finitely generated infinite Coxeter group, with $\Phi$ and $\Pi$ being the corresponding root system and set of simple roots respectively. It has been observed by Hohlweg et la that the projections of elements of $\Phi$ onto…

Group Theory · Mathematics 2018-11-15 Yuhan Cai , Xiang Fu , Lawrence Reeves

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

We study $c$-preprojective roots for a Coxeter element $c$ of infinite Coxeter group $W$. In particular, we consider the case when any positive root is $c$-preprojective for some Coxeter element $c$. In this paper, by assuming that the…

Group Theory · Mathematics 2019-11-25 Yuji Komatsu

The notion of limit roots of a Coxeter group W was recently introduced (see arXiv:1112.5415 and arXiv:1303.6710): they are the accumulation points of directions of roots of a root system for W. In the case where the root system lives in a…

Group Theory · Mathematics 2019-10-25 Christophe Hohlweg , Jean-Philippe Préaux , Vivien Ripoll

Let W be a Coxeter group with Coxeter generators S. The rank of the Coxeter system (W,S) is the cardinality |S| of S. The Coxeter system (W,S) has finite rank if and only if W is finitely generated. If (W,S) has infinite rank, then |S| =…

Group Theory · Mathematics 2007-06-28 Michael L. Mihalik , John G. Ratcliffe

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 define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice…

Combinatorics · Mathematics 2023-11-14 Joël Gay , Vincent Pilaud

This is the first of a series of papers which define and study structures called rootoids, which are groupoids equipped with a representation in the category of Boolean rings and with an associated 1-cocycle. The axioms for rootoids are…

Group Theory · Mathematics 2011-10-17 Matthew Dyer

We define in an axiomatic fashion a \emph{Coxeter datum} for an arbitrary Coxeter group $W$. This Coxeter datum will specify a pair of reflection representations of $W$ in two vector spaces linked only by a bilinear paring without any…

Representation Theory · Mathematics 2014-10-01 Xiang Fu

Let $\mathcal{W}$ be the set of strongly real elements of $W$, a Coxeter group. Then for $w \in \mathcal{W}$, $e(w)$, the excess of $w$, is defined by $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, x^2 = y^2 = 1\}$. When $W$ is…

Group Theory · Mathematics 2014-05-13 Sarah B. Hart , Peter J. Rowley

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

Rings and Algebras · Mathematics 2025-06-17 Hiroki Aoki , Hiraku Kawanoue

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

This is the second introductory paper concerning structures called rootoids and protorootoids, the definition of which is abstracted from formal properties of Coxeter groups with their root systems and weak orders. The ubiquity of…

Group Theory · Mathematics 2011-10-18 Matthew Dyer

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. A submonoid $M$ generated by $k$ elements of $A^*$ is…

Formal Languages and Automata Theory · Computer Science 2019-06-10 Giuseppa Castiglione , Gabriele Fici , Antonio Restivo
‹ Prev 1 2 3 10 Next ›