Related papers: Automata generating free products of groups of ord…

A two-dimensional arrangement of toothpicks is constructed by the following iterative procedure. At stage 1, place a single toothpick of length 1 on a square grid, aligned with the y-axis. At each subsequent stage, for every exposed…

Trees are useful entities allowing to model data structures and hierarchical relationships in networked decision systems ubiquitously. An ordered tree is a rooted tree where the order of the subtrees (children) of a node is significant. In…

The minimal number of inputs in the local function of a non-trivial cellular automaton is two. Such a function can be viewed as as a kind of binary operation. If this operation is associative, it forms, together with the set of states, a…

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 show that each of the Artin groups of type $B_n$ and $D_n$ can be presented as a semidirect product $F \rtimes {\cal B}_n$, where $F$ is a free group and ${\cal B}_n$ is the $n$-string braid group. We explain how these semidirect product…

Tile Automata is a recently defined model of self-assembly that borrows many concepts from cellular automata to create active self-assembling systems where changes may be occurring within an assembly without requiring attachment. This model…

We study left orderings on countably generated groups. In particular, we construct left orderings of inductive limits of amalgamated free products by using isolated left orderings of the groups appearing in the inductive system. Moreover,…

We show that every rank two $p$-group acts freely and smoothly on a product of two spheres. This follows from a more general construction: given a smooth action of a finite group $G$ on a manifold $M$, we construct a smooth free action on…

We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated…

We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…

We give a simple proof of the finite presentation of Sela's limit groups by using free actions on R^n-trees. We first prove that Sela's limit groups do have a free action on an R^n-tree. We then prove that a finitely generated group having…

We prove that for a number of ultrahomogeneous structures $M$, including those with the free amalgamation property, the powers of the automorphism group ${\rm{Aut}}(M)^n$, $n=1,2,\ldots$, and the group $L_0({\rm{ Aut}}(M))$ of measurable…

Let G be a finitely generated infinite pro-p group acting on a pro-p tree such that the restriction of the action to some open subgroup is free. Then we prove that G splits as a pro-p amalgamated product or as a pro-p HNN-extension over an…

Free Meixner states are a class of functionals on non-commutative polynomials introduced in math.CO/0410482. They are characterized by a resolvent-type form for the generating function of their orthogonal polynomials, by a recursion…

We show that the wreath product of two finite symmetric or alternating groups is 2-generated.

We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite…

For every non-trivial finite abelian group $A$, we exhibit a bireversible automaton generating the lamplighter group $A \wr \mathbb{Z}$.

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

This paper presents and analyzes an incremental algorithm for the construction of Acyclic Non-deterministic Finite-state Automata (NFA). Automata of this type are quite useful in computational linguistics, especially for storing lexicons.…

We construct the free products of arbitrary digroups, and thus we solve an open problem of Zhuchok.