Related papers: Profiniteness in finitely generated varieties is u…

We prove that there is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite quotient; indeed, this remains undecidable among the fundamental groups of compact, non-positively curved square…

We consider pairs of finitely presented, residually finite groups $u:P\hookrightarrow \Gamma$. We prove that there is no algorithm that, given an arbitrary such pair, can determine whether or not the associated map of profinite completions…

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…

A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…

In this paper, we give new criteria for affineness of a variety defined over $\Bbb{C}$. Our main result is that an irreducible algebraic variety $Y$ (may be singular) of dimension $d$ ($d\geq 1$) defined over $\Bbb{C}$ is an affine variety…

We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…

For a class V of algebras, denote by Conc(V) the class of all semilattices isomorphic to the semilattice Conc(A) of all compact congruences of A, for some A in V. For classes V1 and V2 of algebras, we denote by crit(V1,V2) the smallest…

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

We consider finitely presented,residually finite groups $G$ and finitely generated normal subgroups $A$ such that the inclusion $A\hookrightarrow G$ induces an isomorphism from the profinite completion of $A$ to a direct factor of the…

The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…

Recently there has been a lot of research and progress in profinite groups. We survey some of the new results and discuss open problems. A central theme is decompositions of finite groups into bounded products of subsets of various kinds…

Let V be a variety of not necessarily associative algebras, and A an inverse limit of nilpotent algebras A_i\in V, such that some finitely generated subalgebra S \subseteq A is dense in A under the inverse limit of the discrete topologies…

We show that, if S is a finite semiring, then the free profinite S-semimodule on a Boolean Stone space X is isomorphic to the algebra of all S-valued measures on X, which are finitely additive maps from the Boolean algebra of clopens of X…

This paper establishes strong profinite rigidity results for K\"ahler groups, showing that certain groups are determined within the class of residually finite K\"ahler groups by their profinite completion. Examples include products of…

We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the…

We show that given a simple abelian variety $A$ and a normal variety $V$ defined over a finitely generated field $K$ of characteristic zero, the set of non-constant morphisms $V \to A$ satisfying certain tangency conditions imposed by a…

A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…

Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits…

Decision procedures can be either theory-specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure for quantifier-free…