Related papers: Distributive laws in residuated binars
Residuated lattices play an important role in the study of fuzzy logic based of t-norm. In this paper, we introduced the notions of n-fold implicative filters, n-fold positive implicative filters, n-fold boolean filters, n-fold fantastic…
Separable Bayesian Networks, or the Influence Model, are dynamic Bayesian Networks in which the conditional probability distribution can be separated into a function of only the marginal distribution of a node's neighbors, instead of the…
The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…
Let $k$ be a number field and $O$ the ring of integers. In the previous paper [T06] we study the Dirichlet series counting discriminants of cubic algebras of $O$ and derive some density theorems on distributions of the discriminants by…
Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…
For EBSD ab-initio indexing, a new method that adopts several methods originally invented for powder indexing, is reported. Distribution rules of systematic absence and error-stable Bravais lattice determination are used to eliminate…
A distributive lattice $L$ with minimum element $0$ is called decomposable lattice if $a$ and $b$ are not comparable elements in $L$ there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
We completely determine all distributive, codistributive, standard, costandard, and neutral elements in the lattice of overcommutative semigroup varieties, thus correcting a gap contained in an earlier article by the second author.
We prove identities generating higher dimensional vector partitions. We derive theorems for integer lattice points in the 2D first quadrant, then generalize the approach to find 3D and $n$-space lattice point vector region extensions. We…
Finite-dimensional Reedy algebras form a ring-theoretic analogue of Reedy categories and were recently proved to be quasi-hereditary. We identify Reedy algebras with quasi-hereditary algebras admitting a triangular (or…
In this paper we confirm three conjectures of Z.-W. Sun on determinants. We first show that any odd integer $n>3$ divides the determinant $$\left|(i^2+dj^2)\left(\frac{i^2+dj^2}n\right)\right|_{0\le i,j\le (n-1)/2},$$ where $d$ is any…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
We show that the variety of residuated lattices does not have the amalgamation property, thereby settling a long-standing open problem. In addition, we show that the amalgamation property fails for several subvarieties, including idempotent…
In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
Given only observational data $X = g(Z)$, where both the latent variables $Z$ and the generating process $g$ are unknown, recovering $Z$ is ill-posed without additional assumptions. Existing methods often assume linearity or rely on…
In this paper, we study the distribution of multiplicatively dependent vectors. For example, although they have zero Lebesgue measure, they are everywhere dense both in $\mathbb{R}^n$ and $\mathbb{C}^n$. We also study this property in a…
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary…
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…