Related papers: Hardness Results for the Subpower Membership Probl…
For some Maltsev conditions $\Sigma$ it is enough to check if a finite algebra $\mathbf A$ satisfies $\Sigma$ locally on subsets of bounded size, in order to decide, whether $\mathbf A$ satisfies $\Sigma$ (globally). This local-global…
An early result in the theory of Natural Dualities is that an algebra with a near unanimity (NU) term is dualizable. A converse to this is also true: if V(A) is congruence distributive and A is dualizable, then A has an NU term. An…
Given a lattice $\mathbb{L}$ and a class $K$ of algebraic structures, we say that $\mathbb{L}$ \emph{forces nilpotency} in $K$ if every algebra $\mathbf{A} \in K$ whose congruence lattice $\mathrm{Con} (\mathbf{A})$ is isomorphic to…
We give an affirmative answer to the question whether there exist Lie algebras for suitable closed subgroups of the unitary group $U(\mathcal{H})$ in a Hilbert space $\mathcal{H}$ with $U(\mathcal{H})$ equipped with the strong operator…
Clonoids are sets of finitary operations between two algebraic structures that are closed under composition with their term operations on both sides. We conjecture that, for finite modules $\mathbf A$ and $\mathbf B$ there are only finitely…
For the truncated moment problem associated to a complex sequence $\gamma ^{(2n)}=\{\gamma _{ij}\}_{i,j\in Z_{+},i+j \leq 2n}$ to have a representing measure $\mu $, it is necessary for the moment matrix $M(n)$ to be positive semidefinite,…
For finitely generated nilpotent groups, we employ Mal'cev coordinates to solve several classical algorithmic problems efficiently. Computation of normal forms, the membership problem, the conjugacy problem, and computation of presentations…
We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of…
We study the class of Bernstein algebras that are algebraic, in the sense that each element generates a finite-dimensional subalgebra. Every Bernstein algebra has a maximal algebraic ideal, and the quotient algebra is a zero-multiplication…
In this paper we continue the study of the subalgebra lattice of a Leibniz algebra. In particular, we find out that solvable Leibniz algebras with an upper semi-modular lattice are either almost-abelian or have an abelian ideal spanned by…
We prove the conjugacy of Sylow $2$-subgroups in pseudofinite $\mathfrak{M}_c$ (in particular linear) groups under the assumption that there is at least one finite Sylow $2$-subgroup. We observe the importance of the pseudofiniteness…
Let $f$ be an ordinary polynomial in $\mathbb{C}[z_1,..., z_n]$ with no negative exponents and with no factor of the form $z_1^{\alpha_1}... z_n^{\alpha_n}$ where $\alpha_i$ are non zero natural integer. If we assume in addicting that $f$…
General theory determines the notion of separable MV-algebra (equivalently, of separable unital lattice-ordered Abelian group). We establish the following structure theorem: An MV-algebra is separable if, and only if, it is a finite product…
We construct a weakly compact convex subset of $\ell^2$ with nonempty interior that has an isolated maximal element, with respect to the lattice order $\ell _+^2$. Moreover, the maximal point cannot be supported by any strictly positive…
We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated to the chain form a linear space spanning a Lie algebra. The key…
The aim of this paper is to give a proof of the restriction theorems for principal bundles with a reductive algebraic group as structure group in arbitrary characteristic. Let $G$ be a reductive algebraic group over any field $k=\bar{k}$,…
In this paper we examine four-element and five-element digraphs for existence of certain polymorphisms that imply congruence meet-semidistributivity in a locally finite variety. The results presented here occurred as an integral part of my…
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…