English
Related papers

Related papers: A note on Bourgain's slicing problem

200 papers

We propose an algorithm with expected complexity of $\bigO(n\log n)$ arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where $n$ is the dimension of the channel vector. This algorithm…

Information Theory · Computer Science 2016-02-02 Jinming Wen , Xiao-Wen Chang

We consider the problem of constrained motion along a conic path under a given external potential function. The model is described as a second-class system capturing the behavior of a certain class of specific quantum field theories. By…

Quantum Physics · Physics 2022-05-18 R. L. Caires , S. L. Oliveira , R. Thibes

It is well known that the Catalan number C_n counts dissections of a regular (n+2)-gon into triangles. Here we count such dissections by number of triangles that contain two sides of the polygon among their three edges, leading to a…

Combinatorics · Mathematics 2013-05-14 David Callan

We study the Diophantine equation $a^k + b^k = c^k + d^k$ with integer variables and exponent $k>1$, under the linear constraint $(c+d) - (a+b) = h$. We analyze the geometry and arithmetic of these linear slices. On the central slice $h=0$,…

Number Theory · Mathematics 2025-12-09 Valery Asiryan

It has been conjectured that the sequence $(3/2)^n$ modulo $1$ is uniformly distributed. The distribution of this sequence is signifcant in relation to unsolved problems in number theory including the Collatz conjecture. In this paper, we…

Number Theory · Mathematics 2018-07-26 Paula Neeley , Daniel Taylor-Rodriguez , J. J. P. Veerman , Thomas Roth

The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds…

Combinatorics · Mathematics 2026-05-15 Kamillo Ferry , Michael Joswig , Jörg Rambau

Let $y$ be a random vector in \rn, satisfying $$ \Bbb E \, \tens{y} = id. $$ Let $M$ be a natural number and let $y_1 \etc y_M$ be independent copies of $y$. We prove that for some absolute constant $C$ $$ \enor{\frac{1}{M} \sum_i…

Metric Geometry · Mathematics 2016-09-06 Mark Rudelson

We consider a random planar map $M_n$ which is uniformly distributed over the class of all rooted q-angulations with n faces. We let $\mathbf{m}_n$ be the vertex set of $M_n$, which is equipped with the graph distance $d_\mathrm{gr}$. Both…

Probability · Mathematics 2013-07-26 Jean-François Le Gall

We pose a natural generalization to the well-studied and difficult no-three-in-a-line problem: How many points can be chosen on an $n \times n$ grid such that no three of them form an angle of $\theta$? In this paper, we classify which…

Combinatorics · Mathematics 2023-11-23 Natalie Dodson , Anant Godbole , Dashleen Gonzalez , Ryan Lynch , Lani Southern

In the March 2025 issue of Pour la Science, Jean-Paul Delahaye described a wonderful solution to the following problem: How many ways can you divide a 3 by 2n rectangle into two connected, congruent pieces? We show that this problem can be…

Combinatorics · Mathematics 2026-03-26 Robert Dougherty-Bliss , Natalya Ter-Saakov , Doron Zeilberger

The existence of a uniform upper bound for the maximum number of limit cycles of planar piecewise linear differential systems with two zones separated by a straight line has been subject of interest of hundreds of papers. After more than 30…

Dynamical Systems · Mathematics 2022-11-28 Victoriano Carmona , Fernando Fernández-Sánchez , Douglas D. Novaes

We develop a technique using dual mixed-volumes to study the isotropic constants of some classes of spaces. In particular, we recover, strengthen and generalize results of Ball and Junge concerning the isotropic constants of subspaces and…

Functional Analysis · Mathematics 2007-05-23 Emanuel Milman

Let $I(n,l)$ denote the maximum possible number of incidences between $n$ points and $l$ lines. It is well known that $I(n,l) = \Theta(n^{2/3}l^{2/3} + n + l)$. Let $c_{\mathrm{SzTr}}$ denote the lower bound on the constant of…

Computational Geometry · Computer Science 2017-07-18 Roel Apfelbaum

In this paper, we solve the Dirichlet problem with continuous boundary data for the Lagrangian mean curvature equation on a uniformly convex, bounded domain in $\mathbb{R}^n$.

Analysis of PDEs · Mathematics 2024-10-16 Arunima Bhattacharya

Over the past decade, a long line of research has investigated the distributed complexity landscape of locally checkable labeling (LCL) problems on bounded-degree graphs, culminating in an almost-complete classification on general graphs…

Data Structures and Algorithms · Computer Science 2024-02-16 Alkida Balliu , Sebastian Brandt , Fabian Kuhn , Dennis Olivetti , Gustav Schmid

We investigate two-sided bounds for operator norms of random matrices with unhomogenous independent entries. We formulate a lower bound for Rademacher matrices and conjecture that it may be reversed up to a universal constant. We show that…

Probability · Mathematics 2024-05-24 Rafał Latała , Witold Świątkowski

Under certain continuity conditions, we estimate upper and lower box dimension of graph of a function defined on the Sierpinski gasket. We also give an upper bound for Hausdorff dimension and box dimension of graph of function having finite…

Functional Analysis · Mathematics 2020-10-06 S. Verma , A. Sahu

Let $\Gamma$ be a discrete subgroup of a unimodular locally compact group $G$. In Math. Ann. 388, 4251-4305 (2024), it was shown that the $L_p$ norm of a Fourier multiplier $m$ on $\Gamma$ can be bounded locally by its $L_p$-norm on $G$,…

Differential Geometry · Mathematics 2025-11-03 Bas Janssens , Benjamin Oudejans

This note proves that the separation convergence towards the uniform distribution abruptly occurs at times around ln(n)/n for the (time-accelerated by 2) Brownian motion on the sphere with a high dimension n. The arguments are based on a…

Probability · Mathematics 2022-07-14 Marc Arnaudon , Koléhé Abdoulaye Coulibaly-Pasquier , Laurent Miclo

How many hyperplanes in $\mathbb{R}^n$ are needed in order to slice every edge of the $n$-dimensional hypercube with vertex set $\{\pm 1\}^n$? Here, we say that a hyperplane $H\subseteq \mathbb{R}^n$ slices an edge of the hypercube if it…

Combinatorics · Mathematics 2025-10-21 Lisa Sauermann , Zixuan Xu