AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 2 of 6 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Fix $k\ge 3$, and let $f_k(N)$ be the largest harmonic sum of a subset of $[N]$ containing no $k$ distinct integers with a common pairwise least common multiple. We prove that $f_k(N)=(\log N)^{\gamma_k+o(1)}$ for a well-defined exponent $\gamma_k\in(0,1]$. Following the weighted-pressure idea of Chojecki, we give a se...
We prove that for every fixed $\lambda>0$ and all sufficiently large $n$, any $z_1,\dots,z_n\in\C$ with $|z_j|\geq1$ satisfy $\max_{2\leq k\leq n+1}|\sum_j z_j^k|>e^{-\lambda n}$. Consequently, the $n$th root of the optimal maximum tends to $1$, so no constant $C>1$ in Erd\H{o}s 973 can exist. The proof combines a trun...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.