Related papers: A Note on Projecting the Cubic Lattice
It is well known that the orbit of a lattice in hyperbolic $n$-space is uniformly distributed when projected radially onto the unit sphere. In the present work, we consider the fine-scale statistics of the projected lattice points, and…
Solutions of a variational inequality are found by giving conditions for the monotone convergence with respect to a cone of the Picard iteration corresponding to its natural map. One of these conditions is the isotonicity of the projection…
We discuss the calculation of the leading hadronic vacuum polarization in lattice QCD. Exploiting the excellent quality of the compiled experimental data for the e^+e^- --> hadrons cross-section, we predict the outcome of large-volume…
In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
A partial lattice P is ideal-projective, with respect to a class C of lattices, if for every K $\in$ C and every homomorphism $\phi$ of partial lattices from P to the ideal lattice of K, there are arbitrarily large choice functions f : P…
A lattice point $\vec x=(x_1,\dots,x_n)\in\mathbb Z^{n}$ is said to be visible if the line segment between $\vec x$ and the origin contains no other lattice point. In this paper, we compute the asymptotic density of visible lattice points…
We report two probes of centre vortices in pure SU(2). First, we attempt to generate plaquette-size Z(2) vortices in a quasi-random way to compare the structure with those of projected centre vortices from the full theory; our prescription…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
Fix an positive integer $n$. Let $K\subseteq\mathbb{R}^n$ be a compact set such that $K+\mathbb{Z}^n=\mathbb{R}^n$. We prove, via Algebraic Topology, that the integer points of the difference set of $K$, $(K-K)\cap\mathbb{Z}^n$, is not…
Two polygons are amicable if the perimeter of one is equal to the area of the other and vice versa. A polygon is a lattice polygon if its vertices are on the integer lattice $\Z^2$. We show that there is one pair of amicable lattice…
We discuss the hard-hexagon and hard-square problems, as well as the corresponding problem on the honeycomb lattice. The case when the activity is unity is of interest to combinatorialists, being the problem of counting binary matrices with…
Linnik type problems concern the distribution of projections of integral points on the unit sphere as their norm increases, and different generalizations of this phenomenon. Our work addresses a question of this type: we prove the uniform…
We study the projectivity of the free Banach lattice generated by a lattice $\mathbb{L}$ in two cases: when the lattice is finite, and when the lattice is an infinite linearly ordered set. We prove that in the first case it is projective…
Let $L$ be a lattice of full rank in $n$-dimensional real space. A vector in $L$ is called $i$-sparse if it has no more than $i$ nonzero coordinates. We define the $i$-th successive sparsity level of $L$, $s_i(L)$, to be the minimal $s$ so…
The Nontrivial Projection Problem asks whether every finite-dimensional normed space of dimension greater than one admits a well-bounded projection of non-trivial rank and corank or, equivalently, whether every centrally symmetric convex…
Gardner, Gronchi and Zong posed the problem to find a discrete analogue of M. Meyer's inequality bounding the volume of a convex body from below by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated…
We study the properties of a set of vectors called tight frames that obtained as the orthogonal projection of some orthonormal basis of $\R^n$ onto $\R^k.$ We show that a set of vectors is a tight frame if and only if the set of all cross…
We prove that in any dimension $n$ there exists an origin-symmetric ellipsoid ${\mathcal{E}} \subset {\mathbb{R}}^n$ of volume $ c n^2 $ that contains no points of ${\mathbb{Z}}^n$ other than the origin, where $c > 0$ is a universal…
Let $P$ be a poset of size $2^k$ that has a greatest and a least element. We prove that, for sufficiently large $n$, the Boolean lattice $2^{[n]}$ can be partitioned into copies of $P$. This resolves a conjecture of Lonc.