Related papers: Functional reducts of Boolean algebras
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
In the first half of this paper, we outline the construction of a new class of abelian pro-$p$ groups, which covers all countably-based pro-$p$ groups. In the second half, we study them, and classify them up to topological isomorphism and…
We investigate the width complexity of nondeterministic unitary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically cheap functions that are…
The complete affine structures on abelian Lie algebras in small dimensions are well known. In this paper we are interested by the non complete case. In particular we classify all these structures in dimensions 2 and 3.
We consider the structure of algebra of operators, acting in $n-$fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its…
We introduce and characterize a particularly tractable class of unital type 1 C*-algebras with bounded dimension of irreducible representations. Algebras in this class are called recursive subhomogeneous algebras, and they have an inductive…
In this paper, we classify irreducible representations of affine group superschemes over fields $F$ of characteristic not two in terms of those over a separable closure $F^{\mathrm{sep}}$ and their Galois twists. We also compute the…
We describe all irreducible conformal subalgebras of Cend_N. The classification of simple and semisimple associative conformal algebras with finite faithful representation follows from this description.
We study finite-dimensional nonassociative algebras. We prove the implicit function theorem for such algebras. This allows us to establish a correspondence between such algebras and quasigroups, in the spirit of classical correspondence…
We consider several types of non-existence theorems for functors. For example, there are no nontrivial functors from the category of groups (or the category of pointed sets, or vector spaces) to any small category. Another type of questions…
We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
A function $f$ from a domain in $\mathbb{R}^3$ to the quaternions is said to be inframonogenic if $\overline{\partial}\, f\overline{\partial} =0$, where $\overline{\partial} = \partial/\partial x_0+ (\partial/\partial…
We construct uncountably generated algebras inside the following sets of special functions: Sierpi\'nski-Zygmund functions, perfectly everywhere surjective functions and nowhere continuous Darboux functions. All conclusions obtained in this…
We study the ring of rational functions admitting a continuous extension to the real affine space. We establish several properties of this ring. In particular, we prove a strong Nullstelensatz. We study the scheme theoretic properties and…
We explore orbits, rational invariant functions, and quotients of the natural actions of connected, not necessarily finite dimensional subgroups of the automorphism groups of irreducible algebraic varieties. The applications of the results…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.
Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The…
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…