Related papers: Fractional Helly theorem for Cartesian products of…

Given a map from a rectangle in the n-dimensional real Euclidean space into a metric semigroup, we introduce a concept of the total variation, which generalizes a similar concept due to T. H. Hildebrandt (1963) for real functions of two…

We prove existence of Helly numbers for crystals and for cut-and-project sets with convex windows. Also we show that for a two-dimensional crystal consisting of $k$ copies of a single lattice the Helly number does not exceed $k+6$.

Let $\mathcal F$ be a family of compact convex sets in $\mathbb R^d$. We say that $\mathcal F $ has a \emph{topological $\rho$-transversal of index $(m,k)$} ($\rho<m$, $0<k\leq d-m$) if there are, homologically, as many transversal…

A simplicial graph is said to be (coarsely) Helly if any collection of pairwise intersecting balls has non-empty (coarse) intersection. (Coarsely) Helly groups are groups acting geometrically on (coarsely) Helly graphs. Our main result is…

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Let $\mathbf{H}$ be the cartesian product of a family of finite abelian groups indexed by a finite set $\Omega$. A given poset (i.e., partially ordered set) $\mathbf{P}=(\Omega,\preccurlyeq_{\mathbf{P}})$ gives rise to a poset metric on…

Every ordered collection of sets in Euclidean space can be associated to a combinatorial code, which records the regions cut out by the sets in space. Given two ordered collections of sets, one can form a third collection in which the…

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

A set partition is $c$-uniform if every block has size $c$. Two families of $c$-uniform partitions of a finite set are said to be cross $t$-intersecting if two partitions from different families share at least $t$ blocks. In this paper, we…

For any hereditary graph class $F$, we construct optimal adjacency labeling schemes for the classes of subgraphs and induced subgraphs of Cartesian products of graphs in $F$. As a consequence, we show that, if $F$ admits efficient adjacency…

We prove a no-dimensional version of Carath\'edory's theorem: given an $n$-element set $P\subset \Re^d$, a point $a \in \conv P$, and an integer $r\le d$, $r \le n$, there is a subset $Q\subset P$ of $r$ elements such that the distance…

For elliptic systems with block structure in the upper half-space and t-independent coefficients, we settle the study of boundary value problems by proving compatible well-posedness of Dirichlet, regularity and Neumann problems in optimal…

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

This paper studies forward and reverse projections for the R\'{e}nyi divergence of order $\alpha \in (0, \infty)$ on $\alpha$-convex sets. The forward projection on such a set is motivated by some works of Tsallis {\em et al.} in…

For a sufficiently regular open bounded set $D \subset R^2$ let us consider the equation $(-\Delta)^{1/2} \varphi(x) = 1$, $x \in D$ with the Dirichlet exterior condition $\varphi(x) = 0$, $x \in D^c$. $\varphi$ is the expected value of the…

For $n\leq d$, a family ${\cal F}=\{C_0,C_1,\ldots, C_n\}$ of compact convex sets in $R^d$ is called an $n$-critical family provided any $n$ members of ${\cal F}$ have a non-empty intersection, but $\bigcap_{i=0}^n C_i=\varnothing$. If…

We prove fractional boundary Hardy's inequality in dimension one for the critical case $sp =1$. Optimality of the inequality is obtained for any $p$. The extra logarithmic correction term appears in usual fashion. We also provide a concrete…

Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an…

We prove that if a family of compact connected sets in the plane has the property that every three members of it are intersected by a line, then there are three lines intersecting all the sets in the family. This answers a question of…

We show that, when $sp>N$, the sharp Hardy constant $\mathfrak{h}_{s,p}$ of the punctured space $\mathbb R^N\setminus\{0\}$ in the Sobolev-Slobodecki\u{\i} space provides an optimal lower bound for the Hardy constant…