Related papers: The Adherence Order on Renner-Coxeter Monoids
Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…
We provide every Renner monoids with a monoid presentation, and we introduce a length function which extends the Coxeter length function.
We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
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…
This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…
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…
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…
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…
In this paper, we study combinatorics of congruence subgroups of the modular group. More precisely, we consider the matrix equation that naturally arises in the theory of Coxeter friezes and investigate its irreducible solutions. We give…
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…
Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W. In this paper, we…
The absolute order is a natural partial order on a Coxeter group W. It can be viewed as an analogue of the weak order on W in which the role of the generating set of simple reflections in W is played by the set of all reflections in W. By…
Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…
The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…
A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
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…
We introduce a relative Garside element, the quotient of the corresponding Garside elements G1 and G2, for a pair of Artin monoids associated to Coxeter graphs Gamma1 and Gamma2, the second graph containing a new vertex. These relative…
We define the notion of a climbing element in a finite real reflection group relative to a total order on the reflection set and we characterise these elements in the case where the total order arises from a bipartite Coxeter element.