Related papers: Subresiduated Nelson Algebras
We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…
In this paper, we show that every quasiorder $R$ induces a Nelson algebra $\mathbb{RS}$ such that the underlying rough set lattice $RS$ is algebraic. We note that $\mathbb{RS}$ is a three-valued {\L}ukasiewicz algebra if and only if $R$ is…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
We classify Nichols algebras of irreducible Yetter-Drinfeld modules over nonabelian groups satisfying an inequality for the dimension of the homogeneous subspace of degree two. All such Nichols algebras are finite-dimensional, and all known…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of Sets where the Green's relation D is a congruence describing an adjunction to the category of Lattices. In this paper we will…
We perform an Hamiltonian reduction on a classical \cw(\cg, \ch) algebra, and prove that we get another \cw(\cg, \ch$'$) algebra, with $\ch\subset\ch'$. In the case $\cg=S\ell(n)$, the existence of a suitable gauge, called Generalized…
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 prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…
The paper is devoted to the investigation of finite dimensional commutative nilpotent (associative) algebras N over an arbitrary base field of characteristic zero. Due to the lack of a general structure theory for algebras of this type (as…
The clear understanding of the non-convex landscape of neural network is a complex incomplete problem. This paper studies the landscape of linear (residual) network, the simplified version of the nonlinear network. By treating the gradient…
A common generalization of orthomodular lattices and residuated lattices is provided corresponding to bounded lattices with an involution and sectionally extensive mappings. It turns out that such a generalization can be based on integral…
In this expository article, we give a self-contained introduction to the wonderfully well-behaved class of pseudocompact algebras, focusing on the foundational classes of semisimple and separable algebras. We give characterizations of such…
Classical varieties were characterized by Lawvere as the categories with effective congruences and a varietal generator: an abstractly finite regular generator which is regularly projective (its hom-functor preserves regular epimorphisms).…
We complete a classification of the two-vertex geometrically irreducible algebras. We also classify the algebras in new classes of hom- and ext-irreducible algebras.
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
Motivated by Kohno's result on the holonomy Lie algebra of a hyperplane arrangement, we define the holonomy Lie algebra of a finite geometric lattice in a combinatorial way. For a solvable pair of lattices, we show that the holonomy Lie…
Rough sets induced by quasiorders appear in several constructions using binary relations in computer science. In this paper, a structural characterisation of rough sets induced by quasiorders is given. These rough sets form Nelson algebras…
The paper is essentially a continuation of B.Plotkin, G.Zhitomirski, "Some logical invariants of algebras and logical relations between algebras", St.Peterburg Math. J., {19:5}, (2008) 859 -- 879, whose main notion is that of…
The main objective of this paper is to study the relationship between a solvable evolution algebra and its subalgebra lattice, emphasizing two of its main properties: distributivity and modularity. First, we will focus on the nilpotent…