相关论文: Profinite congruences and unary algebras

Can one detect free products of groups via their profinite completions? We answer positively among virtually free groups. More precisely, we prove that a subgroup of a finitely generated virtually free group $G$ is a free factor if and only…

Let w be a group-word. Suppose that the set of all w-values in a profinite group G is contained in a union of countably many cosets of subgroups. We are concerned with the question to what extent the structure of the verbal subgroup w(G)…

An algebra is said to be a unary Leibniz algebra if every one-generated subalgebra is a Leibniz algebra. An algebra is said to be a binary Leibniz algebra if every two-generated subalgebra is a Leibniz algebra. We give characterizations of…

We present examples of closed subsets of a free group such that their product is not closed in the profinite topology. We discuss how to characterize a subset of a free group which is closed in the profinite topology and its product with…

Given an S-arithmetic group, we ask how much information on the ambient algebraic group, number field of definition, and set of places S is encoded in the commensurability class of the profinite completion. As a first step, we show that the…

First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous…

We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…

The Profinite Isomorphism Problem for a class of groups \mathcal{C} asks for an algorithm that decides for any two groups in \mathcal{C} whether they have isomorphic profinite completions. We present the positive solution to this problem…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

In this note we study associative dialgebras proving that the most interesting such structures arise precisely when the algebra is not semiprime. In fact the presence of some "perfection" property (simpleness, primitiveness, primeness or…

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 prove that every finite semigroup embeds in a finitely presented congruence-free monoid, and pose some questions around the Boone-Higman Conjecture.

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…

Rigid monoidal 1-categories are ubiquitous throughout quantum algebra and low-dimensional topology. We study a generalization of this notion, namely rigid algebras in an arbitrary monoidal 2-category. Examples of rigid algebras include…

Just infinite groups play a significant role in profinite group theory. For each $c \geq 0$, we consider more generally JNN$_c$F profinite (or, in places, discrete) groups that are Fitting-free; these are the groups $G$ such that every…

There has been much recent interest into those properties of a 3-manifold determined by the profinite completion of its fundamental group. In this paper we give readily computable criteria specifying precisely when two orientable graph…

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…

The article deals with profinite groups in which the centralizers are pronilpotent (CN-groups). It is shown that such groups are virtually pronilpotent. More precisely, let G be a profinite CN-group, and let F be the maximal normal…

Profinite algebras are the residually finite compact algebras; their underlying topological spaces are Stone spaces. We extend the theory of profinite algebras to a more general setting of Stone topological algebras. We introduce Stone…