Related papers: Profinite topologies
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e. classes of finite algebras closed under finite products,…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…
In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…
We establish that, under certain closure assumptions on a pseudovariety of semigroups, the corresponding relatively free profinite semigroups freely generated by a non-singleton finite set act faithfully on their minimum ideals. As…
A free semigroupoid algebra is the closure of the algebra generated by a TCK family of a graph in the weak operator topology. We obtain a structure theory for these algebras analogous to that of free semigroup algebra. We clarify the role…
Let $(\mathcal{G},\Gamma)$ be an abstract graph of finite groups. If $\Gamma$ is finite, we can construct a profinite graph of groups in a natural way $(\hat{\mathcal{G}},\Gamma)$, where $\hat{\mathcal{G}}(m)$ is the profinite completion of…
We give two examples of a finitely generated subgroup of a free group and a subset, closed in the profinite topology of a free group, such that their product is not closed in the profinite topology of a free group.
This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…
A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
It is important to classify covering subgroups of the fundamental group of a topological space using their topological properties in the topologized fundamental group. In this paper, we introduce and study some topologies on the fundamental…
We prove that the profinite completion of the fundamental group of a compact 3-manifold $M$ satisfies a Tits alternative: if a closed subgroup $H$ does not contain a free pro-$p$ subgroup for any $p$, then $H$ is virtually soluble, and…
We introduce "synchronous algebras", an algebraic structure tailored to recognize automatic relations (aka. synchronous relations, or regular relations). They are the equivalent of monoids for regular languages, however they conceptually…
We obtain some general restrictions on the continuous endomorphisms of a profinite group G under the assumption that G has only finitely many open subgroups of each index (an assumption which automatically holds, for instance, if G is…
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…
Broadly speaking, a finiteness property of groups is any generalisation of the property of having finite order. A large part of infinite group theory is concerned with finiteness properties and the relationships between them. Profinite…
In this paper we define and develop the theory of the cohomology of a profinite group relative to a collection of closed subgroups. Having made the relevant definitions we establish a robust theory of cup products and use this theory to…
An $\mathcal{A}$-semigroup is a numerical semigroup without consecutive small elements. This work generalizes this concept to finite-complement submonoids of an affine cone $\mathcal{C}$. We develop algorithmic procedures to compute all…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
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…