English
Related papers

Related papers: Extended Weak Order for the Rank 3 Universal Coxet…

200 papers

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

We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…

Logic · Mathematics 2019-07-29 Jean S. Joseph

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

For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…

Combinatorics · Mathematics 2007-05-23 Thomas Brady , Colum Watt

The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we…

Combinatorics · Mathematics 2011-03-11 Erin Bancroft

We study the restriction of the absolute order on a Coxeter group $W$ to an interval $[1,w]_T$, where $w\in W$ is an involution. We characterize and classify those involutions $w$ for which $[1,w]_T$ is a lattice, using the notion of…

Group Theory · Mathematics 2026-01-14 Thomas Gobet

We provide an algorithm to construct a multicomplex for any lower Bruhat interval of $F_4$, such that its rank--generating function equals that of the Bruhat interval. For Weyl groups, it is always possible to find such a multicomplex…

Combinatorics · Mathematics 2026-05-13 Paolo Sentinelli , Andrea Zatti

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…

Group Theory · Mathematics 2010-12-07 Tathagata Basak

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…

Combinatorics · Mathematics 2014-09-16 Mahir Bilen Can , Michael Joyce , Benjamin Wyser

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

We situate the noncrossing partitions associated to a finite Coxeter group within the context of the representation theory of quivers. We describe Reading's bijection between noncrossing partitions and clusters in this context, and show…

Representation Theory · Mathematics 2014-01-14 Colin Ingalls , Hugh Thomas

In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…

Group Theory · Mathematics 2026-02-18 Weijia Wang , Rui Wang

Two partial orders on a reflection group, the codimension order and the prefix order, are together called the absolute order when they agree. We show that in this case the absolute order on a complex reflection group has the strong Sperner…

Combinatorics · Mathematics 2020-11-03 Christian Gaetz , Yibo Gao

In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…

Combinatorics · Mathematics 2015-07-03 Henri Mühle

The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…

Combinatorics · Mathematics 2018-10-18 Xu Wang , Xuxu Zhao , Haiyuan Yao

Using a variant of an unpublished argument due to Agol, we show that an irreducible right-angled Coxeter group on ${n \geq 3}$ vertices embeds as a thin subgroup of a uniform arithmetic lattice in an indefinite orthogonal group…

Group Theory · Mathematics 2021-11-16 Sami Douba

Various partial orders related to the structures of dual canonical monoids are investigated. It is shown that the nilpotent variety of a dual canonical monoid is equidimensional; its dimension is found. It is shown in type A that certain…

Combinatorics · Mathematics 2022-07-22 Mahir Bilen Can

We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…

Combinatorics · Mathematics 2025-06-11 Mikhail Gorsky , Nicholas J. Williams

Ceballos and Pons introduced the $s$-weak order on $s$-decreasing trees, for any weak composition $s$. They proved that it has a lattice structure and further conjectured that it can be realized as the $1$-skeleton of a polyhedral…