相关论文: Hadwiger and Helly-type theorems for disjoint unit…

We extend the classical theory of sphere theorems to the transverse geometry of Riemannian foliations. In this setting, we establish transverse analogues of the Grove-Shiohama diameter sphere theorem and of the Berger-Klingenberg…

Let $D$ be a strong digraph on $n\geq 4$ vertices. In [3, Discrete Applied Math., 95 (1999) 77-87)], J. Bang-Jensen, Y. Guo and A. Yeo proved the following theorem: if (*) $d(x)+d(y)\geq 2n-1$ and $min \{d^+(x)+ d^-(y),d^-(x)+ d^+(y)\}\geq…

We provide a new quantitative version of Helly's theorem: there exists an absolute constant $\alpha >1$ with the following property: if $\{P_i: i\in I\}$ is a finite family of convex bodies in ${\mathbb R}^n$ with ${\rm int}\left…

We introduce a new variant of quantitative Helly-type theorems: the minimal \emph{"homothetic distance"} of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the…

In 2008, Halman proved a discrete Helly-type theorem for axis-parallel boxes in $\mathbb R^d$. Very recently, this result was extended to the $(p,q)$ setting with $p \geq q \geq d+1$ by Edwards and Sober\'on, and subsequently to the case $p…

We introduce and investigate a novel notion of transversely affine foliation, comparing and contrasting it to the previous ones in the literature. We then use it to give an extension of the classic Hadamard's theorem from Riemannian…

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…

We prove the following colorful Helly-type result: Fix $k \in [d-1]$. Assume $\mathcal{A}_1, \dots, \mathcal{A}_{d+(d-k)+1}$ are finite sets (colors) of nonzero vectors in $\R^d$. If for every rainbow sub-selection $R$ from these sets of…

For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…

The 3-arc graph of a digraph $D$ is defined to have vertices the arcs of $D$ such that two arcs $uv, xy$ are adjacent if and only if $uv$ and $xy$ are distinct arcs of $D$ with $v\ne x$, $y\ne u$ and $u,x$ adjacent. We prove that Hadwiger's…

It is shown that the rational convexity of any finite union of disjoint closed balls in C^n follows easily from the results of Duval and Sibony.

We prove a new family of sharp $L^2(\mathbb S^{d-1})\to L^4(\mathbb R^d)$ Fourier extension inequalities from the unit sphere $\mathbb S^{d-1}\subset \mathbb R^d$, valid in arbitrary dimensions $d\geq 3$.

We study the existence of minimal networks in the unit sphere $\mathbf{S}^d$ and the unit ball $\mathbf{B}^d$ of $\mathbf{R}^d$ endowed with Riemannian metrics close to the standard ones. We employ a finite-dimensional reduction method,…

We prove a Filling Theorem for the Heisenberg Groups $H^{2n+1}$: For a given $k$-cycle $a$ we construct a $(k+1)$-chain $b$ (the filling) with boundary $\partial b=a$ and controlled volume. For this filling $b$ we prove a uniform bound on…

For any odd $k$, a connection is established between the dihedral and supersymmetric extensions of the Tremblay-Turbiner-Winternitz Hamiltonians $H_k$ on a plane. For this purpose, the elements of the dihedral group $D_{2k}$ are realized in…

In this paper we prove Schur's conjecture in $\mathbb R^d$, which states that any diameter graph $G$ in the Euclidean space $\mathbb R^d$ on $n$ vertices may have at most $n$ cliques of size $d$. We obtain an analogous statement for…

We investigate the decomposition problem of balls into finitely many congruent pieces in dimension $d=2k$. In addition, we prove that the $d$ dimensional unit ball $B_d$ can be divided into finitely many congruent pieces if $d=4$ or $d\ge…

Denoting by ${\mathcal L}_d(m_0,m_1,...,m_r)$ the linear system of plane curves passing through $r+1$ generic points $p_0,p_1,...,p_r$ of the projective plane with multiplicity $m_i$ (or larger) at each $p_i$, we prove the…

We consider unions of $SL(2)$ lines in $\mathbb{R}^{3}$. These are lines of the form $$L = (a,b,0) + \mathrm{span}(c,d,1),$$ where $ad - bc = 1$. We show that if $\mathcal{L}$ is a Kakeya set of $SL(2)$ lines, then the union $\cup…

Let $D$ be a strong digraph on $n\geq 4$ vertices. In [2, J. Graph Theory 22 (2) (1996) 181-187)], J. Bang-Jensen, G. Gutin and H. Li proved the following theorems: If (*) $d(x)+d(y)\geq 2n-1$ and $min \{d(x), d(y)\}\geq n-1$ for every pair…