Related papers: A note on sub-orthogonal lattices

In this work, we determine a sharp upper bound on the orthogonality defect of HKZ reduced bases up to dimension $3$. Using this result, we determine a general upper bound for the orthogonality defect of HKZ reduced bases of arbitrary rank.…

We give two sufficient conditions for the lattice Co(R^n,X) of relatively convex sets of n-dimensional real space R^n to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice…

We apply the notion of a full convex subcategory to a wide range of algebras including tilted, quasi-tilted, shod, weakly shod, left and right glued, laura, simply connected, strongly simply connected, left supported, and cluster-tilted. In…

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…

We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…

A net $(x_\alpha)$ in a vector lattice $X$ is said to be {unbounded order convergent} (or uo-convergent, for short) to $x\in X$ if the net $(\abs{x_\alpha-x}\wedge y)$ converges to 0 in order for all $y\in X_+$. In this paper, we study…

We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…

In this paper we begin to study the subalgebra lattice of a Leibniz algebra. In particular, we deal with Leibniz algebras whose subalgebra lattice is modular, upper semi-modular, lower semi-modular, distributive, or dually atomistic. The…

A class of generalized conditional gradient algorithms for the solution of optimization problem in spaces of Radon measures is presented. The method iteratively inserts additional Dirac-delta functions and optimizes the corresponding…

Given a lattice $\Lambda \subset \mathbb C\simeq \mathbb R^2$ with associated Weierstrass function $\wp_{\Lambda}$, we determine the algebraic curves in $\mathbb R^2$ whose image via $\wp_{\Lambda}$ is contained in an algebraic curve.

We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits…

We study a harmonic triangular lattice, which relaxes in the presence of a weak, short-wavelength periodic potential. Monte Carlo simulations reveal that the elastic lattice has only short-ranged positional correlations, despite the absence…

We consider scalar lattice differential equations posed on square lattices in two space dimensions. Under certain natural conditions we show that wave-like solutions exist when obstacles (characterized by "holes") are present in the…

We continue our investigation of paraorthomodular BZ*-lattices (PBZ*-lattices), started in \cite{GLP1+,PBZ2,rgcmfp,pbzsums,pbz5}. We shed further light on the structure of the subvariety lattice of the variety $\mathbb{PBZL}^{\ast }$ of…

Let $M$ be an $n$-dimensional Lagrangian submanifold of a complex space form. We prove a pointwise inequality $$\delta(n_1,\ldots,n_k) \leq a(n,k,n_1,\ldots,n_k) \|H\|^2 + b(n,k,n_1,\ldots,n_k)c,$$ with on the left hand side any…

We prove that of all two-dimensional lattices of covolume 1 the hexagonal lattice has asymptotically the fewest distances. An analogous result for dimensions 3 to 8 was proved in 1991 by Conway and Sloane. Moreover, we give a survey of some…

IIn a finite lattice, a congruence spreads from a prime interval to another by a sequence of congruence-perspectivities through \emph{intervals of arbitrary size}, by a 1955 result of J. Jakub\'ik. In this note, I introduce the concept of…

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $o = u_l…

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…

Let $W(z_1, \cdots, z_n): (\mathbb{C}^*)^n \to \mathbb{C}$ be a Laurent polynomial in $n$ variables, and let $\mathcal{H}$ be a generic smooth fiber of $W$. In \cite{RSTZ} Ruddat-Sibilla-Treumann-Zaslow give a combinatorial recipe for a…