Related papers: Distributive laws in residuated binars
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…
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…
It is shown that commutator identities on associative algebras generate solutions of linearized integrable equations. Next, a special kind of the dressing procedure is suggested that in a special class of integral operators enables to…
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…
We obtain a series of new results on the problem of irreducibility of commuting varieties associated with symmetric pairs or, in other words, $Z_2$-graded simple Lie algebras. In particular, we present many examples of reducible commuting…
Let $L$ be a distributive lattice and $R(L)$ the associated Hibi ring. We compute $\reg R(L)$ when $L$ is a planar lattice and give a lower bound for $\reg R(L)$ when $L$ is non-planar, in terms of the combinatorial data of $L.$ As a…
A significant fraction of massive stars are found in multiple systems. The effect of binarity on stellar evolution is poorly constrained. In particular, the role of tides and mass transfer on surface chemical abundances is not constrained…
It is proved that the additive group of every semidistributive nearring $R$ with an identity is abelian and if R has no elements of order $2$, then the nearring $R$ actually is an associative ring.
We investigate certain nonassociative binary operations that satisfy a four-parameter generalization of the associative law. From this we obtain variations of the ubiquitous Catalan numbers and connections to many interesting combinatorial…
Bilattices (that is, sets with two lattice structures) provide an algebraic tool to model simultaneously the validity of, and knowledge about, sentences in an appropriate language. In particular, certain bilattices have been used to model…
We characterize the finite distributive lattices on which there exists a unique compatible algebra with straightening laws.
Correlation between the spins (rotational velocities) in binaries has previously been established. We now continue and show that the degree of spin correlation is independent of the components' separation. Such a result might be related for…
In this paper, we describe the defining identities of a variety of binary perm algebras, which is a subvariety of the variety of alternative algebras. In addition, we construct a basis of the free binary perm algebra and find a complete…
We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…
In many applications involving binary variables, only pairwise dependence measures, such as correlations, are available. However, for multi-way tables involving more than two variables, these quantities do not uniquely determine the joint…
Given two combinatorial identities proved earlier, a new set of variations of these combinatorial identities is listed and proved with the integral representation method. Some identities from literature are shown to be special cases of…
By the Three Graces we refer, following J.-L. Loday, to the algebraic operads Ass, Com, and Lie, each generated by a single binary operation; algebras over these operads are respectively associative, commutative associative, and Lie. We…
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that…
We study (strictly) join irreducible varieties in the lattice of subvarieties of residuated lattices. We explore the connections with well-connected algebras and suitable generalizations, focusing in particular on representable varieties.…
We define wedge-lifted codes, a variant of lifted codes, and we study their locality properties. We show that (taking the trace of) wedge-lifted codes yields binary codes with the $t$-disjoint repair property ($t$-DRGP). When $t =…