Related papers: On Perfection Relations in Lattices
Let E be a Dedekind complete Riesz space with weak unit e, equipped with a conditional expectation operator T. We prove that the spaces Lp(T), with their natural vector-valued norms, are strongly complete, extending the p=2 case of Kuo,…
In this work we investigate the transfer of fundamental order and completeness properties between truncated Riesz spaces and their unitizations. Specifically, we provide characterizations and equivalences for several notions of…
An orthogonality space is a set equipped with a symmetric and irreflexive binary relation. We consider orthogonality spaces with the additional property that any collection of mutually orthogonal elements gives rise to the structure of a…
We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…
As an application of perfect lattice perturbation theory, we construct an O(\lambda) perfect lattice action for the anharmonic oscillator analytically in momentum space. In coordinate space we obtain a set of 2-spin and 4-spin couplings…
The main results of the paper points out the connection between the weak ordered relations and factor lattices defined by tolerances. It is proved that for any tolerance $T$ of a lattice $L$ the Dedekind-Mac Neille completion of $L/T$ is…
Let R be a von Neumann algebra acting on a Hilbert space H and let R_sa be the set of selfadjoint elements of R. It is well known that R_sa is a lattice with respect to the usual partial order ≤ if and only if R is abelian. We define…
Representing lattices L by equivalence relations amounts to embed them into the lattice Part(V) of all partitions of a set V, and has a long history. Here we are concerned with MODULAR lattices L and aim for sets V as small as possible,…
From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic framework, we give analytic proof of Heath theorem from Database Dependency theory. Next, we leverage…
Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice IdS of S is both algebraic and dually algebraic.…
We generalise M. M. Skriganov's notion of weak admissibility for lattices to include standard lattices occurring in Diophantine approximation and algebraic number theory, and we prove estimates for the number of lattice points in sets such…
We investigate lattice energies for radially symmetric, spatially extended particles interacting via a radial potential and arranged on the sites of a two-dimensional Bravais lattice. We show the global minimality of the triangular lattice…
We introduce and study the notion of orthosymmetric spaces over an Archimedean vector lattice as a generalization of finite-dimentional Euclidean inner spaces. A special attention has been paid to linear operators on these spaces.
We study the usual notion of Scott rank but in the setting of Polish metric spaces. The signature consists of distance relations: for each rational $q > 0$, there is a relation $R_{<q}(x,y)$ stating that the distance of $x$ and $y $ is less…
A lattice $(d,k)$-polytope is the convex hull of a set of points in $\mathbb{R}^d$ whose coordinates are integers ranging between $0$ and $k$. We consider the smallest possible distance $\varepsilon(d,k)$ between two disjoint lattice…
The maximal index of a Euclidean lattice L of dimension n is the maximal index of the sub-lattices of L spanned by n independent minimal vectors of L. In this paper, we prove that a perfect lattice of maximal index two not provided by a…
This paper investigates a novel connection between reductions of companion matrices associated with a symmetric family of certain binomial ideals in the coordinate ring of affine n-space and permutation matrices. Specifically, for fixed…
Many lattice-based crypstosystems employ ideal lattices for high efficiency. However, the additional algebraic structure of ideal lattices usually makes us worry about the security, and it is widely believed that the algebraic structure…
We present a novel approach for data set scaling based on scale-measures from formal concept analysis, i.e., continuous maps between closure systems, and derive a canonical representation. Moreover, we prove said scale-measures are lattice…
We define a notion of {\it positive part} of a lattice $\Lambda$ and we endow the set of such positive parts with a topology. We then study some properties of this topology, by comparing it with the one of $V^*/\RM_{> 0}$, where $V^*$ is…