2020
DOI: 10.1007/s00220-020-03734-z
|View full text |Cite
|
Sign up to set email alerts
|

Minimal-Area Metrics on the Swiss Cross and Punctured Torus

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 2π. Through every point in such a metric there is a geodesic that saturates the length condition, and saturating geodesics in a given homotopy class form a band. The extremal metric is unknown when bands of geodesics cross, as it happens for surfaces of non-zero genus. We use recently proposed convex programs to nume… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 21 publications
(31 citation statements)
references
References 19 publications
0
31
0
Order By: Relevance
“…The maximization above is an example of a convex optimization program and, hence, the equivalence between (1.1) and (1.2) can also be proved using techniques borrowed from convex optimization [31]. Soon after this paper appeared, it was realized that various geometric problems could likewise be translated to the realm of convex optimization leading to interesting new results [32,33]. The connection with convex optimization has also helped uncover various properties of entanglement entropy from the bit thread perspective [34], as well as some generalizations and applications to other entanglement related quantities [35][36][37][38][39][40][41].…”
Section: Motivationmentioning
confidence: 97%
“…The maximization above is an example of a convex optimization program and, hence, the equivalence between (1.1) and (1.2) can also be proved using techniques borrowed from convex optimization [31]. Soon after this paper appeared, it was realized that various geometric problems could likewise be translated to the realm of convex optimization leading to interesting new results [32,33]. The connection with convex optimization has also helped uncover various properties of entanglement entropy from the bit thread perspective [34], as well as some generalizations and applications to other entanglement related quantities [35][36][37][38][39][40][41].…”
Section: Motivationmentioning
confidence: 97%
“…We have not been able to 'solve' the constraint (7.29) to find a parameterization of the allowed metrics in a two-band region. Our results in [22] indicate that both positive and negative Gaussian curvature are possible.…”
Section: Normal Coordinates For Bands Of Geodesicsmentioning
confidence: 57%
“…The constraint (7.20) now translates into 22) meaning that at any point on the surface the sum of geodesic densities over all the classes that go through that point is the same.…”
Section: Normal Coordinates For Bands Of Geodesicsmentioning
confidence: 99%
See 1 more Smart Citation
“…The requirement is called geometric master equation and the job of finding the solutions is of fundamental interest in the framework of string field theory. In the past, such solutions were found using various metrics, an example being minimal area metrics [12][13][14][15][16]. There were also approximate constructions using the hyperbolic metrics [17][18][19][20].…”
Section: Introductionmentioning
confidence: 99%