Related papers: Automata and cells in affine Weyl groups
We introduce the notion of 321-avoiding permutations in the affine Weyl group $W$ of type $A_{n-1}$ by considering the group as a George group (in the sense of Eriksson and Eriksson). This enables us to generalize a result of Billey,…
Following Lusztig, we consider a Coxeter group $W$ together with a weight function. Geck showed that the Kazhdan-Lusztig cells of $W$ are compatible with parabolic subgroups. In this paper, we generalize this argument to some subsets of $W$…
Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an…
We prove a formula for the dimension of Whittaker functionals of irreducible constituents of a regular unramified genuine principal series for covering groups. The formula explicitly relates such dimension to the Kazhdan-Lusztig…
The center of an extended affine Hecke algebra is known to be isomorphic to the ring of symmetric functions associated to the underlying finite Weyl group $W\_0$. The set of Weyl characters ${\sf s}\_\la$ forms a basis of the center and…
In 1979, Kazhdan and Lusztig introduced the notion of "cells" (left, right and two-sided) for a Coxeter group $W$, a concept with numerous applications in Lie theory and around. Here, we address algorithmic aspects of this theory for finite…
Let $\cH$ be the one-parameter Hecke algebra associated to a finite Weyl group $W$, defined over a ground ring in which ``bad'' primes for $W$ are invertible. Using deep properties of the Kazhdan--Lusztig basis of $\cH$ and Lusztig's…
A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration.…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
For a simply connected connected simple algebraic group $G$, it is known that a variety $B_{w_0}^-:=B^-\cap U\overline{w_0}U$ has a geometric crystal structure with a positive structure…
In this paper we consider the Hecke algebra $\mathcal {H}$ associated to an extended affine Weyl group of type $\widetilde{B_2}$. We give some interesting formulas on $C_{rt}S_{\lambda}$, which imply some relations between the…
Let $G$ be a connected reductive group over $\mathbb{C}$ with Weyl group $W$. Following a suggestion of Bezrukavnikov, we define a map from two-sided cells to conjugacy classes in $W$ using the geometry of the affine flag variety. This is…
The reflections in a Coxeter group are defined as conjugates of a single generator, and thus admit palindromic expressions as products of generators. Our main result gives closed formulas providing a palindromic reduced expression for each…
A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…
In this paper, we study the Kazhdan--Lusztig cells of a Coxeter group $W$ in a ``relative'' setting, with respect to a parabolic subgroup $W_I \subseteq W$. This relies on a factorization of the Kazhdan--Lusztig basis $\{C_w\}$ of the…
The downward closure of a word language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of any language is regular. While the downward closure appears to be a powerful…
Finite automata (FA) are a fundamental computational abstraction that is widely used in practice for various tasks in computer science, linguistics, biology, electrical engineering, and artificial intelligence. Given an input word, an FA…
We present an exposition of the theory of finite automata augmented with a multiply-only register storing an element of a given monoid or group. Included are a number of new results of a foundational nature. We illustrate our techniques…
In this paper we introduce a new type of approximate state reductions where the behaviors of the reduced and the original automaton do not have to be identical, but they must match on all words of length less than or equal to some given…