Related papers: Open multiplication in relatively free profinite s…
Under reasonable assumptions, a group action on a module extends to the minimal free resolutions of the module. Explicit descriptions of these actions can lead to a better understanding of free resolutions by providing, for example,…
In this note we generalise some of the work of Klarner on free semigroups of affine maps acting on the real line by using a classical approach from geometric group theory (the Ping-Pong lemma). We also investigate the boundaries within…
We study the subgroup structure of the \'etale fundamental group $\Pi$ of a projective curve over an algebraically closed field of characteristic 0. We obtain an analog of the diamond theorem for $\Pi$. As a consequence we show that most…
We study verbally closed subgroups of free solvable groups. A number of results is proved that give sufficient conditions under whose a verbally closed subgroup is turned to be a retract and so algebraically closed of the full group.
We present a survey of results on profinite semigroups and their link with symbolic dynamics. We develop a series of results, mostly due to Almeida and Costa and we also include some original results on the Sch\"utzenberger groups…
We construct a correspondence between the cohomology groups of a group $G$ relative to a family of subgroups $\famS$ and the classes of `relative extensions' of $G$ by abelian groups, modulo a certain equivalence relation. We establish this…
We introduce an extension of the (tame) polynomial automorphism group over finite fields: the profinite (tame) polynomial automorphism group, which is obtained by putting a natural topology on the automorphism group. We show that most known…
A soluble pro-p group of finite rank is finitely axiomatizable in the class of all profinite groups if and only if for each open subgroup H, the image of Z(H) in the abelianization of H is finite, subject to some suitable hypothesis of…
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…
We propose and develop a theory that allows to characterize epimorphisms of profinite groups in terms of indecomposable epimorphisms.
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups,…
A survey of recent results about profinite groups, and results about infinite and finite groups where the theory of profinite groups plays a leading role.
In this paper we derive necessary and sufficient homological and cohomological conditions for profinite groups and modules to be of type $\operatorname{FP}_n$ over a profinite ring $R$, analogous to the Bieri-Eckmann criteria for abstract…
We contribute some information towards finding a general algorithm for constructing, for a given profinite group, $G$, a compact connected space, $X$, such that the full homeomorphism group, $H(X)$, with the compact-open topology is…
We obtain a criterion for quasiconvexity of a subgroup of an amalgamated free product of two word hyperbolic groups along a virtually cyclic subgroup. The result provides a method of constructing new word hyperbolic group in class (Q), that…
The well-known characterization of two-ended groups says that every two-ended group can be split over finite subgroups which means it is isomorphic to either by a free product with amalgamation $A\ast_C B$ or an HNN-extension $\ast_{\phi}…
This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…
We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph,…