Related papers: The lamplighter group $\mathbb{Z}_3\wr\mathbb{Z}$ …
We present a new algorithm to construct a deterministic Rabin automaton for an LTL formula $\varphi$. The automaton is the product of a master automaton and an array of slave automata, one for each $G$-subformula of $\varphi$. The slave…
We define Donaldson-Thomas invariants of Calabi-Yau orbifolds and we develop a topological vertex formalism for computing them. The basic combinatorial object is the orbifold vertex, a generating function for the number of 3D partitions…
This article constructs a crossed module corresponding to the generator of the third cohomology group with trivial coefficients of a complex simple Lie algebra. This generator reads as <[,],>, constructed from the Lie bracket [,] and the…
We use a semigroup-theoretic construction by Peter Higgins in order to produce, for each even $n$, an $n$-state and 3-letter synchronizing automaton with the following two features: 1) all its input letters act as idempotent selfmaps of…
We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined…
Box--ball systems (BBS) are integrable systems with soliton solutions and other good properties. We will search for automata that belong to the same class as BBS automata by introducing some classes of automata through the features of BBS…
We prove that any non-cocompact irreducible lattice in a higher rank semi-simple Lie group contains a subgroup of finite index, which has three generators.
A new algorithm allows us to calculate many new tilting characters for $SL_3$, $SP_4$, $G_2$, $SL_4$ and potentially many other groups. These calculations show that the Lusztig-Williamson Billiards Conjecture needs to be corrected. In this…
We add to the classification of groups generated by 3-state automata over a 2 letter alphabet given by Bondarenko et al., by showing that a number of the groups in the classification are non-contracting. We show that the criterion we use to…
We prove that Coxeter groups are biautomatic. From our construction of the biautomatic structure it follows that uniform lattices in isometry groups of buildings are biautomatic.
We describe the duality group $\Gamma=SU(3,3,Z)$ for the Narain lattice of the $T^6/Z_3$ orbifold and its action on the corresponding moduli space. A symplectic embedding of the momenta and winding numbers allows us to connect the orbifold…
We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…
The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…
We employ a skew group ring of $\mathbb Z/2\mathbb Z$ over $U(\mathfrak{sl}_2)$ to construct modules over the universal Bannai--Ito algebra. In addition, we give the conditions under which the defining generators act as Leonard triples on…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
It is known that the automorphism group of any projective K3 surface is finitely generated [24]. In this paper, we consider a certain kind of K3 surfaces with Picard number 3 whose automorphism groups are isomorphic to congruence subgroups…
Much study has been done on semigroups which are unions of groups. There are several ways in which a union of groups can be made into a semigroup in which each of the component groups arises as subgroups of the constructed semigroup. An…
A certain family of orthogonal groups (called "Clifford groups" by G. E. Wall) has arisen in a variety of different contexts in recent years. These groups have a simple definition as the automorphism groups of certain generalized…
In this paper we study a certain class of polycyclic groups. We outline a method for constructing a poly-$\mathbb{Z}$ group $G_n$ by describing a process for selecting maps that are used to extend $G_i$ to $G_{i+1}$ for $1 \leq i \leq n-1$…
In this paper, we construct a cellular automaton on the heptagrid which is planar, weakly universal and which have three states only. This result improves the best result which was with four states.