Related papers: Congruence Preservation, Lattices and Recognizabil…
This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…
Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is…
Pseudo-effect algebras are partial algebraic structures, that were introduced as a non-commutative generalization of effect algebras. In the present paper, lattice ordered pseudo-effect algebras are considered as possible algebraic…
We revisit the problem of Stone duality for lattices with various quasioperators, first studied in [14], presenting a fresh duality result. The new result is an improvement over that of [14] in two important respects. First, the…
Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…
Necessary and sufficient conditions are given for the similarity between two perturbations of the (backward) shift by rank one operators, under certain assumptions on the perturbations. The proof of similarity is based on an explicit…
Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two…
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
In this paper, we introduce a novel generalization of the classical property of algebras known as "being alternative," which we term "partially alternative." This new concept broadens the scope of alternative algebras, offering a fresh…
A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…
As is known, every finite-dimensional algebra over a field is isomorphic to the centralizer algebra of \textbf{two} matrices. So it is fundamental to study first the centralizer algebra of a single matrix, called a centralizer matrix…
The first steps towards linearisation of partial orders and equivalence relations are described. The definitions of partial orders and equivalence relations (on sets) are formulated in a way that is standard in category theory and that…
Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…
We discuss two possible ways of representing tolerances: first, as a homomorphic image of some congruence; second, as the relational composition of some compatible relation with its converse. The second way is independent from the variety…
We introduce residuated ortholattices as a generalization of -- and environment for the investigation of -- orthomodular lattices. We establish a number of basic algebraic facts regarding these structures, characterize orthomodular lattices…
We first establish several general properties of modality of algebraic group actions. In particular, we introduce the notion of a modality-regular action and prove that every visible action is modality-regular. Then, using these results, we…
Our aim is to find some new links between linear (circular) orderability of groups and topological dynamics. We suggest natural analogs of the concept of algebraic orderability for topological groups involving order-preserving actions on…
This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…
We study the ring of algebraic functions on the space of persistence barcodes, with applications to pattern recognition.
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…