Related papers: Cone Types, Automata, and Regular Partitions in Co…

Artin groups are a natural generalization of braid groups and are well-understood in certain cases. Artin groups are closely related to Coxeter groups. There is a faithful representation of a Coxeter group $W$ as a linear reflection group…

Let C be a one- or two-sided Kazhdan--Lusztig cell in a Coxeter group (W,S), and let Reduced(C) denote the set of reduced expressions of all w in C, regarded as a language over the alphabet S. Casselman has conjectured that Reduced(C) is…

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…

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…

The notion of limit roots of a Coxeter group W was recently introduced (see arXiv:1112.5415 and arXiv:1303.6710): they are the accumulation points of directions of roots of a root system for W. In the case where the root system lives in a…

We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or,…

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…

We study the modular representations of finite groups of Lie type arising in the cohomology of certain quotients of Deligne-Lusztig varieties associated with Coxeter elements. These quotients are related to Gelfand-Graev representations and…

We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language -- which is the number of its (left) quotients, and…

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…

The study of representations of affine Hecke algebras has led to a new notion of shapes and standard Young tableaux which works for the root system of any finite Coxeter group. This paper is completely independent of affine Hecke algebra…

In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…

Co-lex partial orders were recently introduced in (Cotumaccio et al., SODA 2021 and JACM 2023) as a powerful tool to index finite state automata, with applications to regular expression matching. They generalize Wheeler orders (Gagie et…

We study natural partial normalization spaces of Coxeter arrangements and discriminants and relate their geometry to representation theory. The underlying ring structures arise from Dubrovin's Frobenius manifold structure which is lifted…

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…

This paper is a contribution to the general problem of giving an explicit description of the basic locus in the reduction modulo $p$ of Shimura varieties. Motivated by \cite{Vollaard-Wedhorn} and \cite{Rapoport-Terstiege-Wilson}, we…

The study of the set of limit roots associated to an infinite Coxeter group was initiated by Hohlweg, Labb\'{e} and Ripoll and further developed by Dyer, Hohlweg, P\'eaux and Ripoll. The Davis complex associated to a finitely generated…

We prove that the lower central series of the cactus group associated with a non commutative Coxeter group never stabilizes. We also compute a minimal presentation in terms of generators for the cactus group associated with a finite Coxeter…

For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter…

As a visualization of Cartier and Foata's "partially commutative monoid" theory, G.X. Viennot introduced "heaps of pieces" in 1986. These are essentially labeled posets satisfying a few additional properties. They naturally arise as models…