Related papers: Lattices from Codes for Harnessing Interference: A…
Disjointness, bands, and band projections are a classical and essential part of the structure theory of vector lattices. If $X$ is such a lattice, those notions seem - at first glance - intimately related to the lattice operations on $X$.…
The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept…
This article explores the limits of geometric construction using various tools, both classical and modern. Starting with ruler and compass constructions, we examine how adding methods such as origami, marked rulers (neusis), conic sections,…
The projective space $\mathbb{P}_q(n)$, i.e. the set of all subspaces of the vector space $\mathbb{F}_q^n$, is a metric space endowed with the subspace distance metric. Braun, Etzion and Vardy argued that codes in a projective space are…
Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes…
Semi-entwining structures are proposed as concepts simpler than entwining structures, yet they are shown to have interesting applications in constructing intertwining operators and braided algebras, lifting functors, finding solutions for…
Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been…
Realistic 3D-conformations of protein structures can be embedded in a cubic lattice using exclusively integer numbers, additions, subtractions and boolean operations.
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
Lattices defined as modules over algebraic rings or orders have garnered interest recently, particularly in the fields of cryptography and coding theory. Whilst there exist many attempts to generalise the conditions for LLL reduction to…
It is shown that operations of equivalence cannot serve for building algebras which would induce orthomodular lattices as the operations of implication can. Several properties of equivalence operations have been investigated. Distributivity…
Constant dimension codes are used for error control in random linear network coding, so that constructions for these codes with large cardinality have achieved wide attention in the last decade. Here, we improve the so-called linkage…
The problem of designing physical-layer network coding (PNC) schemes via nested lattices is considered. Building on the compute-and-forward (C&F) relaying strategy of Nazer and Gastpar, who demonstrated its asymptotic gain using…
Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two…
The Galois lattice is a graphic method of representing knowledge structures. The first basic purpose in this paper is to introduce a new class of Galois lattices, called graded Galois lattices. As a direct result, one can obtain the notion…
In this paper we address what generalized geometric structures are possible on products of spaces that each admit generalized geometries. In particular we consider, first, the product of two odd dimensional spaces that each admit a…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
The present work involves the discrete modelling of corrosion induced cracking and its influence on the bond between reinforcement and concrete. A lattice approach is used to describe the mechanical interaction of a corroding reinforcement…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…
We restate a process presented by Stanley as a technique to prove that there exists exactly one $d$-differential distributive lattice for any positive integer $d$. This process can be trivially extended to apply to distributive finitary…