English
Related papers

Related papers: On multiple Borsuk numbers in normed spaces

200 papers

We define a set $P$ to be a branching $k$-path vertex cover of an undirected forest $F$ if all leaves and isolated vertices (vertices of degree at most $1$) of $F$ belong to $P$ and every path on $k$ vertices (of length $k-1$) contains…

Combinatorics · Mathematics 2026-01-07 Mikhail Makarov

A Helly-type theorem for diameter provides a bound on the diameter of the intersection of a finite family of convex sets in $\mathbb{R}^d$ given some information on the diameter of the intersection of all sufficiently small subfamilies. We…

Metric Geometry · Mathematics 2020-09-08 Travis Dillon , Pablo Soberón

For a (compact) subset $K$ of a metric space and $\varepsilon > 0$, the {\em covering number} $N(K , \varepsilon )$ is defined as the smallest number of balls of radius $\varepsilon$ whose union covers $K$. Knowledge of the {\em metric…

Metric Geometry · Mathematics 2009-09-25 Stanislaw J. Szarek

A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any two distinct points of X has size s. Larman--Rogers--Seidel proved that if the cardinality of a two-distance set…

Metric Geometry · Mathematics 2011-02-01 Hiroshi Nozaki

We consider generalized metric spaces taking distances in an arbitrary ordered commutative monoid, and investigate when a class $\mathcal{K}$ of finite generalized metric spaces satisfies the Hrushovski extension property: for any…

Logic · Mathematics 2020-05-22 Gabriel Conant

We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on…

Combinatorics · Mathematics 2016-10-25 Piotr Micek , Veit Wiechert

A subset of the sphere is said short if it is contained in an open hemisphere. A short closed set which is geodesically convex is called a cap. The following theorem holds: 1. The minimal number of short closed sets covering the $n$-sphere…

Geometric Topology · Mathematics 2015-12-22 A. B. Németh

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…

Metric Geometry · Mathematics 2013-12-10 Zakhar Ovsyannikov

We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…

Computational Geometry · Computer Science 2013-03-13 Rainer Penninger , Ivo Vigan

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$…

Combinatorics · Mathematics 2016-01-28 Luka Milićević

In this article we provide simple and provable bounds on the size and shape of the locus of discrete subgroups of $\mathsf{PSL}(2,\mathbb{C})\cong \operatorname{Isom}^+(\mathbb{H}^3)$ which split as a free product of cyclic groups…

Complex Variables · Mathematics 2025-01-24 A. Elzenaar , J. Gong , G. J. Martin , J. Schillewaert

We study the problem of determining the minimum number $f(n,k,d)$ of affine subspaces of codimension $d$ that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}\}$ at least $k$ times while covering the origin at most…

Combinatorics · Mathematics 2021-01-29 Anurag Bishnoi , Simona Boyadzhiyska , Shagnik Das , Tamás Mészáros

This paper is concerned with restricted families of projections in $\mathbb{R}^{3}$. Let $K \subset \mathbb{R}^{3}$ be a Borel set with Hausdorff dimension $\dim K = s > 1$. If $\mathcal{G}$ is a smooth and sufficiently well-curved…

Classical Analysis and ODEs · Mathematics 2016-02-03 Tuomas Orponen

For an integer $k\ge 3$, a $k$-path vertex cover of a graph $G=(V,E)$ is a set $T\subseteq V$ that shares a vertex with every path subgraph of order $k$ in $G$. The minimum cardinality of a $k$-path vertex cover is denoted by $\psi_k(G)$.…

Combinatorics · Mathematics 2021-05-06 Csilla Bujtás , Marko Jakovac , Zsolt Tuza

One classical result of Freimann gives the optimal lower bound for the cardinality of A+A if A is a d-dimensional finite set in the Euclidean d-space. Matolcsi and Ruzsa have recently generalized this lower bound to |A+kB| if B is…

Combinatorics · Mathematics 2016-02-08 Karoly Boroczky , Francisco Santos , Oriol Serra

For each $d \in {1,2,3,7,11}$, let $T_d$ be the nearest-integer complex continued fraction map associated with the Euclidean ring $\mathcal{O}*d$, and let $(a_n)$ be its digit sequence. We prove two metric results for this five-system…

Dynamical Systems · Mathematics 2026-04-17 Kangrae Park

We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…

Logic · Mathematics 2021-03-11 Daisuke Ikegami , Philipp Schlicht , Hisao Tanaka

First, we provide another proof that the signed count of the real $J$-holomorphic spheres (or $J$-holomorphic discs) passing through a generic real configuration of $k$ points is independent of the choice of the real configuration and the…

Symplectic Geometry · Mathematics 2007-05-23 Cheol-Hyun Cho

A set $C$ of unit vectors in $\mathbb{R}^d$ is called an $L$-spherical code if $x \cdot y \in L$ for any distinct $x,y$ in $C$. Spherical codes have been extensively studied since their introduction in the 1970's by Delsarte, Goethals and…

Combinatorics · Mathematics 2016-02-25 Peter Keevash , Benny Sudakov

We study lower bounds for the Minkowski and Hausdorff dimensions of the algebraic sum E+K of two subsets E and K of d-dimensional Euclidean space.

Classical Analysis and ODEs · Mathematics 2008-08-14 Daniel M. Oberlin
‹ Prev 1 8 9 10 Next ›