English
Related papers

Related papers: Stabbing simplices by points and flats

200 papers

By the Hahn-Banach theorem, every normed space admits rank-one projections with operator norm one. However, this is not true for higher rank projections. Bosznay and Garay showed that for every $d \geq 3$ there exist $d$-dimensional normed…

Functional Analysis · Mathematics 2025-09-19 Jeremias Epperlein

We prove that for each $D\ge 2$ there exists $c>0$ such that whenever $b\le c\big(\tfrac{n}{\log n}\big)^{1/D}$, in the $(1:b)$ Maker-Breaker game played on $E(K_n)$, Maker has a strategy to guarantee claiming a graph $G$ containing copies…

Combinatorics · Mathematics 2017-11-16 Peter Allen , Julia Böttcher , Yoshiharu Kohayakawa , Humberto Naves , Yury Person

For each $d>1$ the shift locus of degree $d$, denoted ${\mathcal S}_d$, is the space of normalized degree $d$ polynomials in one complex variable for which every critical point is in the attracting basin of infinity under iteration. It is a…

Dynamical Systems · Mathematics 2022-01-06 Danny Calegari

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$. We show that if $|R| < \frac{3}{2}n$ and $P…

Combinatorics · Mathematics 2021-10-13 Mehdi Makhul , Rom Pinchasi

Inspired by the Taubes-Wu construction of $\mathcal{C}^{1,\alpha}$ two-valued harmonic functions by the use of symmetry, we construct minimal surfaces with stratified branching sets as graphs of $\mathcal{C}^{1,\alpha}$ two-valued…

Differential Geometry · Mathematics 2026-03-31 Federico Franceschini , Rafe Mazzeo , Paul Minter

Let $\Gamma_d$ be the largest constant such that every finite collection of cubes in $\mathbb{R}^d$ whose sides are parallel to the coordinate axes admits a disjoint sub-collection occupying a fraction $\Gamma_d$ of its volume. Vitali's…

Classical Analysis and ODEs · Mathematics 2025-10-09 Gian Maria Dall'Ara

Let $\Sigma_d^{++}$ be the set of positive definite matrices with determinant 1 in dimension $d\ge 2$. Identifying any two $SL_d(\mathbb{Z})$-congruent elements in $\Sigma_d^{++}$ gives rise to the space of reduced quadratic forms of…

Number Theory · Mathematics 2016-07-18 Faustin Adiceam , Evgeniy Zorin

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

Probability · Mathematics 2025-02-06 Stefan Gerdjikov , Martin Minchev , Mladen Savov

Let $\mathbb K$ be a field of characteristic 0. Let $\Gamma\subset\mathbb P^n_{\mathbb K}$ be a reduced finite set of points, not all contained in a hyperplane. Let $hyp(\Gamma)$ be the maximum number of points of $\Gamma$ contained in any…

Commutative Algebra · Mathematics 2012-03-12 Stefan O. Tohaneanu

Stanley proved that for any centrally symmetric simplicial $d$-polytope $P$ with $d\geq 3$, $g_2(P) \geq {d \choose 2}-d$. We provide a characterization of centrally symmetric $d$-polytopes with $d\geq 4$ that satisfy this inequality as…

Combinatorics · Mathematics 2018-11-13 Steven Klee , Eran Nevo , Isabella Novik , Hailun Zheng

For $d\ge 1$, we construct a compact subset $K\subseteq \mathbb {R}^{d+1}$ containing a $d$-sphere of every radius between $1$ and $2$, such that for every $\delta\in (0,1)$, the $\delta$-neighbourhood of $K$ has Lebesgue measure $\lesssim…

Classical Analysis and ODEs · Mathematics 2025-01-08 Xianghong Chen , Tongou Yang , Yue Zhong

Euclidean spanners are important geometric objects that have been extensively studied since the 1980s. The two most basic "compactness'' measures of a Euclidean spanner $E$ are the size (number of edges) $|E|$ and the weight (sum of edge…

Computational Geometry · Computer Science 2024-09-18 Hung Le , Shay Solomon , Cuong Than , Csaba D. Tóth , Tianyi Zhang

Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…

Data Structures and Algorithms · Computer Science 2018-04-23 Arnold Filtser , Ofer Neiman

For $m, d \in {\mathbb N}$, a jittered sampling point set $P$ having $N = m^d$ points in $[0,1)^d$ is constructed by partitioning the unit cube $[0,1)^d$ into $m^d$ axis-aligned cubes of equal size and then placing one point independently…

Numerical Analysis · Mathematics 2022-06-13 Benjamin Doerr

Let $({\bf U},{\bf S},d)$ be an instance of Set Cover Problem, where ${\bf U}=\{u_1,...,u_n\}$ is a $n$ element ground set, ${\bf S}=\{S_1,...,S_m\}$ is a set of $m$ subsets of ${\bf U}$ satisfying $\bigcup_{i=1}^m S_i={\bf U}$ and $d$ is a…

Computational Complexity · Computer Science 2011-10-11 Hao Chen

In the classical obstacle problem, the free boundary can be decomposed into "regular" and "singular" points. As shown by Caffarelli in his seminal papers \cite{C77,C98}, regular points consist of smooth hypersurfaces, while singular points…

Analysis of PDEs · Mathematics 2017-11-28 Alessio Figalli , Joaquim Serra

In this paper we prove that a set of points $B$ of PG(n,2) is a minimal blocking set if and only if $<B>=PG(d,2)$ with $d$ odd and $B$ is a set of $d+2$ points of $PG(d,2)$ no $d+1$ of them in the same hyperplane. As a corollary to the…

Group Theory · Mathematics 2007-08-20 Alireza Abdollahi , M. J. Ataei , A. Mohammadi Hassanabadi

We show there exists a packing of identical spheres in $\mathbb{R}^d$ with density at least \[ (1-o(1))\frac{d \log d}{2^{d+1}}\, , \] as $d\to\infty$. This improves upon previous bounds for general $d$ by a factor of order $\log d$ and is…

Metric Geometry · Mathematics 2023-12-18 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

In 1984, Thomassen conjectured that for every constant $k \in \mathbb{N}$, there exists $d$ such that every graph with average degree at least $d$ contains a balanced subdivision of a complete graph on $k$ vertices, i.e. a subdivision in…

Combinatorics · Mathematics 2023-02-09 Yan Wang

The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time. Unfortunately, all…

Computational Geometry · Computer Science 2013-06-21 Sander P. A. Alewijnse , Quirijn W. Bouts , Alex P. ten Brink , Kevin Buchin