Let $P_d(132,213)$ be the convex hull of the permutations in $S_d$ that avoid $132$ and $213$, and let $H_d(t)$ be its Ehrhart $h^*$-polynomial, defined by $\sum_{m\ge0}|mP_d(132,213)\cap\mathbb{Z}^d|t^m=\frac{H_d(t)}{(1-t)^d}$. We give an explicit lattice equivalence between this polytope, a path-Laplacian deficit pol...
The edge-power cost of the labelled tree generated by the $\gamma$-strategy, a constant-gain rule for sequential Euclidean connections, is studied, and differentiated estimates prove eventual uniqueness.
Comparison with the running mean highlights the stationary insertion-length distribution, its time-homogeneous update, stationary coefficient profile, and fixed effective memory, and its time-homogeneous update, stationary coefficient profile, and fixed effective memory.
P. D. de Castro· 1 citation· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.