Related papers: Distributive laws in residuated binars
Following [Botur, M., Chajda, I., Hala\v{s}, R.: Are basic algebras residuated structures?, Soft Comput. 14 (2010), 251-255] we discuss the connections between left-residuated partially ordered groupoids and the so-called basic algebras,…
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…
This paper investigates the behaviour of rotating binaries. A rotation by $r$ digits to the left of a binary number $B$ exhibits in particular cases the divisibility $l\mid N_1(B)\cdot r+1$, where $l$ is the bit-length of $B$ and $N_1(B)$…
We study the possible dimension vectors of indecomposable parabolic bundles on the projective line, and use our answer to solve the problem of characterizing those collections of conjugacy classes of n by n matrices for which one can find…
We study bounded width algebras which are minimal in the sense that every proper reduct does not have bounded width. We show that minimal bounded width algebras can be arranged into a pseudovariety with one basic ternary operation. We…
We provide a compact exact representation for the distribution of the matrix elements of the Wishart-type random matrices $A^\dagger A$, for any finite number of rows and columns of $A$, without any large N approximations. In particular we…
We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits…
What are the distinct ways in which a set of predictor variables can provide information about a target variable? When does a variable provide unique information, when do variables share redundant information, and when do variables combine…
The interest in channel models in which the data is sent as an unordered set of binary strings has increased lately, due to emerging applications in DNA storage, among others. In this paper we analyze the minimal redundancy of binary codes…
In this paper, the class of quasicomplemented residuated lattices is introduced and investigated, as a subclass of residuated lattices in which any prime filter not containing any dense element is a minimal prime filter. The notion of…
This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…
We introduce the notion of a probabilistic identity of a residually finite group. We prove that a finitely generated linear group satisfies a probabilistic identity if and only if it is virtually solvable. As an application, we prove a…
A distributive lattice-ordered magma ($d\ell$-magma) $(A,\wedge,\vee,\cdot)$ is a distributive lattice with a binary operation $\cdot$ that preserves joins in both arguments, and when $\cdot$ is associative then $(A,\vee,\cdot)$ is an…
In this paper we study the dense elements and the radical of a residuated lattice, residuated lattices with lifting Boolean center, simple, local, semilocal and quasi-local residuated lattices. BL-algebras have lifting Boolean center;…
Several counterexamples in analysis show the existence of some special object with some sort of pathological behavior. We present three different examples where the pathological behavior is not an isolated exception, but it is the "typical"…
In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare…
We consider the problem of designing low-redundancy codes in settings where one must correct deletions in conjunction with substitutions or adjacent transpositions; a combination of errors that is usually observed in DNA-based data storage.…
The lattice model of the Weil representation over non-archimedean local field $F$ of odd residual characteristic has been known for decades, and is used to prove the Howe duality conjecture for unramified dual pairs when the residue…
The discrete variational identity under general bilinear forms on semi-direct sums of Lie algebras is established. The constant $\gamma$ involved in the variational identity is determined through the corresponding solution to the stationary…