SearcharxivSearch

arXiv subjects

Andrew McLennan

Publications and source records attributed to Andrew McLennan.

2 recordsLinked to original sources

A Geometric Vietoris-Begle Theorem, with an Application to Convex Subsets of Topological Vector Lattices

We show that if $L$ is a topological vector lattice, $u \colon L \to L$ is the function $u(x) = x \vee 0$, $C \subset L$ is convex, and $D = u(C)$ is metrizable, then $D$ is an ANR and $u|_C \colon C \to D$ is a homotopy equivalence and thus an AR. This is proved by verifying the hypotheses of a second result: if $X$ is a connected space that is homotopy equivalent to an ANR, $Y$ is an ANR, and $f \colon X \to Y$ is a continuous surjection such that for each $y \in Y$ and each neighborhood $V \subset Y$ of $y$, there is a neighborhood $V' \subset V$ of $y$ such that $f^{-1}(V')$ can be contracted in $f^{-1}(V)$, then $f$ is a homotopy equivalence. The latter result is a geometric analogue of the Vietoris-Begle theorem.

math.GN

The Expected Number of Real Roots of a Multihomogeneous System of Polynomial Equations

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form expressions for the mean in special cases that include earlier results of Shub and Smale (for the general homogeneous system) and Rojas (for ``unmixed'' multihomogeneous systems). Theorem 3 gives upper and lower bounds for the mean number of roots, where the lower bound is the square root of the generic number of complex roots, as determined by Bernstein's theorem. These bounds are derived by induction from recursive inequalities given in Theorem 4.

math.PR