<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605526141</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100801.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150801xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10958-015-2494-2</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10958-015-2494-2</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Weighted Trees with Primitive Edge Rotation Groups</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[N. Adrianov, A. Zvonkin]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Let R, S ∈ ℂ[x] be two coprime polynomials of the same degree with prescribed multiplicities of their roots. A classical problem of number theory actively studied during the last half-century is, What could be the minimum degree of the difference T = R − S? The theory of dessins d'enfants implies that such a minimum is attained if and only if the rational function f = R/T is a Belyi function for a bicolored plane map all of whose faces except the outer one are of degree 1. Such maps are called weighted trees, since they can be conveniently represented by plane trees whose edges are endowed with positive integral weights. It is well known that the absolute Galois group (the automorphism group of the field ℚ ¯ $$ \overline{\mathbb{Q}} $$ of algebraic numbers) acts on dessins. An important invariant of this action is the edge rotation group, which is also the monodromy group of a ramified covering corresponding to the Belyi function. In this paper, we classify all weighted trees with primitive edge rotation groups. There are, up to the color exchange, 184 such trees, which are subdivided into (at least) 85 Galois orbits and generate 34 primitive groups (the highest degree is 32). This result may also be considered as a contribution to the classification of covering of genus 0 with primitive monodromy groups in the framework of the Guralnick-Thompson conjecture.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2015</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Adrianov</subfield>
   <subfield code="D">N.</subfield>
   <subfield code="u">Lomonosov Moscow State University, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Zvonkin</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">University of Bordeaux, Bordeaux, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Mathematical Sciences</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">209/2(2015-08-01), 160-191</subfield>
   <subfield code="x">1072-3374</subfield>
   <subfield code="q">209:2&lt;160</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">209</subfield>
   <subfield code="o">10958</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10958-015-2494-2</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</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/s10958-015-2494-2</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">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Adrianov</subfield>
   <subfield code="D">N.</subfield>
   <subfield code="u">Lomonosov Moscow State University, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Zvonkin</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">University of Bordeaux, Bordeaux, France</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">Journal of Mathematical Sciences</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">209/2(2015-08-01), 160-191</subfield>
   <subfield code="x">1072-3374</subfield>
   <subfield code="q">209:2&lt;160</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">209</subfield>
   <subfield code="o">10958</subfield>
  </datafield>
 </record>
</collection>
