English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $\mathcal F_1, \ldots, \mathcal F_\ell$ be families of subsets of $\{1,\ldots, n\}$. Suppose that for distinct $k, k'$ and arbitrary $F_1 \in \mathcalF_{k}, F_2 \in \mathcal F_{k'}$ we have $|F_1 \cap F_2|\le m.$ What is themaximal value of $|\mathcal F_1|\ldots |\mathcal F_\ell|$? In this work we findthe asymptotic of this product as $n$ tends to infinity for constant $\ell$and~$m$.  This question is related to a conjecture of Bohn et al. that arose in the2-level polytope theory and asked for the largest product of the number offacets and vertices in a two-level polytope. This conjecture was recentlyresolved by Weltge and the first author.  The main result can be rephrased in terms of colorings. We give an asymptoticanswer to the following question. Given an edge coloring of a complete$m$-uniform hypergraph into $\ell$ colors, what is the maximum of $\prod M_i$,where $M_i$ is the number of monochromatic cliques in $i$-th color?

Octopuses in the Boolean cube: families with pairwise small intersections, part I