相关论文: Integer Point Sets Minimizing Average Pairwise L1-…

We consider the following online allocation problem: Given a unit square S, and a sequence of numbers n_i between 0 and 1, with partial sum bounded by 1; at each step i, select a region C_i of previously unassigned area n_i in S. The…

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

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…

For two points $p$ and $q$ in the plane, a straight line $h$, called a highway, and a real $v>1$, we define the \emph{travel time} (also known as the \emph{city distance}) from $p$ and $q$ to be the time needed to traverse a quickest path…

Spatial organisation of physical form of an urban system, or city, both manifests and influences the way its social form functions. Mathematical quantification of the spatial pattern of a city is, therefore, important for understanding…

Urban form plays a crucial role in shaping transportation patterns, accessibility, energy consumption, and more. Our study examines the relationship between urban form and transportation energy use by developing a parametric model that…

We solve two related extremal-geometric questions in the $n-$dimensional space $\mathbb{R}^n_{\infty}$ equipped with the maximum metric. First, we prove that the maximum size of a right-equidistant sequence of points in…

The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…

A family $\mathcal A$ of subsets of an $n$-element set is called an eventown (resp. oddtown) if all its sets have even (resp. odd) size and all pairwise intersections have even size. Using tools from linear algebra, it was shown by…

Given a n points in two dimensional space, a Manhattan Network G is a network that connects all n points with either horizontal or vertical edges, with the property that for any two point in G should be connected by a Manhattan path and…

The confluence of recent advances in availability of geospatial information, computing power, and artificial intelligence offers new opportunities to understand how and where our cities differ or are alike. Departing from a traditional…

We investigate locally $n \times n$ grid graphs, that is, graphs in which the neighbourhood of any vertex is the Cartesian product of two complete graphs on $n$ vertices. We consider the subclass of these graphs for which each pair of…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

We characterize all permutations on even-by-even grids that maximally separate neighboring vertices. More precisely, let $n_1$, $n_2$ be positive even integers, let $I(n_1,n_2)=\{1,\dots,n_1\}\times\{1,\dots,n_2\}$ be the $n_1\times n_2$…

Neighborhood graphs are gaining popularity as a concise data representation in machine learning. However, naive graph construction by pairwise distance calculation takes $O(n^2)$ runtime for $n$ data points and this is prohibitively slow…

The map of a city's streets constitutes a particular case of spatial complex network. However a city is not limited to its topology: it is above all a geometrical object whose particularity is to organize into short and long axes called…

We consider the line planning problem in public transport in the Parametric City, an idealized model that captures typical scenarios by a (small) number of parameters. The Parametric City is rotation symmetric, but optimal line plans are…

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…

A city is not a tree but a semi-lattice. To use a perhaps more familiar term, a city is a complex network. The complex network constitutes a unique topological perspective on cities and enables us to better understand the kind of problem a…

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…