<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445837039</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145333.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20111001xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00209-010-0749-7</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00209-010-0749-7</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Rotman</subfield>
   <subfield code="D">Regina</subfield>
   <subfield code="u">Department of Mathematics, University of Toronto, M5S 2E4, Toronto, ON, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Flowers on Riemannian manifolds</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Regina Rotman]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, we will present two upper bounds for the length of a smallest &quot;flower-shaped” geodesic net in terms of the volume and the diameter of a manifold. Minimal geodesic nets are critical points of the length functional on the space of graphs immersed into a Riemannian manifold. Let M n be a closed Riemannian manifold of dimension n. We prove that there exists a minimal geodesic net that consists of one vertex and at most 2n−1 geodesic loops based at that vertex of total length ≤ 2n!d, where d is the diameter of M n. We also show that there exists a minimal geodesic net that consists of one vertex and at most $${3^{(n+1)^2}}$$ loops of total length $${\leq2 (n+1)!^2 3^{(n+1)^3}\,Fill\,Rad\,M^n \leq2(n+1)!^{\frac{5}{2}}3^{(n+1)^3}(n+1)n^n vol(M^n)^{\frac{1}{n}}}$$, where FillRadM n denotes the filling radius and vol(M n) denotes the volume of M n.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 2010</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Mathematische Zeitschrift</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">269/1-2(2011-10-01), 543-554</subfield>
   <subfield code="x">0025-5874</subfield>
   <subfield code="q">269:1-2&lt;543</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">269</subfield>
   <subfield code="o">209</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00209-010-0749-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00209-010-0749-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Rotman</subfield>
   <subfield code="D">Regina</subfield>
   <subfield code="u">Department of Mathematics, University of Toronto, M5S 2E4, Toronto, ON, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Mathematische Zeitschrift</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">269/1-2(2011-10-01), 543-554</subfield>
   <subfield code="x">0025-5874</subfield>
   <subfield code="q">269:1-2&lt;543</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">269</subfield>
   <subfield code="o">209</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
