Related papers: Groups generated by 3-state automata over a 2-lett…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…
We give a sharp bound for orders of elementary abelian 2-groups of birational automorphisms of rationally connected threefolds.
This paper grew out of three tutorial lectures on automatic structures given by the first author at the Logic Colloquium 2007. We discuss variants of automatic structures related to several models of computation: word automata, tree…
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…
We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of…
We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean…
Finitely generated (non-abelian) free metabelian pro-p groups, and wreath products of f.g. free abelian pro-p groups, are all finitely axiomatizable in the class of all profinite groups.
It is shown that the relatively free centre-by-metabelian and (class-2 nilpotent)-by-abelian pro-p groups on 2 generators are each finitely axiomatizable in the class of all profinite groups.
We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.
A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…
The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…
We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and…
We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we…
In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to…
The affine group schemes of automorphisms of the multilinear r-fold cross products on finite-dimensional vectors spaces over fields of characteristic not two are determined. Gradings by abelian groups on these structures, that correspond to…
In the first half of this paper, we outline the construction of a new class of abelian pro-$p$ groups, which covers all countably-based pro-$p$ groups. In the second half, we study them, and classify them up to topological isomorphism and…
We developed computer algebra tools for enumerating conjugacy classes of independent subsets and generating sets of symmetric groups up to $n=7$, and carried out an initial analysis of the obtained results.
By an $\ell$-group $G$ we mean a lattice-ordered abelian group. This paper is concerned with the category $\FP$ of finitely presented {\it unital} $\ell$-groups, those $\ell$-groups having a distinguished order-unit $u$. Using the duality…
Slattery (2007) described computational methods to enumerate, construct, and identify finite groups of squarefree order. We generalise Slattery's result to the class of finite groups that have cyclic Sylow subgroups and provide an…
We classify gradings by arbitrary abelian groups on the classical simple Lie and Jordan superalgebras $Q(n)$, $n \geq 2$, over an algebraically closed field of characteristic different from $2$ (and not dividing $n+1$ in the Lie case): fine…