Related papers: Factorizing Lattices by Interval Relations
Following our previous proposal [1], we construct a class of good "lattice cross sections" (LCSs), from which we could study partonic structure of hadrons from ab initio lattice QCD calculations. These good LCSs, on the one hand, can be…
This article investigates atomic decompositions in geometric lattices isomorphic to the partition lattice $\Pi(X)$ of a finite set $X$, a fundamental structure in lattice theory and combinatorics. We explore the role of atomicity in these…
We study Euclidean lattice formulations of non-gauge supersymmetric models with up to four supercharges in various dimensions. We formulate the conditions under which the interacting lattice theory can exactly preserve one or more nilpotent…
In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into…
In this review, we count and classify certain sublattices of a given lattice, as motivated by crystallography. We use methods from algebra and algebraic number theory to find and enumerate the sublattices according to their index. In…
This paper introduces a novel framework for constructing algebraic lattices based on Construction-D, leveraging nested linear codes and prime ideals from algebraic number fields. We focus on the application of these lattices in block-fading…
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…
We construct a one-parameter family of lattice models starting from a two-dimensional rational conformal field theory on a torus with a regular lattice of holes, each of which is equipped with a conformal boundary condition. The lattice…
We study the class of finite lattices that are isomorphic to the congruence lattices of algebras from a given finitely generated congruence-distributive variety. If this class is as large as allowed by an obvious necessary condition, the…
Recently, convex formulations of low-rank matrix factorization problems have received considerable attention in machine learning. However, such formulations often require solving for a matrix of the size of the data matrix, making it…
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…
This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…
Computing conceptual structures, like formal concept lattices, is in the age of massive data sets a challenging task. There are various approaches to deal with this, e.g., random sampling, parallelization, or attribute extraction. A so far…
This paper treats certain integral lattices with respect to ternary quadratic forms, which are obtained from the data of a non-zero element and a maximal lattice in a quaternary quadratic space. Such a lattice can be described by means of…
Lattice field theory is a non-perturbative tool for studying properties of strongly interacting field theories, which is particularly amenable to numerical calculations and has quantifiable systematic errors. In these lectures we apply…
This paper presents a framework designed to tackle a range of planning problems arise in manipulation, which typically involve complex geometric-physical reasoning related to contact and dynamic constraints. We introduce the Contact Factor…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
Diffusion on a T fractal lattice under the influence of topological biasing fields is studied by finite size scaling methods. This allows to avoid proliferation and singularities which would arise in a renormalization group approach on…
Contact interactions can be used to describe a system of particles at unitarity, contribute to the leading part of nuclear interactions and are numerically non-trivial because they require a proper regularization and renormalization scheme.…
We study a recently introduced formulation for fluid-structure interaction problems which makes use of a distributed Lagrange multiplier in the spirit of the fictitious domain method. The time discretization of the problem leads to a mixed…