相关论文: The Absolute Orders on the Coxeter Groups $A_n$ an…

We study Coxeter groups from which there is a natural map onto a symmetric group. Such groups have natural quotient groups related to presentations of the symmetric group on an arbitrary set $T$ of transpositions. These quotients, denoted…

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

We prove the $K(\pi,1)$ conjecture for affine Artin groups: the complexified complement of an affine reflection arrangement is a classifying space. This is a long-standing problem, due to Arnol'd, Pham, and Thom. Our proof is based on…

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…

In a recent paper by K.-H. Lee, K. Lee and M. Mills, a mutation of reflections in the universal Coxeter group is defined in association with a mutation of a quiver. A matrix representation of these reflections is determined by a linear…

If $G$ is a finite group and $x\in G$ then the set of all elements of $G$ having the same order as $x$ is called {\em an order subset of $G$ determined by $x$} (see [2]). We say that $G$ is a {\em group with perfect order subsets} or…

We study the action of a differential operator on Schubert polynomials. Using this action, we first give a short new proof of an identity of I. Macdonald (1991). We then prove a determinant conjecture of R. Stanley (2017). This conjecture…

We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…

The classical Eulerian Numbers $A_{n,k}$ are known to be log-concave. Let $P_{n,k}$ and $Q_{n,k}$ be the number of even and odd permutations with $k$ excedances. In this paper, we show that $P_{n,k}$ and $Q_{n,k}$ are log-concave. For this,…

We derive presentations of the interval groups related to all quasi-Coxeter elements in the Coxeter group of type $D_n$. Type $D_n$ is the only infinite family of finite Coxeter groups that admits proper quasi-Coxeter elements. The…

In \cite{Lusztig}, Lusztig gives an explicit formula for the bijection between the set of bipartitions and the set $\mathcal{N}$ of unipotent classes in a spin group which carry irreducible local systems equivariant for the spin group but…

Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…

Backtrack search is a fundamental technique for computing with finite permutation groups, which has been formulated in terms of points, ordered partitions, and graphs. We provide a framework for discussing the most common forms of backtrack…

In this paper, the existence of perfect and quasi-perfect splitter sets in finite abelian groups is studied, motivated by their application in coding theory for flash memory storage. For perfect splitter sets we view them as splittings of…

We generalize the "facial weak order" of a finite Coxeter group to a partial order on a set of intervals in a complete lattice. We apply our construction to the lattice of torsion classes of a finite-dimensional algebra and consider its…

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

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…

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

The weak order is a classical poset structure on a Coxeter group; it is a lattice when the group is finite but merely a meet-semilattice when the group is infinite. Motivated by problems in Kazhdan--Lusztig theory, Matthew Dyer introduced…

If $x$ and $y$ are roots in the root system with respect to the standard (Tits) geometric realization of a Coxeter group $W$, we say that $x$ \emph{dominates} $y$ if for all $w\in W$, $wy$ is a negative root whenever $wx$ is a negative…