Let $z(n)$ be the maximum number of edges in a tripartite $3$-uniform hypergraph with $n$ vertices in each part and no copy of $K_{2,2,2}^{(3)}$ (a ``box''). Erd\H{o}s (1964) proved that $z(n) = O(n^{11/4})$, whereas the best previous lower bound, due to Katz, Krop, and Maggioni (2002), was $\Omega(n^{8/3})$. For each...
Brada\v{c}, Sudakov, and Wigderson characterized $p$-locally dense graphons by a quadratic inequality for all bounded nonnegative functions. Their proof uses Reiher's finite lemma and graphon approximation, and they asked for a direct proof. We give one by rounding simple functions. Divide each level set into $m$ equal...
Let $$ M_{r,p}^{(d)}(g)=\int_{\mathbb R^d}|x|^r|g(x)|^p\,dx, \qquad 1<p<\infty. $$ Write $p'=p/(p-1)$ and $\omega_d=|B(0,1)|$. A direct step in the Wigderson--Wigderson moment method asks for a single-function estimate $$ \lVert g\rVert_1\le K\lVert g\rVert_q^{\,1-p\eta} \bigl(M_{r,p}^{(d)}(g)\bigr)^\eta, \qquad \eta=\...
The Zarankiewicz problem for $3$-uniform hypergraphs asks for the maximum number $z(n)$ of edges in a tripartite hypergraph with $n$ vertices in each part containing no copy of $K_{2,2,2}^{(3)}$ (a ``box''). Erd\H{o}s (1964) proved $z(n) = O(n^{11/4})$. The best previously known lower bound was $\Omega(n^{8/3})$, due t...
Let $F$ be a field, let $0\le \ell\le k-2$, and suppose that $n\ge k-1$. We determine the minimum degree of a polynomial in $F[x_1,\ldots,x_n]$ that vanishes to order at least $k$ at every nonzero vertex of the Boolean cube and to order exactly $\ell$ at the origin. The answer is \[ n+2k-2-\rho_F(k-\ell), \] where $\rh...
D. Menezes· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.