Related papers: A lower bound for the dispersion on the torus
We extend an energy introduced by Mather to the setting of Almgren-Pitts min-max theory and obtain a parametric, higher-dimensional analogue of Mather's variational barrier theory for twist maps and geodesics on tori. We use this energy to…
A set of $N$ points is chosen randomly in a $D$-dimensional volume $V=a^D$, with periodic boundary conditions. For each point $i$, its distance $d_i$ is found to its nearest neighbour. Then, the maximal value is found, $d_{max}=max(d_i,…
We consider percolation on $\mathbb{Z}^d$ and on the $d$-dimensional discrete torus, in dimensions $d \ge 11$ for the nearest-neighbour model and in dimensions $d>6$ for spread-out models. For $\mathbb{Z}^d$, we employ a wide range of…
In this paper we give a geometric argument for bounding the diameter of a connected compact surface (with boundary) of arbitrary codimension in Euclidean space in terms of Topping's diameter bound for closed surfaces (without boundary). The…
We improve the bound on the number of tetrahedra in the veering triangulation of a fully-punctured pseudo-Anosov mapping torus in terms of the normalized dilatation. When the mapping torus has only one boundary component, we can improve the…
We consider the problem of partitioning a two-dimensional flat torus $T^2$ into $m$ sets in order to minimize the maximal diameter of a part. For $m \leqslant 25$ we give numerical estimates for the maximal diameter $d_m(T^2)$ at which the…
We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…
We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…
Let $p_1,\ldots,p_n$ be a set of points in the unit square and let $T_1,\ldots,T_n$ be a set of $\delta$-tubes such that $T_j$ passes through $p_j$. We prove a lower bound for the number of incidences between the points and tubes under a…
We present a quantitative version of Bilu's theorem on the limit distribution of Galois orbits of sequences of points of small height in the $N$-dimensional algebraic torus. Our result gives, for a given point, an explicit bound for the…
Dorais asked for the maximum guaranteed size of a dimension $d$ subposet of an $n$-element poset. A lower bound of order $\sqrt{n}$ was found by Goodwillie. We provide a sublinear upper bound for each $d$. For $d=2$, our bound is…
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…
We consider random interlacements on $ \mathbb{Z}^d$, $d \ge 3$, when their vacant set is in a strongly percolative regime. Given a large box centered at the origin, we establish an asymptotic upper bound on the exponential rate of decay of…
We consider the typical Poisson-Voronoi cell in the Euclidean space R d and in particular the maximal distance D from a vertex of that cell to its nucleus. We provide a sharp asymptotics for the tail distribution of D. As a byproduct, we…
We prove reducibility of a transport equation on the $d$-dimensional torus $T^d$ with a time quasi-periodic unbounded perturbation. As far as we know this is the first example of a reducibility result for an equation in more than one…
A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…
We calculate the almost sure Hausdorff dimension of the random covering set $\limsup_{n\to\infty}(g_n + \xi_n)$ in $d$-dimensional torus $\mathbb T^d$, where the sets $g_n\subset\mathbb T^d$ are parallelepipeds, or more generally, linear…
We study the scaling limit of essentially simple triangulations on the torus. We consider, for every $n\geq 1$, a uniformly random triangulation $G_n$ over the set of (appropriately rooted) essentially simple triangulations on the torus…
Let $T$ be a $d\times d$ matrix with real coefficients. Then $T$ determines a self-map of the $d$-dimensional torus ${\Bbb T}^d={\mathbb{R}}^d/{\Bbb Z}^d$. Let $ \{E_n \}_{n \in \mathbb{N}} $ be a sequence of subsets of ${\Bbb T}^d$ and let…
In response to the Numberphile video regarding the Mondrian Puzzle https://www.youtube.com/watch?v=49KvZrioFB0, we provide a lower bound on how many integers less than a given threshold $x$ satisfy $M(n) \neq 0$ where $M(n)$ is the quantity…