Related papers: A Coxeter type classification of Dynkin type $\mat…
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…
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…
Fully commutative elements in types $B$ and $D$ are completely characterized and counted by Stembridge. Recently, Feinberg-Kim-Lee-Oh have extended the study of fully commutative elements from Coxeter groups to the complex setting, giving…
We give a purely combinatorial proof of the positivity of the stabilized forms of the generalized exponents associated to each classical root system. In finite type A_{n-1}, we rederive the description of the generalized exponents in terms…
In this paper the Jessen's type inequality for normalized positive $C_0$-semigroups is obtained. An adjoint of Jessen's type inequality has also been derived for the corresponding adjoint-semigroup, which does not give the analogous results…
We develop new and precise geometric descriptions of the conjugacy class $[x]$ and coconjugation set $\operatorname{C}(x,x') = \{ y \in \overline{W} \mid yxy^{-1} = x' \}$ for all elements $x,x'$ of any affine Coxeter group $\overline{W}$.…
When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…
The way to arrive at formula of zeta matrix for any graded posets with the finite set of minimal elements is delivered following the first reference. This is being achieved via adjacency and zeta matrix description of bipartite digraphs…
We prove that any $\tau$-tilting finite incidence algebra of a finite poset is representation-finite, and that any $\mathbf{g}$-tame incidence algebra of a finite simply connected poset is tame. As the converse of these assertions are known…
We give necessary and sufficient conditions for a linear reflection group in the sense of Vinberg to be Zariski-dense in the ambient projective general linear group. As an application, we show that every irreducible right-angled Coxeter…
Let $k$ be a field, $X$ a connected scheme proper over $k$, $D\subsetneq X$ an ample effective connected divisor, $x\in D(k)$. For Tannakian categories $\mathcal{C}_X$ and $\mathcal{C}_D$ whose objects consist of vector bundles on $X$ and…
We discuss the symmetries of the Lagrangian of the leptonic sector. We consider the case when this symmetry group is a Coxeter group. The number of elements of the PMNS matrix predicted by this group structure would depend on the number of…
A poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Two elements in a poset are indistinguishable if they have the same strict up-set and the…
In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…
Given a finite poset $X$, we find necessary and sufficient conditions for there to exist a local Noetherian UFD $A$ and a saturated embedding of posets $\phi : X \longrightarrow \mbox{Spec}(A)$ such that $\dim(X)=\dim(A)$. The conditions…
In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…
In recent work, the second author introduced the concept of Coxeter quivers, generalizing several previous notions of a quiver representation. Finite type Coxeter quivers were classified, and their indecomposable objects were shown to be in…
For every finite Coxeter group $\Gamma$, each positive braids in the corresponding braid group admits a unique decomposition as a finite sequence of elements of $\Gamma$, the so-called Garside-normal form.The study of the associated…
Given an essential semilattice congruence $\equiv$ on the left weak order of a Coxeter group $W$, we define the Coxeter stack-sorting operator ${\bf S}_\equiv:W\to W$ by ${\bf S}_\equiv(w)=w\left(\pi_\downarrow^\equiv(w)\right)^{-1}$, where…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…