English
Related papers

Related papers: Integral distances from (two) lattice points

200 papers

First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…

Probability · Mathematics 2014-05-13 Nuno Luzia

We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains \Omega(n^{7/8}) points of P and no…

Combinatorics · Mathematics 2013-08-27 Adam Sheffer , Joshua Zahl , Frank de Zeeuw

The large spacing phase of the infinite random matrix chain, which represents the strongly coupled two-dimensional O(2) model on a random planar lattice, is explored. A class of solutions valid for large lattice spacings is constructed. It…

High Energy Physics - Theory · Physics 2009-10-30 A. Matytsin , P. Zaugg

With the help of a given distance matrix of size $n$, we construct an infinite family of distances $d_p$ (where $p \geq 2$) on the complex projective space $\mathbb{P}(\mathbb{C}^n)$ modelling the space of pure states of an $n$-level…

Mathematical Physics · Physics 2025-12-04 Tomasz Miller , Rafał Bistroń

An interesting question, known as the Gaussian moat problem, asks whether it is possible to walk to infinity on Gaussian primes with steps of bounded length. Our work examines a similar situation in the real quadratic integer ring…

Number Theory · Mathematics 2022-01-31 Bencheng Li , Steven J. Miller , Tudor Popescu , Daniel Sarnecki , Nawapan Wattanawanichkul

We study the distance on the Bruhat-Tits building of the group $\mathrm{SL}_d(\mathbb{Q}_p)$ (and its other combinatorial properties). Coding its vertices by certain matrix representatives, we introduce a way how to build formulas with…

Combinatorics · Mathematics 2019-10-15 Dominik Lachman

For d-dimensional irrational ellipsoids E with d >= 9 we show that the number of lattice points in rE is approximated by the volume of rE, as r tends to infinity, up to an error of order o(r^{d-2}). The estimate refines an earlier authors'…

Number Theory · Mathematics 2016-09-07 Vidmantas Bentkus , Friedrich Götze

This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-02-04 Abdullah Rasheed , Nidhi Dubagunta

Given two points $p,q$ in the real plane, the signed area of the rectangle with the diagonal $[pq]$ equals the square of the Minkowski distance between the points $p,q$. We prove that $N>1$ points in the Minkowski plane $\R^{1,1}$ generate…

Combinatorics · Mathematics 2013-03-18 Oliver Roche-Newton , Misha Rudnev

Let $Q$ be a finite subgraph of the integer grid $G$ in the plane, and let $T$ be a set of pairs of distinct vertices in $G$, called `terminal pairs'. Escaping a subset $X\subset T\cap Q$ from $Q$ means finding edge disjoint paths from the…

Combinatorics · Mathematics 2017-08-21 Adam S. Jobson , André E. Kézdy , Jenő Lehel

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

Combinatorics · Mathematics 2009-01-13 Jaron Treutlein

Combined with Laughlin's argument on the quantized Hall conductivity, Lieb-Schultz-Mattis argument is extended to quantum many-particle systems (including quantum spin systems) with a conserved particle number, on a periodic lattice in…

Strongly Correlated Electrons · Physics 2009-10-31 Masaki Oshikawa

The Fine interior $F(P)$ of a $d$-dimensional lattice polytope $P \subset {\Bbb R}^d$ is the set of all points $y \in P$ having integral distance at least $1$ to any integral supporting hyperplane of $P$. We call a lattice polytope…

Algebraic Geometry · Mathematics 2023-08-01 Victor V. Batyrev

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

Discrete Mathematics · Computer Science 2011-06-24 Giovanni Rossi

We study arrangements of intervals in $\mathbb{R}^2$ for which many pairs form trapezoids. We show that any set of intervals forming many trapezoids must have underlying algebraic structure, which we characterise. This leads to some…

Combinatorics · Mathematics 2020-05-20 Daniel Di Benedetto , Jozsef Solymosi , Ethan White

We investigate distribution of integral well-rounded lattices in the plane, parameterizing the set of their similarity classes by solutions of the family of Pell-type Diophantine equations of the form $x^2+Dy^2=z^2$ where $D>0$ is…

Number Theory · Mathematics 2012-08-14 Lenny Fukshansky , Glenn Henshaw , Philip Liao , Matthew Prince , Xun Sun , Samuel Whitehead

An infinite regular three-dimensional network is composed of identical resistors each of resistance joining adjacent nodes. What is the equivalent resistance between the lattice site and the lattice site, when two bonds are removed from the…

Other Condensed Matter · Physics 2009-03-25 R. S. Hijjawi , J. H. Asad , A. J. Sakaji , M. Al-sabayleh , J. M. Khalifeh

The notion of Laplace invariants is transferred to the lattices and discrete equations which are difference analogs of hyperbolic PDE's with two independent variables. The sequence of Laplace invariants satisfy the discrete analog of…

solv-int · Physics 2014-08-27 V. E. Adler , S. Ya. Startsev

The paper deals with a particular type of a projective ring plane defined over the ring of double numbers over Galois fields, R\_{\otimes}(q) \equiv GF(q) \otimes GF(q) \cong GF(q)[x]/(x(x-1)). The plane is endowed with (q^2 + q + 1)^2…

Number Theory · Mathematics 2007-10-20 Metod Saniga , Michel Planat

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

Combinatorics · Mathematics 2025-02-14 Hailong Dao , Manik Dhar , Izabella Łaba , Ben Lund
‹ Prev 1 8 9 10 Next ›