Related papers: Automata and cells in affine Weyl groups

Let W be an irreducible, finitely generated Coxeter group. The geometric representation provides an discrete embedding in the orthogonal group of the so-called Tits form. One can look at the representation modulo the kernel of this form; we…

For a finite group $G$ and a finite set $A$, we study various algebraic aspects of cellular automata over the configuration space $A^G$. In this situation, the set $\text{CA}(G;A)$ of all cellular automata over $A^G$ is a finite monoid…

In this paper we determine the partition into Kazhdan-Lusztig cells of the affine Weyl groups of type $\tB_{2}$ and $\tG_{2}$ for any choice of parameters. Using these partitions we show that the semicontinuity conjecture of Bonnaf\'e holds…

Let $W$ be a finite Coxeter group. It is well-known that the number of involutions in $W$ is equal to the sum of the degrees of the irreducible characters of $W$. Following a suggestion of Lusztig, we show that this equality is compatible…

Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free…

A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…

Let $\mathfrak{g}$ be the Lie algebra $\mathfrak{sl}(n,\mathbb{C})$. Its Weyl group is the symmetric group $S_n$. In this paper, we want to describe some Kazhdan-Lusztig right cells containing smooth elements which parameterize the smooth…

Since the 1970s with the work of McNaughton, Papert and Sch\"utzenberger, a regular language is known to be definable in the first-order logic if and only if its syntactic monoid is aperiodic. This algebraic characterisation of a…

Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…

We recall Lusztig's construction of the asymptotic Hecke algebra $J$ of a Coxeter system $(W,S)$ via the Kazhdan--Lusztig basis of the corresponding Hecke algebra. The algebra $J$ has a direct summand $J_E$ for each two-sided…

For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the…

Let $(W,S)$ be a Coxeter system and suppose that $w \in W$ is fully commutative (in the sense of Stembridge) and has a reduced expression beginning (respectively, ending) with $s \in S$. If there exists $t\in S$ such that $s$ and $t$ do not…

Factorized dynamics in soliton cellular automata with quantum group symmetry is identified with a motion of particles and anti-particles exhibiting pair creation and annihilation. An embedding scheme is presented showing that the…

We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…

Following some previous studies on restarting automata, we introduce a refined model - the h-lexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics. We…

Let $G$ be a connected reductive group over an algebraically closed field. Let $B$ be a Borel subgroup of $G$ and $W$ be the associated Weyl group. We show that for any $w \in W$ that is not contained in any standard parabolic subgroup of…

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

In this article we introduce the notion of a \textit{regular partition} of a Coxeter group. We develop the theory of these partitions, and show that the class of regular partitions is essentially equivalent to the class of automata (not…

Bruyere and Carton lifted the notion of finite automata reading infinite words to finite automata reading words with shape an arbitrary linear order L. Automata on finite words can be used to represent infinite structures, the so-called…

The main result describes the Brauer-Nesbitt reduction of unipotent representations of a finite group of Lie type, expressing it as an explicit linear combination of the restriction of Weyl modules from the algebraic group to the group of…