Who's Afraid of the Hill Boundary?

The Jacobi-Maupertuis metric allows one to reformulate Newton's equations as geodesic equations for a Riemannian metric which degenerates at the Hill boundary. We prove that a JM geodesic which comes sufficiently close to a regular point of the boundary contains pairs of conjugate points close to the boundary. We prove the conjugate locus of any point near enough to the boundary is a hypersurface tangent to the boundary. Our method of proof is to reduce analysis of geodesics near the boundary to that of solutions to Newton's equations in the simplest model case: a constant force. This model case is equivalent to the beginning physics problem of throwing balls upward from a fixed point at fixed speeds and describing the resulting arcs, see Fig. 2

Logarithmically-small Minors and Topological Minors

Mader proved that for every integer $t$ there is a smallest real number $c(t)$ such that any graph with average degree at least $c(t)$ must contain a $K_t$-minor. Fiorini, Joret, Theis and Wood conjectured that any graph with $n$ vertices and average degree at least $c(t)+\epsilon$ must contain a $K_t$-minor consisting of at most $C(\epsilon,t)\log n$ vertices. Shapira and Sudakov subsequently proved that such a graph contains a $K_t$-minor consisting of at most $C(\epsilon,t)\log n \log\log n$ vertices. Here we build on their method using graph expansion to remove the $\log\log n$ factor and prove the conjecture. Mader also proved that for every integer $t$ there is a smallest real number $s(t)$ such that any graph with average degree larger than $s(t)$ must contain a $K_t$-topological minor. We prove that, for sufficiently large $t$, graphs with average degree at least $(1+\epsilon)s(t)$ contain a $K_t$-topological minor consisting of at most $C(\epsilon,t)\log n$ vertices. Finally, we show that, for sufficiently large $t$, graphs with average degree at least $(1+\epsilon)c(t)$ contain either a $K_t$-minor consisting of at most $C(\epsilon,t)$ vertices or a $K_t$-topological minor consisting of at most $C(\epsilon,t)\log n$ vertices.Comment: 19 page

Oscillating about coplanarity in the 4 body problem

For the Newtonian 4-body problem in space we prove that any zero angular momentum bounded solution suffers infinitely many coplanar instants, that is, times at which all 4 bodies lie in the same plane. This result generalizes a known result for collinear instants ("syzygies") in the zero angular momentum planar 3-body problem, and extends to the $d+1$ body problem in $d$-space. The proof, for $d=3$, starts by identifying the center-of-mass zero configuration space with real $3 \times 3$ matrices, the coplanar configurations with matrices whose determinant is zero, and the mass metric with the Frobenius (standard Euclidean) norm. Let $S$ denote the signed distance from a matrix to the hypersurface of matrices with determinant zero. The proof hinges on establishing a harmonic oscillator type ODE for $S$ along solutions. Bounds on inter-body distances then yield an explicit lower bound $\omega$ for the frequency of this oscillator, guaranteeing a degeneration within every time interval of length $\pi/\omega$. The non-negativity of the curvature of oriented shape space (the quotient of configuration space by the rotation group) plays a crucial role in the proof.Comment: 26 pages, 5 figure

Sharp threshold for embedding combs and other spanning trees in random graphs

When $k|n$, the tree $\mathrm{Comb}_{n,k}$ consists of a path containing $n/k$ vertices, each of whose vertices has a disjoint path length $k-1$ beginning at it. We show that, for any $k=k(n)$ and $\epsilon>0$, the binomial random graph $\mathcal{G}(n,(1+\epsilon)\log n/ n)$ almost surely contains $\mathrm{Comb}_{n,k}$ as a subgraph. This improves a recent result of Kahn, Lubetzky and Wormald. We prove a similar statement for a more general class of trees containing both these combs and all bounded degree spanning trees which have at least $\epsilon n/ \log^9n$ disjoint bare paths length $\lceil\log^9 n\rceil$. We also give an efficient method for finding large expander subgraphs in a binomial random graph. This allows us to improve a result on almost spanning trees by Balogh, Csaba, Pei and Samotij.Comment: 20 page