Convex programs for minimal-area problems

DOI10.1007/S00220-020-03732-1zbMATH Open1443.30015arXiv1806.00449OpenAlexW3014830042MaRDI QIDQ779647FDOQ779647

Matthew Headrick, Barton Zwiebach

Publication date: 14 July 2020

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Abstract: The closed string field theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2pi. This is an extremal length problem in conformal geometry as well as a problem in systolic geometry. We consider the analogous minimal-area problem for homology classes of curves and, with the aid of calibrations and the max flow-min cut theorem, formulate it as a local convex program. We derive an equivalent dual program involving maximization of a concave functional. These two programs give new insights into the form of the minimal-area metric and are amenable to numerical solution. We explain how the homology problem can be modified to provide the solution to the original homotopy problem.

Full work available at URL: https://arxiv.org/abs/1806.00449

zbMATH Keywords

Riemann surfaceminimal-area problem

Mathematics Subject Classification ID

Riemann surfaces (30F99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Filling Riemannian manifolds
• Calibrated geometries
• A Panoramic View of Riemannian Geometry
• On general minimax theorems
• Maximal flow through a domain
• Systolic inequalities and minimal hypersurfaces
• Max-flow min-cut theorem in an anisotropic network
• How covariant closed string theory solves a minimal area problem
• Bit threads and holographic entanglement
• Isosystolic conformal inequalities
• À l'ombre de Loewner
• An optimal systolic inequality for \(\mathrm{CAT}(0)\) metrics in genus two
• Systolically extremal nonpositively curved surfaces are flat with finitely many singularities
• Minimal area problems and quantum open strings
• A criterion for flatness in minimal area metrics that define string diagrams
• The plumbing of minimal area surfaces
• Hyperbolic geometry and closed bosonic string field theory. I: The string vertices via hyperbolic Riemann surfaces
• Riemannian and Lorentzian flow-cut theorems
• Minimal-area metrics on the Swiss cross and punctured torus

Cited In (24)

• Hyperbolic geometry and closed bosonic string field theory. I: The string vertices via hyperbolic Riemann surfaces
• Area-time complexity of the unconstrained minimization problem
• Hyperbolic string tadpole
• A worldsheet description of flux compactifications
• New area-minimizing Lawson-Osserman cones
• Minimizing Condition Number via Convex Programming
• Area-minimizing minimal graphs over nonconvex domains.
• Bootstrapping closed string field theory
• Bit threads, Einstein's equations and bulk locality
• A new algorithm for the minimal-area convex enclosure problem
• Localization of effective actions in heterotic string field theory
• Title not available (Why is that?)
• Holographic thermal entropy from geodesic bit threads
• Multipartite entanglement and topology in holography
• Systolically extremal nonpositively curved surfaces are flat with finitely many singularities
• String vertices for the large \(N\) limit
• Closed string deformations in open string field theory. I: bosonic string.
• Open-closed hyperbolic string vertices
• Wilsonian effective potentials and closed string field theory
• The classical cosmological constant of open-closed string field theory
• Hyperbolic string vertices
• Sharp upper bounds on the length of the shortest closed geodesic on complete punctured spheres of finite area
• Hyperbolic three-string vertex
• Characterizing 4-string contact interaction using machine learning

This page was built for publication: Convex programs for minimal-area problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779647)