Related papers: Cartesian lattice counting by the vertical 2-sum
The sets of all neutral, distributive and lower-modular elements of the lattice of semigroup varieties are finite, countably infinite and uncountably infinite, respectively. In 2018, we established that there are precisely three neutral…
We investigate a Hamiltonian lattice version of the two-dimensional Wess-Zumino model, with special emphasis to the pattern of supersymmetry breaking. Results are obtained by Quantum Monte Carlo simulations and Density Matrix…
By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…
In 2012, the second author introduced and examined a new type of algebras as a generalization of De Morgan algebras. These algebras are of type (2,0) with one binary and one nullary operation satisfying two certain specific identities. Such…
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…
In 2002 Thakare et al.\ counted non-isomorphic lattices on $n$ elements, having nullity up to two. In 2020 Bhavale and Waphare introduced the concept of RC-lattices as the class of all lattices in which all the reducible elements are…
In this paper, we count all non-isomorphic lattices on $n$ elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on…
In general it is a difficult problem to construct the lattice of submodules $L(M)$ of a given module $M$. In \cite{St} R. P. Stanley outlined a method for constucting a distributive lattice from a knowledge of its join irreducibles. However…
A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…
We examine the lattice generated by two pairs of supplementary vector subspaces of a finite-dimensional vector space by intersection and sum, with the aim of applying the results to the study of representations admitting two pairs of…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…
For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
We investigate an integrable property and observables of 2 dimensional N=(4,4) topological field theory defined on a discrete lattice by using the "orbifolding" and "deconstruction" methods. We show that our lattice model possesses the…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
We study the existence of cocompact lattices in Lie groups with bi-invariant metric of signature $(2,n-2)$. We assume in addition that the Lie groups under consideration are simply-connected, indecomposable and solvable. Then their centre…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…
Let $L$ be a finite $n$-element lattice. We prove that if $L$ has at least $83\cdot 2^{n-8}$ sublattices, then $L$ is planar. For $n>8$, this result is sharp since there is a non-planar lattice with exactly $83\cdot 2^{n-8}-1$ sublattices.