We prove that every recovering pair $(\mathcal{A},\mathcal{B})$ of nonempty families of subsets of an $n$-element set satisfies $$|\mathcal{A}||\mathcal{B}|\le\left(\frac{223949}{100000}\right)^n=(2.23949)^n.$$ A result of Mond, Souza and Versteegen, combined with the sharp $(9/4)^n$ bound of Fang and Huang for cancell...
For a finite set $A$ of positive integers, let $H(A)$ be its set of subset sums, and let $g_3(n)$ be the least $N$ for which some $n$-element set $A\subseteq\{1,\ldots,N\}$ has $H(A)$ free of nonconstant three-term arithmetic progressions. Erd\H{o}s and S\'ark\H{o}zy asked whether $g_3(n)\gg 3^n$. We prove \[ \liminf_{...
We study polynomial zero-avoidance over finite vector spaces by means of slice rank and partition rank. We first make the support-entropy method effective by showing how a finite dual certificate yields an explicit entropy gap whenever the coefficient support admits no probability distribution with uniform marginals. F...
Simone Costa, Stefano Della Fiore, Mattia Fontana· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.