Related papers: Profinite congruences and unary algebras
Some completely positive maps on reduced amalgamated free products of C*-algebras are constructed; these allow a proof that the class of exact unital C*-algebras is closed under taking reduced amalgamated free products. Consequently, the…
The motivation for this paper has been to study the relation between the zero component of the maximal graded algebra of quotients and the maximal graded algebra of quotients of the zero component, both in the Lie case and when considering…
We present a construction that yields infinite families of non-isomorphic semidirect products $N \rtimes F_m$ sharing a specified profinite completion. Within each family, $m \ge 2$ is constant and $N$ is a fixed group. For $m=2$ we can…
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
We introduce the notion of amenability for affine algebras. We characterize amenability by Folner-sequences, paradoxicality and the existence of finitely invariant dimension-measures. Then we extend the results of Rowen on ranks, from…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
Although $S_\infty$ (the group of all permutations of $\mathbb{N}$) is size continuum, both it and its closed subgroups can be presented as the set of paths through a countable tree. The subgroups of $S_\infty$ that can be presented this…
We prove that finitely generated free metabelian groups $\Psi_n$ are profinitely rigid in the absolute sense: they are distinguished by their finite quotients among all finitely generated residually finite groups. The proof is based on a…
We give a combinatorial characterization of amenability of monomial algebras and prove the existence of monomial Folner sequences, answering a question due to Ceccherini-Silberstein and Samet-Vaillant. We then use our characterization to…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
Given a profinite group $G$ and a family $\mathcal{F}$ of finite groups closed under taking subgroups, direct products and quotients, denote by $\mathcal{F}(G)$ the set of elements $g \in G$ such that $\{x \in G\ |\ \langle g,x \rangle \…
This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…
For a family of group words $w$ we show that if $G$ is a profinite group in which all $w$-values are contained in a union of finitely many subgroups with a prescribed property, then $w(G)$ has the same property as well. In particular, we…
An important and long-standing open problem in universal algebra asks whether every finite lattice is isomorphic to the congruence lattice of a finite algebra. Until this problem is resolved, our understanding of finite algebras is…
We study the structure of profinite polyadic groups and we prove that a polyadic topological group $(G, f)$ is profinite, if and only if, it is compact, Hausdorff, totally disconnected. More generally, for a pseudo-variety (or a formation)…
This work studies the question of learning probabilistic deterministic automata from language models. For this purpose, it focuses on analyzing the relations defined on algebraic structures over strings by equivalences and similarities on…
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…
We introduce the notion of the full quiver of a representation of an algebra, which is a cover of the (classical) quiver, but which captures properties of the representation itself. Gluing of vertices and of arrows enables one to study…
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…