Skip to content
The Lumenary

Practice · Research pathways

Geometric analysis

Geometric analysis

Warm-upHuman

Under Ricci flow ∂tg=−2 Ric(g)\partial_t g = -2\,\mathrm{Ric}(g), a round nn-sphere of radius r0r_0 has g(t)=(r02−2(n−1)t) gSng(t) = (r_0^2 - 2(n-1)t)\,g_{S^n}. At what time does a round 3-sphere of radius r0=4r_0 = 4 shrink to a point?

Geometric analysis

Warm-upHuman

Which of these surfaces in R3\mathbb{R}^3 are minimal (mean curvature identically zero)? (Choose all that apply.)

Choose all that apply

Geometric analysis

CoreHuman

Two coaxial rings of radius 11 are placed at x=±0.5x = \pm 0.5. Two catenoids span them, with a≈0.848a \approx 0.848 (fat) and a≈0.235a \approx 0.235 (thin). Which statement is correct?

Choose one

Geometric analysis

CoreHuman

In the calibration proof that minimal graphs minimise area, ω(X,Y)=det⁡(ν,X,Y)\omega(X, Y) = \det(\nu, X, Y) for the unit vector field ν\nu. Which property gives the inequality ∫Sω≤Area(S)\int_S \omega \le \mathrm{Area}(S) for every surface SS?

Choose one

Geometric analysis

CoreHuman

A smooth embedded closed curve in the plane encloses area 4π4\pi and evolves by curve-shortening flow. At what time does it shrink to a point?

Geometric analysis

CoreFormal

The Lean theorem round_sphere_ricci_flow proves, for ρ(t)=r02−2(n−1)t\rho(t) = r_0^2 - 2(n-1)t and T=r02/(2(n−1))T = r_0^2/(2(n-1)): ρ′=−2(n−1)\rho' = -2(n-1), ρ(0)=r02\rho(0) = r_0^2, ρ(T)=0\rho(T) = 0 and ρ(t)>0\rho(t) > 0 for t<Tt < T. What does it not establish?

Choose one

Geometric analysis

StretchHuman

For which compact targets NN does the Eells–Sampson theorem guarantee that every continuous map from a compact Riemannian manifold into NN is homotopic to a harmonic map? (Choose all that apply.)

Choose all that apply

Geometric analysis

StretchHuman

Bernstein's theorem says an entire minimal graph over R2\mathbb{R}^2 is a plane. For which nn is every entire minimal graph over Rn\mathbb{R}^n a hyperplane?

Choose one

Geometric analysis

CoreComputational

Write heat_steps(u, lam, k): apply kk steps of the scheme ui↦λui−1+(1−2λ)ui+λui+1u_i \mapsto \lambda u_{i-1} + (1 - 2\lambda) u_i + \lambda u_{i+1} to the list u, with periodic indices (so u[-1] is the neighbour of u[0]). With λ≤12\lambda \le \tfrac12 the maximum never increases; with λ=1\lambda = 1 it can overshoot.

Runs entirely in your browser, in an isolated worker. Nothing is sent to a server.