English
Related papers

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

200 papers

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…

Combinatorics · Mathematics 2024-02-15 Simone Costa , Stefano Della Fiore

We introduce the annex of an element $x$ in a Coxeter group as the set of elements $y$ such that $x \nleq y$ with respect to Bruhat order. This notion provides a complementary perspective to the study of Bruhat intervals and their…

Group Theory · Mathematics 2026-03-17 Megan Masters

In this paper we prove, without the finite rank assumption, that any irreducible Coxeter group of infinite order is directly indecomposable as an abstract group. The key ingredient of the proof is that we can determine, for an irreducible…

Group Theory · Mathematics 2007-05-23 Koji Nuida

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

Logic · Mathematics 2008-07-22 Luigi Santocanale

This paper studies the combinatorics of lattice congruences of the weak order on a finite Weyl group $W$, using representation theory of the corresponding preprojective algebra $\Pi$. Natural bijections are constructed between important…

Representation Theory · Mathematics 2019-02-20 Osamu Iyama , Nathan Reading , Idun Reiten , Hugh Thomas

Let (G,S) be a Coxeter group. We construct a continuation, to the open unit disc, of the unitary representations associated to the positive definite functions g -> r^l(g). (Here 0<r<1, and l denotes the length function with respect to the…

Group Theory · Mathematics 2007-05-23 Gero Fendler

For every finite Coxeter group W , we prove that the number of chains in the shard intersection lattice introduced by Reading on the one hand and in the BHZ poset introduced by Bergeron, Zabrocki and the third author on the other hand, are…

Combinatorics · Mathematics 2016-09-14 Pierre Baumann , Frédéric Chapoton , Christophe Hohlweg , Hugh Thomas

It is elementary and well-known that if an element x of a bounded modular lattice L has a complement in L then x has a relative complement in every interval [a,b] containing x. We show that the relatively strong assumption of modularity of…

Combinatorics · Mathematics 2021-07-13 Ivan Chajda , Helmut Länger

We prove that p.q.-Baer *-ring forms a pseudo lattice with Conrads partial order and also characterize p.q.-Baer *-rings which are lattices. The initial segments of a p.q.-Baer *-ring with Conrads partial order are shown to be orthomodular…

Combinatorics · Mathematics 2016-12-06 Anil Khairnar , B. N. Waphare

In this paper, we introduce a weak group inverse (called the WG inverse in the present paper) for square matrices of an arbitrary index, and give some of its characterizations and properties. Furthermore, we introduce two orders: one is a…

Rings and Algebras · Mathematics 2017-04-28 Hongxing Wang , Jianlong Chen

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…

Combinatorics · Mathematics 2025-12-02 Christos A. Athanasiadis , Theo Douvropoulos , Katerina Kalampogia-Evangelinou

Inspired by the infinite families of finite and affine root systems, we consider a "stretching" operation on general crystallographic root systems which, on the level of Coxeter diagrams, replaces a vertex with a path of unlabeled edges. We…

Combinatorics · Mathematics 2020-10-22 Will Dana

We provide a weaker version of the generalized lifting property which holds in complete generality for all finite Coxeter groups, and we use it to show that every parabolic Bruhat interval of a finite Coxeter group is a Coxeter matroid. We…

Combinatorics · Mathematics 2019-04-24 Fabrizio Caselli , Michele D'Adderio , Mario Marietti

Over 50 years ago, Rota posted the following celebrated `Research Problem': prove or disprove that the partial order of partitions on an $n$-set (i.e., the refinement order) is Sperner. A counterexample was eventually discovered by Canfield…

Combinatorics · Mathematics 2019-02-25 Lawrence H. Harper , Gene B. Kim , Neal Livesay

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…

Group Theory · Mathematics 2007-05-23 Michael L. Mihalik , Steven Tschantz

We show that every finitely generated Artin-Tits group admits a finite Garside family, by introducing the notion of a low element in a Coxeter group and proving that the family of all low elements in a Coxeter system (W, S) with S finite…

Group Theory · Mathematics 2014-12-01 Patrick Dehornoy , Matthew Dyer , Christophe Hohlweg

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

Logic · Mathematics 2022-07-19 Deacon Linkhorn

In the present article, we show the existence of a coupled fixed point for an order preserving mapping in a preordered left K-complete quasi-pseudometric space using a preorder induced by an appropriate function. We also define the concept…

General Mathematics · Mathematics 2014-11-14 Yaé Ulrich Gaba

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

We give formulas for the second and third integral homology of an arbitrary finitely generated Coxeter group, solely in terms of the corresponding Coxeter diagram. The first of these calculations refines a theorem of Howlett, while the…

Algebraic Topology · Mathematics 2020-11-11 Rachael Boyd