English
Related papers

Related papers: Affine extended weak order is a lattice

200 papers

Boyd (1974) proposed a class of infinite ball packings that are generated by inversions. Later, Maxwell (1983) interpreted Boyd's construction in terms of root systems in Lorentz space. In particular, he showed that the space-like weight…

Group Theory · Mathematics 2021-08-23 Hao Chen

In this paper we show that for a simply-laced root system a choice of $C$ gives rise to a natural construction of the Dynkin diagram, in which vertices of the diagram correspond to $C$-orbits in $R$; moreover, it gives an identification of…

Representation Theory · Mathematics 2007-05-25 Alexander Kirillov , Jaimal Thind

The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…

Combinatorics · Mathematics 2025-03-25 Ivan Chajda , Helmut Länger

We investigate the ways in which fundamental properties of the weak Bruhat order on a Weyl group can be lifted (or not) to a corresponding highest weight crystal graph, viewed as a partially ordered set; the latter projects to the weak…

Combinatorics · Mathematics 2016-10-19 Patricia Hersh , Cristian Lenart

A totally ordered monoid, or tomonoid for short, is a monoid endowed with a compatible total order. We deal in this paper with tomonoids that are finite and negative, where negativity means that the monoidal identity is the top element.…

Rings and Algebras · Mathematics 2018-08-31 Milan Petr\' ik , Thomas Vetterlein

Given a fixed integer $n\geq 2$, we construct two new finite lattices that we call the cyclic Tamari lattice and the affine Tamari lattice. The cyclic Tamari lattice is a sublattice and a quotient lattice of the cyclic Dyer lattice, which…

Combinatorics · Mathematics 2025-02-12 Grant Barkley , Colin Defant

We show the uniqueness and existence of the Euler form for a simply-laced generalized root system. This enables us to show that the Coxeter element for a simply-laced generalized root system is admissible in the sense of R.~W.~Carter. As an…

Algebraic Geometry · Mathematics 2016-03-28 Shunsuke Nakamura , Yuuki Shiraishi , Atsushi Takahashi

We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…

Combinatorics · Mathematics 2021-01-14 Philippe Biane , Matthieu Josuat-Vergès

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

We investigate predicative aspects of order theory in constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work…

Logic · Mathematics 2021-04-22 Tom de Jong , Martín Hötzel Escardó

Given any Coxeter group, we define rigid reflections and rigid roots using non-self-intersecting curves on a Riemann surface with labeled curves. When the Coxeter group arises from an acyclic quiver, they are related to the rigid…

Representation Theory · Mathematics 2018-03-15 Kyu-Hwan Lee , Kyungyong Lee

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)\in\{2\}\cup 4\N$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd,…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. These elements were extensively studied by Stembridge, in particular…

Combinatorics · Mathematics 2014-02-11 Riccardo Biagioli , Frédéric Jouhet , Philippe Nadeau

A zircon is a poset in which every principal order ideal is finite and equipped with a so-called special matching. We prove that the subposet induced by the fixed points of any automorphism of a zircon is itself a zircon. This provides a…

Combinatorics · Mathematics 2007-05-23 Axel Hultman

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

Logic · Mathematics 2020-06-30 Ivan Chajda , Helmut Länger

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

Combinatorics · Mathematics 2007-05-23 Maximillian Murphy , Vincent Vatter

We prove the dichotomy that every Coxeter group either has a strongly solid group von Neumann algebra or contains the product of an infinite cyclic group and a free group of rank 2. This generalizes the same dichotomy for right-angled…

Operator Algebras · Mathematics 2025-12-02 Martín Blufstein , Katherine Goldman , Koichi Oyakawa

By the means of lower and upper fuzzy approximations we define quasiorders. Their properties are used to prove our main results. First, we characterize those pairs of fuzzy sets which form fuzzy rough sets w.r.t. a t-similarity relation…

General Mathematics · Mathematics 2023-09-11 Dávid Gégény , Sándor Radeleczki

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

Group Theory · Mathematics 2025-10-22 Peter J. Cameron , Hiranya Kishore Dey

In a recent paper, Barot and Marsh presented an explicit construction of presentation of a finite Weyl group by any seed of corresponding cluster algebra, i.e. by any diagram mutation-equivalent to an orientation of a Dynkin diagram with…

Combinatorics · Mathematics 2019-10-25 Anna Felikson , Pavel Tumarkin