<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445862610</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145448.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00031-011-9134-9</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00031-011-9134-9</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Glutsyuk</subfield>
   <subfield code="D">Alexey</subfield>
   <subfield code="u">Laboratoire J.-V.Poncelet, UMI 2615 du CNRS et l'Université Indépendante de Moscou, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Instability of nondiscrete free subgroups in lie groups</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Alexey Glutsyuk]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We study finitely-generated nondiscrete free subgroups in Lie groups. We address the following question first raised by Étienne Ghys: is it always possible to make arbitrarily small perturbations of the generators of the free subgroup in such a way that the new group formed by the perturbed generators be not free? In other words, is it possible to approximate generators of a free subgroup by elements satisfying a nontrivial relation? We prove that the answer to Ghys' question is positive and generalize this result to certain nonfree subgroups. We also consider the question on the best approximation rate in terms of the minimal length of relation in the approximating group. We give an upper bound on the optimal approximation rate as $$ {e^{ - c{l^\kappa }}} $$, where c &gt; 0 is a constant, l the minimal length of relation and 0.19 &lt; κ &lt; 0.2.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC, 2011</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Transformation Groups</subfield>
   <subfield code="d">SP Birkhäuser Verlag Boston</subfield>
   <subfield code="g">16/2(2011-06-01), 413-479</subfield>
   <subfield code="x">1083-4362</subfield>
   <subfield code="q">16:2&lt;413</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">16</subfield>
   <subfield code="o">31</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00031-011-9134-9</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/s00031-011-9134-9</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">Glutsyuk</subfield>
   <subfield code="D">Alexey</subfield>
   <subfield code="u">Laboratoire J.-V.Poncelet, UMI 2615 du CNRS et l'Université Indépendante de Moscou, Moscow, Russia</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">Transformation Groups</subfield>
   <subfield code="d">SP Birkhäuser Verlag Boston</subfield>
   <subfield code="g">16/2(2011-06-01), 413-479</subfield>
   <subfield code="x">1083-4362</subfield>
   <subfield code="q">16:2&lt;413</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">16</subfield>
   <subfield code="o">31</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>
