English
Related papers

Related papers: Lattice points close to a helix

200 papers

We present a new, explicit and very geometric construction for the iterated clique graphs of the hexagonal lattice $\mathrm{Hex}$ which makes apparent its clique-divergence and sheds light on some previous observations, such as the…

Combinatorics · Mathematics 2023-07-24 Martin Winter

We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…

Computational Geometry · Computer Science 2018-10-26 Ery Arias-Castro , Thibaut Le Gouic

We seek for lines of minimal distance to finitely many points in the plane. The distance between a line and a set of points is defined by the L^p-norm, 1\leq p\leq \infty, of the vector of vertical or orthogonal distances from the single…

Optimization and Control · Mathematics 2011-09-21 Annett Puettmann

We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method…

Information Theory · Computer Science 2013-07-25 Olav Geil , Stefano Martin

We examine the bound state(s) associated with a single cubic nonlinear impurity, in a one-dimensional tight-binding lattice, where hopping to first--and--second nearest neighbors is allowed. The model is solved in closed form {\em v\`{\i}a}…

Disordered Systems and Neural Networks · Physics 2009-11-07 M. I. Molina

The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…

Metric Geometry · Mathematics 2007-05-23 Martin Henk

We study two simple modifications of self-avoiding polygons. Osculating polygons are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons are only allowed to have nearest neighbour…

Statistical Mechanics · Physics 2009-11-07 Iwan Jensen

We prove sharp upper bounds on the volume and the number of lattice points on edges of higher-dimensional reflexive simplices. These convex-geometric results are derived from new number-theoretic bounds on the denominators of unit fractions…

Algebraic Geometry · Mathematics 2007-05-23 Benjamin Nill

We show that finite lattices with arbitrary boundaries may support large degenerate subspaces, stemming from the underlying translational symmetry of the lattice. When the lattice is coupled to an environment, a potentially large number of…

Mesoscale and Nanoscale Physics · Physics 2020-06-08 Jordi Mur-Petit , Rafael A. Molina

Consider the energy per particle on the lattice given by $\min_{ \Lambda }\sum_{ \mathbb{P}\in \Lambda} \left|\mathbb{P}\right|^4 e^{-\pi \alpha \left|\mathbb{P}\right|^2 }$, where $\alpha >0$ and $\Lambda$ is a two dimensional lattice. We…

Analysis of PDEs · Mathematics 2024-11-27 Kaixin Deng , Senping Luo

We classify the metric spaces that can be approximated by finite homogeneous ones.

Group Theory · Mathematics 2013-03-21 Tsachik Gelander

We obtain a lower bound of the distance function (MOID) between two noncoplanar bounded Keplerian orbits (either circular or elliptic) with a common focus. This lower bound is positive and vanishes if and only if the orbits intersect. It is…

Earth and Planetary Astrophysics · Physics 2019-06-17 Denis Mikryukov , Roman Baluev

We construct a three-dimensional lattice model for biological gels in which straight lines of bonds correspond to filamentous semi-flexible polymers and lattice sites, which are exactly four-fold coordinated, to crosslinks. With only…

Soft Condensed Matter · Physics 2011-08-23 Olaf Stenull , T. C. Lubensky

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

Combinatorics · Mathematics 2011-11-10 W. M. B. Dukes

This note presents some new information on how the minimum distance of the generalized toric code corresponding to a fixed set of integer lattice points S in R^2 varies with the base field. The main results show that in some cases, over…

Information Theory · Computer Science 2011-09-14 John B. Little

In a spherically complete ultrametric space, a strictly contracting mapping has a fixed point. We indicate in this paper how this fixed point can either be reached or approximated.

Metric Geometry · Mathematics 2013-07-25 Sibylla Priess-Crampe , Paulo Ribenboim

The full lattice convergence on a locally solid Riesz space is an abstraction of the topological, order, and relatively uniform convergences. We investigate four modifications of a full convergence $\mathbb{c}$ on a Riesz space. The first…

Functional Analysis · Mathematics 2020-11-30 Abdullah Aydın , Eduard Emelyanov , Svetlana Gorokhova

We consider spread-out models of lattice trees and lattice animals on $\mathbb Z^d$, for $d$ above the upper critical dimension $d_{\mathrm c}=8$. We define a correlation length and prove that it diverges as $(p_c-p)^{-1/4}$ at the critical…

Probability · Mathematics 2025-04-21 Yucheng Liu , Gordon Slade

The species doubling problem of the lattice fermion is resolved by introducing hopping interactions that mix left- and right-handed fermions around the momentum boundary. Approximate chiral symmetry is realized on the lattice. The deviation…

High Energy Physics - Lattice · Physics 2009-11-10 Takanori Sugihara

PhD Thesis--A compilation of the papers: "Lower Bounds for Identifying Codes in Some Infinite Grids", "Improved Bounds for r-identifying Codes of the Hex Grid", and "Vertex Identifying Codes for the n-dimensional Lattics" along with some…

Combinatorics · Mathematics 2011-02-15 Brendon Stanton