English
Related papers

Related papers: Covering the Crosspolytope with Crosspolytopes

200 papers

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

Computational Geometry · Computer Science 2023-03-16 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

Let $X$ be a simplicial complex on vertex set $V$. We say that $X$ is $d$-representable if it is isomorphic to the nerve of a family of convex sets in $\mathbb{R}^d$. We define the $d$-boxicity of $X$ as the minimal $k$ such that $X$ can be…

Combinatorics · Mathematics 2020-08-25 Alan Lew

For a simplicial complex $X$, the $d$-clique complex $\Delta_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n^{\alpha}$, with $\alpha <…

Combinatorics · Mathematics 2018-06-07 Demet Taylan

Hadwiger's Conjecture asserts that every $K_h$-minor-free graph is properly $(h-1)$-colourable. We prove the following improper analogue of Hadwiger's Conjecture: for fixed $h$, every $K_h$-minor-free graph is $(h-1)$-colourable with…

Combinatorics · Mathematics 2023-06-13 Vida Dujmović , Louis Esperet , Pat Morin , David R. Wood

A \textit{$k$-transversal} to family of sets in $\mathbb{R}^d$ is a $k$-dimensional affine subspace that intersects each set of the family. In 1957 Hadwiger provided a necessary and sufficient condition for a family of pairwise disjoint,…

Combinatorics · Mathematics 2024-01-19 Daniel McGinnis

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

Optimization and Control · Mathematics 2026-03-03 Hongyu Cheng , Amitabh Basu

Consider a compact K\"{a}hler manifold $M^m$ with Ricci curvature lower bound $Ric_M\geq -2(m+1) .$ Assume that its universal cover $% \widetilde{M}$ has maximal bottom of spectrum $\lambda_1(\widetilde{M}%) =m^2.$ Then we prove that…

Differential Geometry · Mathematics 2008-02-05 Ovidiu Munteanu

A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most $2^{d+1}-2$ neighbourly simplices in $\mathbb R^d$, is presented.

Combinatorics · Mathematics 2019-02-18 Andrzej P. Kisielewicz , Krzysztof Przesławski

In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…

Computational Geometry · Computer Science 2025-09-30 Helmut Alt , Sergio Cabello , Otfried Cheong , Ji-won Park , Nadja Seiferth

In this paper, we study the embedding of a complete balanced $d$-partite $d$-uniform hypergraph with all its $nd$ vertices represented as points in general position in $\mathbb{R}^d$ and each hyperedge drawn as a convex hull of $d$…

Combinatorics · Mathematics 2020-12-17 Rahul Gangopadhyay , Saswata Shannigrahi

In this paper we prove that it is possible to inscribe a regular crosspolytope (multidimensional octahedron) into a smooth convex body in $\mathbb R^d$, where $d$ is an odd prime power. Some generalizations of this statement are also…

Algebraic Topology · Mathematics 2009-07-21 R. N. Karasev

In 1945, A. W. Goodman and R. E. Goodman proved the following conjecture by P. Erd\H{o}s: Given a family of (round) disks of radii $r_1$, $\ldots$, $r_n$ in the plane it is always possible to cover them by a disk of radius $R = \sum r_i$,…

Metric Geometry · Mathematics 2017-02-17 Arseniy Akopyan , Alexey Balitskiy , Mikhail Grigorev

A simplicial complex K is called d-representable if it is the nerve of a collection of convex sets in R^d; K is d-collapsible if it can be reduced to an empty complex by repeatedly removing a face of dimension at most d-1 that is contained…

Combinatorics · Mathematics 2008-03-26 Jiri Matousek , Martin Tancer

A Hadamard matrix is a scaled orthogonal matrix with $\pm 1$ entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when $n$ is a multiple of 4. A conjecture attributed to Ryser is…

Combinatorics · Mathematics 2024-02-21 Stefan Steinerberger

Giving a joint generalization of a result of Brazitikos, Chasapis and Hioni and results of Giannopoulos and Milman, we prove that roughly $\left\lceil \frac{d}{(1-\vartheta)^d}\ln\frac{1}{(1-\vartheta)^d} \right\rceil$ points chosen…

Metric Geometry · Mathematics 2017-05-23 Márton Naszódi

Answering Tarski's plank problem, Bang showed in 1951 that it is impossible to cover a convex body $K \subset \mathbb{R}^d$ with $d \geq 1$ by planks whose total width is less than the minimal width $w(K)$ of $K$. In 2003, A. Bezdek asked…

Metric Geometry · Mathematics 2025-11-24 Gergely Ambrus , Julian Huddell , Maggie Lai , Matthew Quirk , Elias Williams

Let $G$ be a simple graph with $n$ vertices and $m$ edges and let $k$ be a natural number such that $k\leq n.$ Brouwer conjectured that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at most $m+{k+1 \choose 2}.$ In this paper we…

Combinatorics · Mathematics 2024-12-18 Slobodan Filipovski

Denote by $\Delta_M$ the $M$-dimensional simplex. A map $f\colon \Delta_M\to\mathbb R^d$ is an almost $r$-embedding if $f\sigma_1\cap\ldots\cap f\sigma_r=\emptyset$ whenever $\sigma_1,\ldots,\sigma_r$ are pairwise disjoint faces. A…

Geometric Topology · Mathematics 2026-01-08 S. Avvakumov , R. Karasev , A. Skopenkov

Assume $\lambda=\{k_1,k_2, \ldots, k_q\}$ is a partition of $k_{\lambda} = \sum_{i=1}^q k_i$. A $\lambda$-list assignment of $G$ is a $k_\lambda$-list assignment $L$ of $G$ such that the colour set $\bigcup_{v \in V(G)}L(v)$ can be…

Combinatorics · Mathematics 2022-09-16 Yangyan Gu , Yiting Jiang , David R. Wood , Xuding Zhu

The isotropic constant $L_K$ is an affine-invariant measure of the spread of a convex body $K$. For a $d$-dimensional convex body $K$, $L_K$ can be defined by $L_K^{2d} = \det(A(K))/(\mathrm{vol}(K))^2$, where $A(K)$ is the covariance…

Functional Analysis · Mathematics 2015-12-09 Luis Rademacher