English
Related papers

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

200 papers

We introduce the notion of a bounded weight function on a language, and show that the set of bounded weight functions on a regular language is a rational polyhedral cone. We study the cell recognised by a bounded weight function (that is,…

Group Theory · Mathematics 2025-10-21 J. Guilhot , E. Little , J. Parkinson

An involution in a Coxeter group has an associated set of involution words, a variation on reduced words. These words are saturated chains in a partial order first considered by Richardson and Springer in their study of symmetric varieties.…

Combinatorics · Mathematics 2019-06-27 Eric Marberg , Brendan Pawlowski

We characterize relatively norm compact sets in the regular $C^*$-algebra of finitely generated Coxeter groups using a geometrically defined positive semigroup acting on the algebra.

Operator Algebras · Mathematics 2012-07-09 Gero Fendler

In the present work, we lay out a new theory showing that all automata can always be co-lexicographically partially ordered, and an intrinsic measure of their complexity can be defined and effectively determined, namely, the minimum width…

Formal Languages and Automata Theory · Computer Science 2023-05-04 Nicola Cotumaccio , Giovanna D'Agostino , Alberto Policriti , Nicola Prezza

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

Combinatorics · Mathematics 2011-01-26 Matthew J. Samuel

In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…

Combinatorics · Mathematics 2018-08-14 Victor Reiner , Bridget Eileen Tenner , Alexander Yong

We generalize some identities and q-identities previously known for the symmetric group to Coxeter groups of type B and D. The extended results include theorems of Foata and Sch\"utzenberger, Gessel, and Roselle on various distributions of…

Combinatorics · Mathematics 2007-07-19 Riccardo Biagioli

These notes give a short introduction to finite Coxeter groups, their classification, and some parts of their representation theory, with a focus on the infinite families. They are based on lectures delivered by the author at the…

Representation Theory · Mathematics 2025-09-16 Pooja Singla

Let W be an infinite irreducible Coxeter group with (s_1, ..., s_n) the simple generators. We give a simple proof that the word s_1 s_2 ... s_n s_1 s_2 >... s_n ... s_1 s_2 ... s_n is reduced for any number of repetitions of s_1 s_2 >...…

Combinatorics · Mathematics 2007-10-18 David E Speyer

A right-angled Coxeter group is a group with a given set of generators of order two, subject only to the relations that certain pairs of the generators commute. Various papers have shown how homological properties of the Coxeter group are…

Group Theory · Mathematics 2007-12-03 Warren Dicks , Ian J Leary

Let $W_a$ be an affine Weyl group and $\eta:W_a\longrightarrow W_0$ be the natural projection to the corresponding finite Weyl group. We say that $w\in W_a$ has finite Coxeter part if $\eta(w)$ is conjugate to a Coxeter element of $W_0$.…

Representation Theory · Mathematics 2012-03-22 Xuhua He , Zhongwei Yang

We investigate the faces and the face lattices of arbitrary Coxeter group invariant convex subcones of the Tits cone of a linear Coxeter system as introduced by E. B. Vinberg. Particular examples are given by certain Weyl group invariant…

Representation Theory · Mathematics 2017-09-13 Claus Mokler

Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group element raises the question of how to enumerate the reduced expressions of an arbitrary Coxeter group element. We provide a framework for…

Combinatorics · Mathematics 2011-08-17 Hugh Denoncourt

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons

We show that certain embeddings of Coxeter groups within other Coxeter groups are injective using the notion of Coxeter partitions. Moreover, we study Lusztig's partitions, which are generalizations of Lusztig's admissible maps and Crisp's…

Group Theory · Mathematics 2024-04-23 Ben Elias , Edmund Heng

The imaginary cone of a Kac-Moody Lie algebra is the convex hull of zero and the positive imaginary roots. This paper studies the imaginary cone for a class of root systems of general Coxeter groups W. It is shown that the imaginary cone of…

Representation Theory · Mathematics 2013-04-03 Matthew Dyer

In this paper, we study the generating function of cyclically fully commutative elements in Coxeter groups, which are elements such that any cyclic shift of theirs reduced decompositions remains a reduced expression of a fully commutative…

Combinatorics · Mathematics 2016-12-13 Mathias Pétréolle

Motivated by the desire to understand the geometry of the basic loci in the reduction of Shimura varieties, we study their "group-theoretic models" -- generalized affine Deligne-Lusztig varieties -- in cases where they have a particularly…

Algebraic Geometry · Mathematics 2020-09-21 Ulrich Görtz , Xuhua He , Sian Nie

We provide a complete description of the presentations of the interval groups related to quasi-Coxeter elements in finite Coxeter groups. In the simply laced cases, we show that each interval group is the quotient of the Artin group…

Group Theory · Mathematics 2022-11-28 Barbara Baumeister , Derek F. Holt , Georges Neaime , Sarah Rees

The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its…

Formal Languages and Automata Theory · Computer Science 2016-05-25 Guillaume Bonfante , Florian Deloup