English
Related papers

Related papers: A cubical antipodal theorem

200 papers

IFor a positive rational $l$, we define the concept of an $l$-elliptic and an $l$-hyperbolic rational set in a metric space. In this article we examine the existence of (i) dense and (ii) infinite $l$-hyperbolic and $l$-ellitpic rationals…

Number Theory · Mathematics 2023-07-06 C P Anil Kumar

We prove a topological rigidity theorem for closed hypersurfaces of the Euclidean sphere and of an elliptic space form. It asserts that, under a lower bound hypothesis on the absolute value of the principal curvatures, the hypersurface is…

Differential Geometry · Mathematics 2018-09-28 Eduardo Longa , Jaime Ripoll

Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…

Combinatorics · Mathematics 2019-11-20 Boris Bukh , Alfredo Hubard

We study the relationship between the sizes of sets $B,S$ in $\mathbb{R}^n$ where $B$ contains the $k$-skeleton of an axes-parallel cube around each point in $S$, generalizing the results of Keleti, Nagy, and Shmerkin about such sets in the…

Metric Geometry · Mathematics 2017-09-08 Riley Thornton

The Kneser-Poulsen conjecture says that if a finite collection of balls in a Euclidean (spherical or hyperbolic) space is rearranged so that the distance between each pair of centers does not increase, then the volume of the union of these…

Metric Geometry · Mathematics 2018-02-06 Igors Gorbovickis

Let $K$ be a set of $k$ positive integers. A biclique cover of type $K$ of a graph $G$ is a collection of complete bipartite subgraphs of $G$ such that for every edge $e$ of $G$, the number of bicliques need to cover $e$ is a member of $K$.…

Combinatorics · Mathematics 2013-01-22 Farokhlagha Moazami , Nasrin Soltankhah

In this paper we investigate the intersection problem for $1$-surfaces immersed in a complete Riemannian three-manifold $P$ with Ricci curvature bounded from below by $-2$. We first prove a Frankel's type theorem for $1$-surfaces with…

Differential Geometry · Mathematics 2022-02-10 G. Pacelli Bessa , Tiarlos Cruz , Leandro F. Pessoa

Minkowski's classical existence theorem provides necessary and sufficient conditions for a Borel measure on the unit sphere of Euclidean space to be the surface area measure of a convex body. The solution is unique up to a translation. We…

Metric Geometry · Mathematics 2020-08-18 Rolf Schneider

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…

Computational Geometry · Computer Science 2011-10-04 Menelaos I. Karavelas , Eleni Tzanaki

The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by…

Metric Geometry · Mathematics 2007-05-23 Julian Pfeifle , Günter M. Ziegler

Let $X$ be a smooth cubic hypersurface of dimension $n \ge 1$ over the rationals. It is well-known that new rational points may be obtained from old ones by secant and tangent constructions. In view of the Mordell--Weil theorem for $n=1$,…

Number Theory · Mathematics 2018-03-16 Stefanos Papanikolopoulos , Samir Siksek

As was pointed out by Nikulin [8] and Vinberg [10], a right-angled polyhedron of finite volume in hyperbolic n-space $\mathbb{H}^n$ has at least one cusp for $n\geq 5$. We obtain non-trivial lower bounds on the number of cusps of such…

Differential Geometry · Mathematics 2014-12-23 Jun Nonaka

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…

Combinatorics · Mathematics 2013-02-19 Michał Lasoń

In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the…

Combinatorics · Mathematics 2007-05-23 Sascha Kurz

The problem of Zarankiewicz asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain the complete bipartite graph $K_{k,k}$ as a subgraph. A classical theorem due to K\H{o}v\'ari, S\'os, and Tur\'an…

Combinatorics · Mathematics 2021-04-05 Oliver Janzer , Cosmin Pohoata

In 1933, Borsuk conjectured that any bounded d-dimensional set of nonzero diameter can be broken into d + 1 parts of smaller diameter. This conjecture was disproved for large enough d, though it is true for low dimensional cases. The paper…

Metric Geometry · Mathematics 2010-10-12 Dian Yang

Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…

Combinatorics · Mathematics 2011-07-07 Martin Tancer

We establish a lower bound for the surface area of a closed, convex hypersurface in Euclidean space in terms of its displacement under continuous maps. As a result, a hypothesized lower bound for the volume of a Riemannian $n$-sphere,…

Differential Geometry · Mathematics 2026-04-23 James Dibble , Joseph Hoisington

We show that any $3$-connected cubic plane graph on $n$ vertices, with all faces of size at most $6$, can be made bipartite by deleting no more than $\sqrt{(p+3t)n/5}$ edges, where $p$ and $t$ are the numbers of pentagonal and triangular…

Combinatorics · Mathematics 2020-07-24 Diego Nicodemos , Matěj Stehlík

We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…

Combinatorics · Mathematics 2022-08-05 Francisco Criado , Francisco Santos