English
Related papers

Related papers: On the Hadwiger numbers of starlike disks

200 papers

Contact graphs have emerged as an important tool in the study of translative packings of convex bodies. The contact number of a packing of translates of a convex body is the number of edges in the contact graph of the packing, while the…

Metric Geometry · Mathematics 2020-02-12 Karoly Bezdek , Muhammad A. Khan , Michael Oliwa

Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…

Metric Geometry · Mathematics 2025-12-16 Andrii Arman , Jaskaran Singh Kaire , Andriy Prymak

We study the contact structure of totally separable} packings of translates of a convex body $K$ in $\mathbb{R}^d$, that is, packings where any two touching bodies have a separating hyperplane that does not intersect the interior of any…

Metric Geometry · Mathematics 2022-11-18 Márton Naszódi , Konrad J. Swanepoel

We show that the lattice Hadwiger number of superballs is exponential in the dimension. The same is true for some more general convex bodies.

Metric Geometry · Mathematics 2024-10-02 Serge Vlăduţ

The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch…

Metric Geometry · Mathematics 2018-11-06 Károly Bezdek , Márton Naszódi

L\'{a}szl\'{o} Fejes T\'{o}th and Alad\'{a}r Heppes proposed the following generalization of the kissing number problem. Given a ball in $\mathbb{R}^d$, consider a family of balls touching it, and another family of balls touching the first…

Metric Geometry · Mathematics 2022-10-19 Alexander Golovanov

We show that for every n > 0 there is a planar topological disk A_0 and n translates A_1, A_2, ..., A_n of A_0 such that the interiors of A_0, ... A_n are pairwise disjoint, but with each A_i touching A_0 for 1 <= i <= n.

Computational Geometry · Computer Science 2010-08-26 Otfried Cheong , Mira Lee

We have traced the Galactic thick disk to its, to date, highest metallicities. Based on high-resolution spectroscopic observations of 187 F and G dwarf stars that kinematically can be associated either with the thin disk (60 stars) or with…

Astrophysics · Physics 2007-05-23 T. Bensby , A. R. Zenn , M. S. Oey , S. Feltzing

Suppose we are given a set $\mathcal{D}$ of $n$ pairwise intersecting disks in the plane. A planar point set $P$ stabs $\mathcal{D}$ if and only if each disk in $\mathcal{D}$ contains at least one point from $P$. We present a deterministic…

Computational Geometry · Computer Science 2021-04-29 Sariel Har-Peled , Haim Kaplan , Wolfgang Mulzer , Liam Roditty , Paul Seiferth , Micha Sharir , Max Willert

The Hadwiger number of a graph $G$, denoted by $h(G)$, is the order of the largest complete minor of $G$. A graph is said to be self-complementary if it is isomorphic to its complement. We prove that for all $n\equiv 0,1 (\text{mod 4})$ and…

Combinatorics · Mathematics 2018-04-13 Andrei Pavelescu , Elena Pavelescu

Circumstellar disks are an essential ingredient of the formation of low-mass stars. It is unclear, however, whether the accretion-disk paradigm can also account for the formation of stars more massive than about 10 solar masses, in which…

According to theoretical considerations, multiplicity of hierarchical stellar systems can reach, depending on masses and orbital parameters, several hundred, while observational data confirm existence of at most septuple (seven-component)…

Solar and Stellar Astrophysics · Physics 2017-01-06 Y. M. Gebrehiwot , D. A. Kovaleva , A. Y. Kniazev , O. Yu. Malkov , N. A. Skvortsov , A. V. Karchevsky , S. B. Tessema , A. O. Zhukov

Let $\mathcal{D}=\{D_0,\ldots,D_{n-1}\}$ be a set of $n$ topological disks in the plane and let $\mathcal{A} := \mathcal{A}(\mathcal{D})$ be the arrangement induced by $\mathcal{D}$. For two disks $D_i,D_j\in\mathcal{D}$, let $\Delta_{ij}$…

Combinatorics · Mathematics 2026-03-11 Aida Abiad , Boris Aronov , Mark de Berg , Julian Golak , Alexander Grigoriev , Freija van Lent

We show that every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies. The previous result was $16$ copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is $8$. We modify Papadoperakis's…

Metric Geometry · Mathematics 2023-02-24 A. Prymak

The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph is NP-hard on co-bipartite graphs, but can be solved in…

Data Structures and Algorithms · Computer Science 2014-06-17 Petr A. Golovach , Pinar Heggernes , Pim van 't Hof , Christophe Paul

Given a simple polygon $P$ on $n$ vertices, and a set $D$ of $m$ pairwise intersecting geodesic disks in $P$, we show that five points in $P$ are always sufficient to pierce all the disks in $D$. This improves the previous bound of 14,…

Computational Geometry · Computer Science 2021-12-14 A. Karim Abu-Affash , Paz Carmi , Meytal Maman

Let H be a closed half-space of n-dimensional Euclidean space. Suppose S is a unit sphere in H that touches the supporting hyperplane of H. The one-sided kissing number B(n) is the maximal number of unit nonoverlapping spheres in H that can…

Metric Geometry · Mathematics 2007-05-23 Oleg R. Musin

The Hadwiger number $h(G)$ is the order of the largest complete minor in $G$. Does sufficient Hadwiger number imply a minor with additional properties? In [2], Geelen et al showed $h(G)\geq (1+o(1))ct\sqrt{\ln t}$ implies $G$ has a…

Combinatorics · Mathematics 2021-07-15 Matthew Wales

Let $H_n$ be the minimal number of smaller homothetic copies of an $n$-dimensional convex body required to cover the whole body. Equivalently, $H_n$ can be defined via illumination of the boundary of a convex body by external light sources.…

Metric Geometry · Mathematics 2020-10-01 A. Prymak , V. Shepelska

A biclique of a graph $G$ is an induced complete bipartite subgraph of $G$ such that neither part is empty. A star is a biclique of $G$ such that one part has exactly one vertex. The star graph of $G$ is the intersection graph of the…

‹ Prev 1 2 3 10 Next ›