AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
5 papers indexed here
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.
We study finite and countable point configurations in the trace of Brownian motion in $\mathbb{R}^d$, $d\geq2$. In the plane, the set of translations placing a prescribed finite configuration on the trace has Hausdorff dimension two in every nonempty open set; we prove analogous dimension-preservation results for radia...
We address the question of which common differences can arise in arithmetic progressions contained in fractal sets. For a compact set $C\subset\mathbb R$, we investigate not only whether arithmetic progressions occur in $C$, but the full collection of their common differences. More generally, for a finite pattern $P$,...
Let $E\subset\mathbb R^2$ be analytic with $t=\dim_{\mathrm H}E>1$. We prove $\dim_{\mathrm H}\Delta E\ge 4/5+\eta_0$ for an absolute, non-explicit constant $\eta_0>0$, and \[ \dim_{\mathrm H}\Delta E\ge \frac{t^2-2t+5}{2t^2-7t+10} \quad\text{for }1<t\le\frac{11-\sqrt{41}}{4}, \] which reaches $7/8$ at the right endpoi...
Let $\Gamma\subset\mathbb R^2$ be a compact convex graph and define \[ T(\Gamma) = \inf \left\{ t: \dim_{\mathrm H}(E)>t \Longrightarrow |E+\Gamma|>0 \text{ for every compact }E\subset\mathbb R^2 \right\}. \] For a graph over an interval of positive length the smallest possible value is $T(\Gamma)=1$. We ask whether th...
Let $A\subseteq\mathbb{R}$ support a probability measure whose Fourier--Stieltjes transform tends to zero at infinity. We prove that, for every $\varepsilon\in(0,1)$, there is a closed, $1$-periodic, nowhere dense set $E\subseteq\mathbb{R}$ such that \[ m(E\cap I)\ge1-\varepsilon \] for every interval $I$ of length $1$...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.