English
Related papers

Related papers: A lower bound for the dispersion on the torus

200 papers

In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…

Number Theory · Mathematics 2013-08-26 Christoph Aistleitner , Josef Dick

An axis-parallel $d$-dimensional box is a cartesian product $I_1\times I_2\times \dots \times I_b$ where $I_i$ is a closed sub-interval of the real line. For a graph $G = (V,E)$, the $boxicity \ of \ G$, denoted by $\text{box}(G)$, is the…

Combinatorics · Mathematics 2021-05-07 Marco Caoduro , Lyuben Lichev

We consider two-species exclusion processes on the d-dimensional discrete torus taking the effects of exchange, creation and annihilation into account. The model is, in general, of nongradient type. We prove that the (charged) particle…

Probability · Mathematics 2026-04-15 Makiko Sasada

Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C…

Probability · Mathematics 2014-04-09 Demeter Kiss

For arbitrary two probability measures on real d-space with given means and variances (covariance matrices), we provide lower bounds for their total variation distance. In the one-dimensional case, a tight bound is given.

Probability · Mathematics 2022-12-27 Tomohiro Nishiyama

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

Probability · Mathematics 2026-04-15 Dongbin Li , Alexander E. Litvak , Tingzhou Yu

In this note, we attempt to find counterexamples to the conjecture that the ideal form of a knot, that which minimizes its contour length while respecting a no-overlap constraint, also minimizes the volume of the knot, as determined by its…

Geometric Topology · Mathematics 2021-11-17 Alexander R. Klotz

This paper is concerned with the optimal upper bound on mean quantities (torque, dissipation and the Nusselt number) obtained in the framework of the background method for the Taylor--Couette flow with a stationary outer cylinder. Along the…

Fluid Dynamics · Physics 2022-01-19 Anuj Kumar

Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points of $P$ in $O(nk^2 \log n+ n\log^2 n)$ time. We also consider the problem of, given…

Computational Geometry · Computer Science 2019-07-12 Mark de Berg , Sergio Cabello , Otfried Cheong , David Eppstein , Christian Knauer

Let X be a closed manifold of dimension 2m >= 6 with torsion-free middle-dimensional homology. We construct metrics on X of arbitrarily small volume, such that every middle-dimensional submanifold of less than unit volume necessarily…

dg-ga · Mathematics 2008-02-03 Ivan K. Babenko , Mikhail G. Katz , Alexander I. Suciu

We study the volume ratio between projections of two convex bodies. Given a high-dimensional convex body $K$ we show that there is another convex body $L$ such that the volume ratio between any two projections of fixed rank of the bodies…

Metric Geometry · Mathematics 2022-11-14 Daniel Galicer , Alexander E. Litvak , Mariano Merzbacher , Damián Pinasco

Let $P$ be a set of $n$ points in the plane in general position. We show that at least $\lfloor n/3\rfloor$ plane spanning trees can be packed into the complete geometric graph on $P$. This improves the previous best known lower bound…

Computational Geometry · Computer Science 2019-02-26 Ahmad Biniaz , Alfredo García

Given a set $P$ of $n$ points on $\mathbb R^{2}$, we address the problem of computing an axis-parallel empty rectangular annulus $A$ of maximum-width such that no point of $P$ lies inside $A$ but all points of $P$ must lie inside, outside…

Computational Geometry · Computer Science 2017-12-04 Arpita Baral , Abhilash Gondane , Sanjib Sadhu , Priya Ranjan Sinha Mahapatra

We study the number of intersections of the nodal lines of an eigenfunction of the Laplacian on the standard torus with a fixed reference curve, that is, the number of zeros of the eigenfunction restricted to the curve. An upper bound is…

Analysis of PDEs · Mathematics 2014-02-05 Jean Bourgain , Zeev Rudnick

In this paper we study the following geometric problem: given $2^n-1$ real numbers $x_A$ indexed by the non-empty subsets $A\subset \{1,..,n\}$, is it possible to construct a body $T\subset \mathbb{R}^n$ such that $x_A=|T_A|$ where $|T_A|$…

Combinatorics · Mathematics 2019-10-29 Imre Leader , Žarko Ranđelović , Eero Räty

It is well known that a pair of compact sets in $\mathbb{R}^d$ ($d \in \mathbb{N}$) can be separated by small deformations if the sum of their upper box dimensions is less than $d$. In this paper, we demonstrate that this dimension…

Dynamical Systems · Mathematics 2026-04-21 Meysam Nassiri , Mojtaba Zareh Bidaki

In every dimension $d\ge1$, we establish the existence of a constant $v_d>0$ and of a subset $\mathcal U_d$ of $\mathbb R^d$ such that the following holds: $\mathcal C+\mathcal U_d=\mathbb R^d$ for every convex set $\mathcal C\subset…

Number Theory · Mathematics 2014-02-26 Roland Bacher

We prove that a bounded open set U in Euclidean n-space has k-width less than C(n) Volume(U)^{k/n}. Using this estimate, we give lower bounds for the k-dilation of degree 1 maps between certain domains in Euclidean space. In particular, we…

Differential Geometry · Mathematics 2007-05-23 Larry Guth

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…

Metric Geometry · Mathematics 2020-12-22 Gennadiy Averkov , Christopher Borger , Ivan Soprunov

Consider the problem of fnding the smallest area convex $k$-gon containing $n\in\mathbb{N}$ congruent disks without an overlap. By using Wegner inequality in sphere packing theory we give a lower bound for the area of such polygons. For…

Optimization and Control · Mathematics 2021-02-05 Orgil-Erdene Erdenebaatar , Uuganbaatar Ninjbat