Related papers: Highly irregular separated nets
In 1998, Burago-Kleiner and McMullen independently proved the existence of separated nets in $\mathbb{R}^d$ which are not bi-Lipschitz equivalent (BL) to a lattice. A finer equivalence relation than BL is bounded displacement (BD).…
We show that there are separated nets in the Euclidean plane which are not biLipschitz equivalent to the integer lattice. The argument is based on the construction of a continuous function which is not the Jacobian of a biLipschitz map.
Are every two separated nets in the plane bilipschitz equivalent? In the late 1990s, Burago and Kleiner and, independently, McMullen resolved this beautiful question negatively. Both solutions are based on a construction of a density…
We introduce a hierachy of equivalence relations on the set of separated nets of a given Euclidean space, indexed by concave increasing functions $\phi\colon (0,\infty)\to(0,\infty)$. Two separated nets are called $\phi$-displacement…
A separated net is a set of points which is relatively dense and uniformly discrete (another name for a Delone set). We are dealing with tilings and separated nets in Euclidean spaces and with the question whether a given separated net is…
We show that any primitive substitution tiling of the plane creates a separated net which is biLipschitz to the integer lattice. Then we show that if H is a primitive Pisot substitution in an Euclidean space, for every separated net Y, that…
In Functional Analysis, certain conclusions apply to sequences, but they cannot be carried over when we consider nets. In fact, some nets, including sequences, can behave unexpectedly. In this paper we are interested in exploring the…
A class of nets in constructive (in A.A.Markov's sense) topological space for which the convergence is equivalent to convergence of all subsequences, is described. B.A.Kushner's theorem about coincidence of strong and weak constructive…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
We present a construction of non-rectifiable, repetitive Delone sets in every Euclidean space $\mathbb{R}^d$ with $d \geq 2$. We further obtain a close to optimal repetitivity function for such sets. The proof is based on the process of…
Our aim is to investigate spaces with sigma-discrete and meager dense sets, as well as selective versions of these properties. We construct numerous examples to point out the differences between these classes while answering questions of…
In this note we consider distinct distances determined by points in an integer lattice. We first consider Erdos's lower bound for the square lattice, recast in the setup of the so-called Elekes-Sharir framework \cite{ES11,GK11}, and show…
We construct examples of Delone sets of the plane (that is, discrete subsets that are uniformly separated and coarsely dense) that are repetitive (each patch of the set appears in every large-enough ball) though non-rectifiable (i.e. non…
It is shown that there exist Banach spaces $X,Y$, a $1$-net $\mathscr{N}$ of $X$ and a Lipschitz function $f:\mathscr{N}\to Y$ such that every $F:X\to Y$ that extends $f$ is not uniformly continuous.
Real world complex networks often exhibit multiplex structure, connecting entities from different aspects of physical systems such as social, transportation and biological networks. Little is known about general properties of such networks…
Networks of weakly coupled oscillators had a profound impact on our understanding of complex systems. Studies on model reconstruction from data have shown prevalent contributions from hypernetworks with triplet and higher interactions among…
For an odd integer $r>0$ and an integer $n>r$, we introduce a notion of weakly $r$-separated collections of subsets of $[n]=\{1,2,\ldots,n\}$. When $r=1$, this corresponds to the concept of weak separation introduced by Leclerc and…
Many real networks feature the property of nestedness, i.e. the neighbours of nodes with a few connections are hierarchically nested within the neighbours of nodes with more connections. Despite the abstract simplicity of this notion,…
Much of social network analysis is - implicitly or explicitly - predicated on the assumption that individuals tend to be more similar to their friends than to strangers. Thus, an observed social network provides a noisy signal about the…
A survey is given of the work on strong regularity for uniform algebras over the last thirty years, and some new results are proved, including the following. Let A be a uniform algebra on a compact space X and let E be the set of all those…