We have 4 of 196 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.
We classify all smallest sets of edge deletions that destroy every nonnested perfect matching in a complete ordered graph. The vertices have a fixed linear order. A perfect matching selects edges that use each vertex exactly once; it is nonnested when no selected edge has both endpoints strictly between those of anothe...
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.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
