English
Related papers

Related papers: A cubical antipodal theorem

200 papers

A d-interval hypergraph has d disjoint copies of the unit interval as its vertex set, and each edge is the union of d subintervals, one on each copy. Extending a classical result of Gallai on the case d = 1, Tardos and Kaiser used…

Combinatorics · Mathematics 2016-05-09 Ron Aharoni , Ron Holzman , Shira Zerbib

Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…

Metric Geometry · Mathematics 2021-08-17 Brett Leroux , Luis Rademacher

For a convex domain $D$ that is enclosed by the hypersurface $\partial D$ of bounded normal curvature, we prove an angle comparison theorem for angles between $\partial D$ and geodesic rays starting from some fixed point in $D$, and the…

Differential Geometry · Mathematics 2014-02-13 Alexander Borisenko , Kostiantyn Drach

The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…

Combinatorics · Mathematics 2023-10-13 Hoa T. Bui , Guillermo Pineda-Villavicencio , Julien Ugon

Let H = (H,V) be a hypergraph with edge set H and vertex set V. Then hypergraph H is invertible iff there exists a permutation pi of V such that for all E belongs to H(edges) intersection of(pi(E) and E)=0. H is invertibility critical if H…

Combinatorics · Mathematics 2016-09-06 Emanuel Knill

Borsuk asked in 1933 if every set of diameter 1 in $R^d$ can be covered by $d+1$ sets of smaller diameter. In 1993, a negative solution, based on a theorem by Frankl and Wilson, was given by Kahn and Kalai. In this paper I will present…

Combinatorics · Mathematics 2015-05-20 Gil Kalai

Makeev proved that among centrally symmetric four-dimensional polytopes, with more than twenty facets and circumscribed about the Euclidean ball of diameter one, there is no universal cover for the family of unit diameter sets. In this…

Metric Geometry · Mathematics 2012-07-30 Zsolt Langi

Let V be a plane smooth cubic curve over a finitely generated field k. The Mordell-Weil theorem for V states that there is a finite subset P \subset V(k) such that the whole V(k) can be obtained from P by drawing secants and tangents…

Algebraic Geometry · Mathematics 2008-02-07 Bogdan G. Vioreanu

First, we prove a special case of Knaster's problem, implying that each symmetric convex body in R^3 admits an inscribed cube. We deduce it from a theorem in equivariant topology, which says that there is no S_4-equivariant map from SO(3)…

Metric Geometry · Mathematics 2007-05-23 Tamas Hausel , Endre Makai , Andras Szucs

For every $d\geq 2$, we construct a subset $D\subseteq \{1,2,\dots,n\}^d$ of size $n-o(n)$ such that every affine hyperplane of $\mathbb{R}^d$ intersects $D$ in at most $d$ points, and every hypersphere of $\mathbb{R}^n$ intersects $D$ in…

Combinatorics · Mathematics 2025-11-06 Dávid R. Szabó

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

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 develop a connection between DP-colorings of $k$-uniform hypergraphs of order $n$ and coverings of $n$-dimensional Boolean hypercube by pairs of antipodal $(n-k)$-dimensional faces. Bernshteyn and Kostochka established that the lower…

Combinatorics · Mathematics 2024-03-06 Vladimir N. Potapov

This paper looks at the splitting problem for globally hyperbolic spacetimes with timelike Ricci curvature bounded below containing a (spacelike, acausal, future causally complete) hypersurface with mean curvature bounded from above. For…

Differential Geometry · Mathematics 2016-09-19 Melanie Graf

We study various measures of irrationality for hypersurfaces of large degree in projective space and other varieties. These include the least degree of a rational covering of projective space, and the minimal gonality of a covering family…

Algebraic Geometry · Mathematics 2019-02-20 Francesco Bastianelli , Pietro De Poi , Lawrence Ein , Robert Lazarsfeld , Brooke Ullery

Keller's conjecture on cube tilings asserted that, in any tiling of $\mathbb{R}^d$ by unit cubes, there must exist two cubes that share a $(d-1)$-dimensional face. This is now known to be true in dimensions $d\leq 7$ and false for $d\geq…

Combinatorics · Mathematics 2024-04-22 Benjamin Bruce , Izabella Laba

Consider a simplicial complex that allows for an embedding into $\mathbb{R}^d$. How many faces of dimension $\frac{d}{2}$ or higher can it have? How dense can they be? This basic question goes back to Descartes' "Lost Theorem" and Euler's…

Combinatorics · Mathematics 2019-07-03 Karim Adiprasito

In this paper, we prove that for any smooth hypersurface $Y$ of degree $d$ in $\mathbb{P}^{n+1}_k$, the cyclic $d$-fold cover $\widetilde{Y} \to \mathbb{P}^{n+1}_k$ branched along $Y$ completely characterizes $Y$ up to projective…

Algebraic Geometry · Mathematics 2025-10-28 Zhiyuan Li , Zhichao Tang

We establish a "neighborhood" variant of the cubical KKM lemma and the Lebesgue covering theorem and deduce a discretized version which is a "neighborhood" variant of Sperner's lemma on the cube. The main result is the following: for any…

Combinatorics · Mathematics 2023-06-23 Jason Vander Woude , Peter Dixon , A. Pavan , Jamie Radcliffe , N. V. Vinodchandran

The $k$-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least $k$ disks. Under unit disk condition, when $k$=1, this problem has been solved by Kershner in 1939. However, when…

Metric Geometry · Mathematics 2016-04-21 Jingchao Chen
‹ Prev 1 3 4 5 6 7 10 Next ›