Related papers: On the group of a rational maximal bifix code
Consider the following generalization of the bicyclic monoid. Let $\kappa$ be any infinite cardinal and let $\mathcal{IP\!F}\left(\sigma{\mathbb{N}^\kappa}\right)$ be the semigroup of all order isomorphisms between principal filters of the…
It is known that the existential theory of equations in free groups is decidable. This is a famous result of Makanin. On the other hand it has been shown that the scheme of his algorithm is not primitive recursive. In this paper we present…
We give necessary and sufficient conditions for a free-by-free group to be relatively hyperbolic with a cusp-preserving structure. Namely, if $\phi_1, \ldots , \phi_k $ is a collection of exponentially growing outer automorphisms with a…
We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…
The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…
We develop some new topological tools to study maximal subgroups of free idempotent generated semigroups. As an application, we show that the rank 1 component of the free idempotent generated semigroup of the biordered set of a full matrix…
Surface groups are determined among limit groups by their profinite completions. As a corollary, the set of surface words in a free group is closed in the profinite topology.
The purpose of this paper is to extend some useful results, such as the multiplication being open, previously known for suitable finitely generated relatively free profinite semigroups, to relatively free profinite semigroupoids over…
Given an arbitrary, finitely presented, residually finite group $\Gamma$, one can construct a finitely generated, residually finite, free-by-free group $M_\Gamma = F_\infty\rtimes F_4$ and an embedding $M_\Gamma \hookrightarrow (F_4\ast…
In this paper, we prove that: (1) Let $f:G\rightarrow H$ be a continuous $d$-open surjective homomorphism; if $G$ is an $\mathbb{R}$-factorizabile paratopological group, then so is $H$. Peng and Zhang's result \cite[Theorem 1.7]{PZ} is…
For an arbitrary separated scheme $X$ of finite type over a finite field $\mathbb F_q$ and an integer $j=-1,-2,$ we prove under the assumption of resolution of singularities, that the two groups $H_{-1}(X,\mathbb Z(j))$ and…
We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…
Several authors have studied the question of when the monoid ring DM of a monoid M over a ring D is a right and/or left fir (free ideal ring), a semifir, or a 2-fir (definitions recalled in section 1). It is known that for M nontrivial, a…
We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…
Examples are given of profinite groups that are not strongly complete, and have other `bad' properties, yet have only finitely many open subgroups of each finite index. It is shown that a profinite group with the latter property must be…
We will show that a system is synchronized if and only if it has a cover whose cover map is semi-open. Also, any factor code on an irreducible sofic shift is semi-open and the image of a synchronized system by a semi-open code is…
The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…
We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…
In this short note we prove that any irreducible algebraic monoid whose unit group is an affine algebraic group is affine.
Let $G=F\ast_\varphi t$ be an HNN extension of a free group $F$ with two equal associated normal subgroups $H_1 = H_2$ of finite index. We prove that the word problem in $G$ is decidable in polynomial time. This result extends to the case…