Related papers: The Generalized Makeev Problem Revisited

In 1980 Carleson posed a question on the minimal regularity of an initial data function in a Sobolev space $H^s(\mathbb{R}^n)$ that implies pointwise convergence for the solution of the linear Schr\"odinger equation. After progress by many…

For any number field $K$ with $D_K=|\mathrm{Disc}(K)|$ and any integer $\ell \geq 2$, we improve over the commonly cited trivial bound $|\mathrm{Cl}_K[\ell]| \leq |\mathrm{Cl}_K| \ll_{[K:\mathbb{Q}],\varepsilon} D_K^{1/2+\varepsilon}$ on…

Let $r \geq 2$, $n$ and $k$ be integers satisfying $k \leq \frac{r-1}{r}n$. In the original arXiv version of this note we suggested a conjecture that the family of all $k$-subsets of an $n$-set cannot be partitioned into fewer than $\lceil…

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

We work in the space of $m$-by-$n$ real matrices with the Frobenius inner product. Consider the following Problem: Given an m-by-n real matrix A and a positive integer k, find the m-by-n matrix with rank k that is closest to A. I discuss a…

This is the first of four articles studying some slight generalisations H(n,m) of Khovanov's diagram algebra, as well as quasi-hereditary covers K(n,m) of these algebras in the sense of Rouquier, and certain infinite dimensional limiting…

We consider an isoperimetric inequality for $(m+1)$-dimensional area minimizing submanifolds of arbitrary codimension which lie outside a convex set $\mathcal{K} \subset \mathbb{R}^{n+1}$ and are bounded by a submanifold of…

For each $k \geq 3$ and $1 \leq \ell \leq k-1$ we give an asymptotically best possible minimum positive codegree condition for the existence of a Hamilton $\ell$-cycle in a $k$-uniform hypergraph. This result exhibits an interesting duality…

We prove a generalization of the hyperplane inequality for intersection bodies, where volume is replaced by an arbitrary measure $\mu$ with even continuous density and sections are of arbitrary dimension $n-k,\ 1\le k <n.$ If $K$ is a…

We consider the generalized two-dimensional Zakharov-Kuznetsov equation $u_t+\partial_x \Delta u+\partial_x(u^{k+1})=0$, where $k\geq3$ is an integer number. For $k\geq8$ we prove local well-posedness in the $L^2$-based Sobolev spaces…

Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…

We prove that for $d\ge 2,\, k\ge 2$, if the Hausdorff dimension of a compact set $E\subset \mathbb{R}^d$ is greater than $\frac{d^2}{2d-1}$, then, for any given $r > 0$, there exist $(x^1, \dots, x^{k+1})\in E^{k+1}$, $(y^1, \dots,…

The central levels problem asserts that the subgraph of the $(2m+1)$-dimensional hypercube induced by all bitstrings with at least $m+1-\ell$ many 1s and at most $m+\ell$ many 1s, i.e., the vertices in the middle $2\ell$ levels, has a…

In this article, we establish the existence of an extremal function for the k-th order critical Hardy-Sobolev-Maz'ya (HSM) inequalities on the upper half space $\mathbb{R}^{n+1}_{+}$ when $k\ge 2$ and $n\geq 2k+2$:…

An $r$-cut of a $k$-uniform hypergraph is a partition of its vertex set into $r$ parts, and the size of the cut is the number of edges which have at least one vertex in each part. The study of the possible size of the largest $r$-cut in a…

The Kautz digraphs $K(d,\ell)$ are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related to these, the cyclic Kautz digraphs $CK(d,\ell)$ were recently introduced by B\"ohmov\'a,…

Planck scale physics represents a future challenge, located between particle physics and general relativity. The Planck scale marks a threshold beyond which the old description of spacetime breaks down and conceptually new phenomena must…

A {\it krausz $(k,m)$-partition} of a graph $G$ is the partition of $G$ into cliques, such that any vertex belongs to at most $k$ cliques and any two cliques have at most $m$ vertices in common. The {\it $m$-krausz} dimension $kdim_m(G)$ of…

We are interested in the existence of Pareto solutions to the vector optimization problem $$\text{Min}_{\,\mathbb{R}^m_+} \{f(x) \,|\, x\in \mathbb{R}^n\},$$ where $f\colon\mathbb{R}^n\to \mathbb{R}^m$ is a polynomial map. By using the {\em…

In this paper, among other results, we improve the best known estimates for the constants of the generalized Bohnenblust-Hille inequality. These enhancements are then used to improve the best known constants of the Hardy--Littlewood…