Disjoint minimal graphs

Simple item page
dc.creatorTkachev, Vladimir G.
dc.date2008-07-23
dc.date.accessioned2026-07-07T12:47:18Z
dc.date.available2026-07-07T12:47:18Z
dc.descriptionWe prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is two).
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/0807.3694
dc.identifierhttp://arxiv.org/abs/0807.3694
dc.identifierAnnals of Global Analysis and Geometry, 35(2009), no 2, 139-155
dc.identifierdoi:10.1007/s10455-008-9127-7
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221677
dc.subjectDifferential Geometry
dc.subjectAnalysis of PDEs
dc.subject53A10; 35J60
dc.titleDisjoint minimal graphs
dc.typetext

Files

Collections

arXiv