Related papers: Lattice decompositions through methods using congr…
The process of decomposing databases into smaller datasets, with the objective of extrapolating the information obtained in the smaller ones to the original database, represents a relevant and complex challenge in real applications. It is…
We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the…
A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for lattices that are simple, efficient, and nearly optimal in terms…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
This paper investigates the structure-property relations of thin-walled lattices under dynamic longitudinal compression, characterized by their cross-sections and heights. These relations elucidate the interactions of different geometric…
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to…
The central idea of this article is to present a systematic approach to construct some recurrence relations for the solutions of the second-order linear difference equation of hypergeometric-type defined on the quadratic-type lattices. We…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
The paper investigates localized deformation patterns resulting from the onset of instabilities in lattice structures. The study is motivated by previous observations on discrete hexagonal lattices, where the onset of non-uniform,…
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…
The correlation function of the two dimensional Ising model with the nearest neighbours interaction on the finite size lattice with the periodical boundary conditions is derived. The expressions similar to the form factor expansion are…
A five-dimensional lattice space can be decomposed into a number of four-dimens ional lattices called as layers. The five-dimensional gauge theory on the lattice can be interpreted as four-dimensional gauge theories on the multi-layer with…
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
A typical approach to the joint analysis of multiple high-dimensional data views is to decompose each view's data matrix into three parts: a low-rank common-source matrix generated by common latent factors of all data views, a low-rank…
This paper explores applications of the so-called Freese's technique, a classical approach to study the congruence variety of a given algebra. We leverage this tool to investigate lattices that are admissible as congruence sublattice of a…
There is increasing focus on analyzing data represented as hypergraphs, which are better able to express complex relationships amongst entities than are graphs. Much of the critical information about hypergraph structure is available only…
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by a convex rank-reducing term similar to the trace norm. In…