AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 4 of 4 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.
For a prime \(p\), let \(A_p=\{k!\pmod p:1\leq k<p\}\). We prove \(|A_p|\gg p^{8/15}\), improving the general lower bound \((\sqrt{2}-o(1))p^{1/2}\). The proof begins with the identity \((n+2)!=(n+1)!+((n+1)!)^2/n!\) in \(\mathbb{F}_p\), which produces many incidences for a family of fractional-linear maps. After Cauch...
For an integer $d\ge 3$, put $\Delta_d=\min{2^{d-1},d(d-1)}$. Let $a/q$ be reduced, let $P(X)=\frac{a}{q}X^d+\alpha_{d-1}X^{d-1}+\cdots+\alpha_0$, and let $\mathcal{I}$ be an interval of $H\le q$ consecutive integers. We prove $\left|\sum_{n\in\mathcal{I}}e(P(n))\right|\ll_{d,\varepsilon}q^{1/d}H^\varepsilon+H^{1-1/\De...
We develop two transition principles for lower-bounding value sets generated by structured sequences over prime fields. A reciprocal-affine family with $M$ internal transitions and bounded quotient multiplicity has image size $\gg \min{M,p}^{8/15}$. This recovers the factorial-residue bound and yields the same exponent...
Let $2\le k\le n$, let $\Omega\subset\mathbb{R}^n$ be open and convex, and let $u$ be a convex viscosity solution of $\sigma_k(D^2u)=1$ in $\Omega$. We prove that the set on which $u$ fails to be locally $C^2$ has vanishing $(n-1)$-dimensional Hausdorff measure. In the intermediate range $3\le k<n$, this gives a codime...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.