Related papers: An improved lower bound for star-shaped Kakeya set…

A permutation $\sigma\in S_n$ is said to be $k$-universal or a $k$-superpattern if for every $\pi\in S_k$, there is a subsequence of $\sigma$ that is order-isomorphic to $\pi$. A simple counting argument shows that $\sigma$ can be a…

We show that there is a constant $K > 0$ such that for all $N, s \in \N$, $s \le N$, the point set consisting of $N$ points chosen uniformly at random in the $s$-dimensional unit cube $[0,1]^s$ with probability at least $1-\exp(-\Theta(s))$…

For positive integers $s,t,m$ and $n$, the Zarankiewicz number $z(m,n;s,t)$ is the maximum number of edges in a subgraph of $K_{m,n}$ that has no complete bipartite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices…

In this paper we study uniform distribution properties of digital sequences over a finite field of prime order. In 1998 it was shown by Larcher that for almost all $s$-dimensional digital sequences the star discrepancy $D_N^\ast$ satisfies…

For a probability measure $\mu$ on $[0,1]$ without discrete component, the best possible order of approximation by a finite point set in terms of the star-discrepancy is $\frac{1}{2N}$ as has been proven relatively recently. However, if…

We provide a condition on a set of directions $\Omega \subset \mathbb{S}^1$ ensuring that the associated directional maximal operator $M_\Omega$ is unbounded on $L^p(\mathbb{R}^2)$ for every $1 \leq p < \infty$. The techniques of proof…

We give an upper bound for the Stanley depth of the edge ideal $I$ of a $k$-partite complete graph and show that Stanley's conjecture holds for $I$. Also we give an upper bound for the Stanley depth of the edge ideal of a $k$-uniform…

We develop a notion of finite order lacunarity for direction sets in $\mathbb R^{d+1}$. Given a direction set $\Omega$ that is sublacunary according to this definition, we construct random examples of Euclidean sets that contain unit line…

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

In this note, pointwise best-possible (lower and upper) bounds on the set of copulas with a given value of the Gini's gamma coefficient are established. It is shown that, unlike the best-possible bounds on the set of copulas with a given…

Let $M$ be an $n$-dimensional Lagrangian submanifold of a complex space form. We prove a pointwise inequality $$\delta(n_1,\ldots,n_k) \leq a(n,k,n_1,\ldots,n_k) \|H\|^2 + b(n,k,n_1,\ldots,n_k)c,$$ with on the left hand side any…

In this paper, we study curved Kakeya sets associated with phase functions satisfying Bourgain's condition. In particular, we show that the analysis of curved Kakeya sets arising from translation-invariant phase functions under Bourgain's…

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…

We show that the problem of counting collinear points in a permutation (previously considered by the author and J. Solymosi in "Collinear Points in Permutations", 2005) and the well-known finite plane Kakeya problem are intimately…

We prove the optimality of a criterion of Koksma (1953) in Khinchin's conjecture, settling a long standing open problem in analysis. Using this result, we also give a near optimal condition for the a.e.\ convergence of series…

We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…

A (d,k) set is a subset of R^d containing a translate of every k-dimensional plane. Bourgain showed that for 2^{k-1}+k \geq d, every (d,k) set has positive Lebesgue measure. We give an L^p bound for the corresponding maximal operator.

Kakeya sets are compact subsets of $\mathbb{R}^n$ that contain a unit line segment pointing in every direction. The Kakeya conjecture states that such sets must have Hausdorff dimension $n$. The property of stickiness was first discovered…

We prove that the optimal constant in the Lieb--Thirring inequality on a star graph with $N$ edges coincides with that on $\mathbb R$ if $N$ is even. For odd $N$ we show that this property holds when restricting to radial potentials and we…

We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2…