Related papers: On free completely iterative algebras
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 binary trees whose leaves are labeled by letters of an alphabet…
We continue our studies on semilattice ordered algebras. This time we accept constants in the type of algebras. We investigate identities satisfied by such algebras and describe the free objects in varieties of semilattice ordered algebras…
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
It is shown that topological freeness of Rieffel's induced representation functor implies that any $C^*$-algebra generated by a faithful covariant representation of a Hilbert bimodule $X$ over a $C^*$-algebra $A$ is canonically isomorphic…
Examples of simple, separable, unital, purely infinite $C^*$--algebras are constructed, including: (1) some that are not approximately divisible; (2) those that arise as crossed products of any of a certain class of $C^*$--algebras by any…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
In this note we show that there exist a $2^\mathfrak{c}$-generated free algebra $\mathcal{S} \subset \mathbb{R}^\mathbb{R}$ of Riemann integrable functions and a free algebra $\mathcal{C} \subset \mathbb{R}^{[0,1]}$ of continuous functions,…
Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…
We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…
It is proved that any vertex operator algebra for which the image of the Virasoro element in Zhu's algebra is algebraic over complex numbers is finitely generated. In particular, any vertex operator algebra with a finite dimensional Zhu's…
It is well known that classical varieties of $\Sigma$-algebras correspond bijectively to finitary monads on $\mathsf{Set}$. We present an analogous result for varieties of ordered $\Sigma$-algebras, i.e., classes presented by inequations…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.
For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…
We consider the canonical pseudodistributive law between various free limit completion pseudomonads and the free coproduct completion pseudomonad. When the class of limits includes pullbacks, we show that this consideration leads to notions…
This paper is the second in a series of three, the aim of which is to construct algebraic geometry over a free metabelian Lie algebra $F$. For the universal closure of free metabelian Lie algebra of finite rank $r \ge 2$ over a finite field…
For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…