Related papers: The Generalized Makeev Problem Revisited

While equivariant methods have seen many fruitful applications in geometric combinatorics, their inability to answer the now settled Topological Tverberg Conjecture has made apparent the need to move beyond the use of Borsuk--Ulam type…

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…

In 1960 Gr\"unbaum asked whether for any finite mass in $\mathbb{R}^d$ there are $d$ hyperplanes that cut it into $2^d$ equal parts. This was proved by Hadwiger (1966) for $d\le3$, but disproved by Avis (1984) for $d\ge5$, while the case…

Given $1\le \ell <k$ and $\delta\ge0$, let $\textbf{PM}(k,\ell,\delta)$ be the decision problem for the existence of perfect matchings in $n$-vertex $k$-uniform hypergraphs with minimum $\ell$-degree at least $\delta\binom{n-\ell}{k-\ell}$.…

We give an improved upper bound for the Gr\"unbaum--Hadwiger--Ramos problem: Let $d,n,k \in \mathbb{N}$ such that $d \geq 2^n(1+2^{k-1})$. Given $2^{n+1}$ masses on $\mathbb{R}^d$, there exist $k$ hyperplanes in $\mathbb{R}^d$ that…

We consider extensions of the Rattray theorem and two Makeev's theorems, showing that they hold for several maps, measures, or functions simultaneously, when we consider orthonormal $k$-frames in $\R^n$ instead of orthonormal basis (full…

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

The notion of $(k,m)$-agreeable society was introduced by Deborah Berg et al.: a family of convex subsets of $\R^d$ is called $(k,m)$-agreeable if any subfamily of size $m$ contains at least one non-empty $k$-fold intersection. In that…

If a convex body $K \subset \mathbb{R}^n$ is covered by the union of convex bodies $C_1, \ldots, C_N$, multiple subadditivity questions can be asked. Two classical results regard the subadditivity of the width (the smallest distance between…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

We consider the Sobolev (Bessel potential) spaces H^ell(R^d, C), and their standard norms || ||_ell (with ell integer or noninteger). We are interested in the unknown sharp constant K_{ell m n d} in the inequality || f g ||_{ell} \leqs…

Let $r,k,\ell$ be integers such that $0\le\ell\le\binom{k}{r}$. Given a large $r$-uniform hypergraph $G$, we consider the fraction of $k$-vertex subsets which span exactly $\ell$ edges. If $\ell$ is 0 or $\binom{k}{r}$, this fraction can be…

Given a subset K of the unit Euclidean sphere, we estimate the minimal number m = m(K) of hyperplanes that generate a uniform tessellation of K, in the sense that the fraction of the hyperplanes separating any pair x, y in K is nearly…

The cage problem asks for the smallest number $c(k,g)$ of vertices in a $k$-regular graph of girth $g$ and graphs meeting this bound are known as cages. While cages are known to exist for all integers $k \ge 2$ and $g \ge 3$, the exact…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

We look at extensions of formulas given by Jovovic and recently proved by Dhar on integer partitions where the smallest part occurs at least $m$ times and on integer partitions with fixed differences between the largest and smallest parts…

A generalization of the Borsuk-Ulam theorem to Stiefel manifolds is considered. This theorem is applied to derive bounds on $d$ that guarantee-for a given set of $m$ measures in $\mathbb{R}^d$-the existence of $k$ mutually orthogonal…

This paper presents a new extension of the classical Heron problem, termed the generalized $(k,m)$-Heron problem, which seeks an optimal configuration among $k$ feasible and $m$ target non-empty closed convex sets in $\mathbb{R}^n$. The…

We introduce an extension of the \ell-reduced KP hierarchy, which we call the \ell-Bogoyavlensky hierarchy. Bogoyavlensky's 2+1-dimensional extension of the KdV equation is the lowest equation of the hierarchy in case of \ell=2. We present…