Related papers: Splittability and 1-amalgamability of permutation …
Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.
A 1-matrix model is proposed, which nicely interpolates between double-scaling continuum limits of all multimatrix models. The interpolating partition function is always a KP $\tau $-function and always obeys ${\cal L}_{-1}$-constraint and…
For a class of nonassociative metagroup algebras their separability is investigated. For this purpose the cohomology theory on them is utilized. Conditions are found under which nonassociative metagroup algebras are separable. Algebras…
A commutative algebra is exact if its multiplication endomorphisms are trace-free and is Killing metrized if its Killing type trace-form is nondegenerate and invariant. A Killing metrized exact commutative algebra is necessarily neither…
Recently, S. Carpi et al. (Comm. Math. Phys., 402:169-212, 2023) proved that every connected (i.e. haploid) Frobenius algebra in a tensor C$^*$-category is unitarizable (i.e. isomorphic to a special C$^*$-Frobenius algebra). Building on…
We prove that every distributive algebraic lattice with at most $\aleph\_1$ compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The $\aleph\_1$ bound is optimal, as…
Let G be the free product of groups A and B with commuting subgroups H \leqslant A and K \leqslant B, and let C be the class of all finite groups or the class of all finite p-groups. We derive the description of all C-separable cyclic…
The homomorphic image of a congruence is always a tolerance (relation) but, within a given variety, a tolerance is not necessarily obtained this way. By a Maltsev-like condition, we characterize varieties whose tolerances are homomorphic…
We define variants of Pisier's similarity degree for unital C*-algebras and use direct integral theory to obtain new results. We prove that if every II$_{1}$ factor representation of a separable C*-algebra $\mathcal{A}$ has property…
We prove that Mal'tsev and Goursat categories may be characterised through stronger variations of the Shifting Lemma, that is classically expressed in terms of three congruences $R$, $S$ and $T$, and characterises congruence modular…
A graph class $\mathcal C$ is monadically dependent if one cannot interpret all graphs in colored graphs from $\mathcal C$ using a fixed first-order interpretation. We prove that monadically dependent classes can be exactly characterized by…
The group $S_4$ of permutations on four elements has an irreducible representation corresponding to the partition 4=2+2. This representation appears in several different mathematical contexts: the Jacobi identity of Lie algebras; the…
We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…
Suppose that $\mathcal{C}$ is a root class of groups (i.e., a class of groups that contains non-trivial groups and is closed under taking subgroups and unrestricted wreath products), $G$ is the free product of residually…
Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. $G$ is said to be $\sigma$-soluble if every chief factor $H/K$ of $G$ is a $\sigma _{i}$-group for some $i=i(H/K)$. A set…
We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…
For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…
The juxtaposition of permutation classes $\mathcal{C}$ and $\mathcal{D}$ is the class of all permutations formed by concatenations $\sigma\tau$, such that $\sigma$ is order isomorphic to a permutation in $\mathcal{C}$, and $\tau$ to a…
A permutiple is a natural number whose representation in some base is an integer multiple of a number whose representation has the same collection of digits. A previous paper utilizes a finite-state-machine construction and its state graph…