Change search
ReferencesLink to record
Permanent link

Direct link
Disjoint minimal graphs
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2009 (English)In: Annals of Global Analysis and Geometry, ISSN 0232-704X, E-ISSN 1572-9060, Vol. 35, no 2, 139-155 p.Article in journal (Refereed) Published
Abstract [en]

We 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) <= 3.

Place, publisher, year, edition, pages
2009. Vol. 35, no 2, 139-155 p.
Keyword [en]
Minimal graphs, Angular density, Fundamental frequency
National Category
URN: urn:nbn:se:kth:diva-32796DOI: 10.1007/s10455-008-9127-7ISI: 000263777200003ScopusID: 2-s2.0-61449177951OAI: diva2:411931
Swedish Research Council, VR 2007-6224Knut and Alice Wallenberg Foundation, 2005.0098
QC 20110420Available from: 2011-04-20 Created: 2011-04-20 Last updated: 2011-04-20Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Tkachev, Vladimir G.
By organisation
Mathematics (Div.)
In the same journal
Annals of Global Analysis and Geometry

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 19 hits
ReferencesLink to record
Permanent link

Direct link