Related papers: Pi Visits Manhattan
Digital circles not only play an important role in various technological settings, but also provide a lively playground for more fundamental number-theoretical questions. In this paper, we present a new recursive algorithm for the…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
In the randomly-oriented Manhattan lattice, every line in $\mathbb{Z}^d$ is assigned a uniform random direction. We consider the directed graph whose vertex set is $\mathbb{Z}^d$ and whose edges connect nearest neighbours, but only in the…
If one places N cities on a continuum in an unit area, extensive numerical results and their analysis (scaling, etc.) suggest that the best normalized optimal travel distance becomes 0.72 for the Euclidean metric and 0.92 for the Manhattan…
Models of discrete space and space-time that exhibit continuum-like behavior at large lengths could have profound implications for physics. They may tame the infinities that arise from quantizing gravity, and dispense with the machinery of…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
Consider the Quadratic Assignment Problem (QAP): given two matrices A and D, minimize {trace AXDX^T: X is a permutation matrix}. New lower bounds were obtained recently (Mittelmann and peng [8]) for the QAP where D is either the Manhattan…
In most studies, street networks are considered as undirected graphs while one-way streets and their effect on shortest paths are usually ignored. Here, we first study the empirical effect of one-way streets in about $140$ cities in the…
We consider a network model, embedded on the Manhattan lattice, of a quantum localisation problem belonging to symmetry class C. This arises in the context of quasiparticle dynamics in disordered spin-singlet superconductors which are…
A staircase is the set of points in Z^2 below a given rational line in the plane that have Manhattan Distance less than 1 to the line. Staircases are closely related to Beatty and Sturmian sequences of rational numbers. Connecting the…
Understanding distance metrics in high-dimensional spaces is crucial for various fields such as data analysis, machine learning, and optimization. The Manhattan distance, a fundamental metric in multi-dimensional settings, measures the…
The purpose of this letter is to define a distance on the underlying phase space of a chaotic map, based on natural invariant density of the map. It is observed that for logistic map this distance is equivalent to Wootters' statistical…
The iterated composition of two operators, both of which are involutions and translation invariant, partitions the set of lattice points in the plane into an infinite sequence of discrete parabolas. Each such parabola contains an associated…
A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…
We construct a set of $2^n$ points in $\mathbb{R}^n$ such that all pairwise Manhattan distances are odd integers, which improves the recent linear lower bound of Golovanov, Kupavskii and Sagdeev. In contrast to the Euclidean and maximum…
This paper introduces Manhattan sampling in two and higher dimensions, and proves sampling theorems. In two dimensions, Manhattan sampling, which takes samples densely along a Manhattan grid of lines, can be viewed as sampling on the union…
We consider the periodic Manhattan lattice with alternating orientations going north-south and east-west. Place obstructions on vertices independently with probability $0<p<1$. A particle is moving on the edges with unit speed following the…
Building on the results of our previous work on Euclidean leaper tours, considering all integers $k>1$ and $h>0$, we study the existence of Hamiltonian cycles in the vertex set $C(2,k):=\{0,1\}^k$ of the $k$-dimensional hypercube when the…
The cognitive framework of conceptual spaces [3] provides geometric means for representing knowledge. A conceptual space is a high-dimensional space whose dimensions are partitioned into so-called domains. Within each domain, the Euclidean…
Circuity, the ratio of network distances to straight-line distances, is an important measure of urban street network structure and transportation efficiency. Circuity results from a circulation network's configuration, planning, and…