Computing Monodromy via Continuation Methods on Random Riemann Surfaces - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2011

Computing Monodromy via Continuation Methods on Random Riemann Surfaces


We consider a Riemann surface $X$ defined by a polynomial $f(x,y)$ of degree $d$, whose coefficients are chosen randomly. Hence, we can suppose that $X$ is smooth, that the discriminant $\delta(x)$ of $f$ has $d(d-1)$ simple roots, $\Delta$, and that $\delta(0) \neq 0$ i.e. the corresponding fiber has $d$ distinct points $\{y_1, \ldots, y_d\}$. When we lift a loop $0 \in \gamma \subset \Ci - \Delta$ by a continuation method, we get $d$ paths in $X$ connecting $\{y_1, \ldots, y_d\}$, hence defining a permutation of that set. This is called monodromy. Here we present experimentations in Maple to get statistics on the distribution of transpositions corresponding to loops around each point of $\Delta$. Multiplying families of ''neighbor'' transpositions, we construct permutations and the subgroups of the symmetric group they generate. This allows us to establish and study experimentally two conjectures on the distribution of these transpositions and on transitivity of the generated subgroups. Assuming that these two conjectures are true, we develop tools allowing fast probabilistic algorithms for absolute multivariate polynomial factorization, under the hypothesis that the factors behave like random polynomials whose coefficients follow uniform distributions.
On considere une surface de Riemann dont l'equation f(x,y)=0 est un polynome dont les coefficients sont des variables aleatoires Gaussiennes standards, ainsi que sa projection p sur l'axe des x. Puis on etudie et calcule des generateurs du groupe de monodromie correspondant a p.
Fichier principal
Vignette du fichier
TCS-galligo-poteaux.pdf (308.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00657291 , version 1 (06-01-2012)



André Galligo, Adrien Poteaux. Computing Monodromy via Continuation Methods on Random Riemann Surfaces. Theoretical Computer Science, 2011, 412 (16), pp.1492-1507. ⟨10.1016/j.tcs.2010.11.047⟩. ⟨hal-00657291⟩
348 View
263 Download



Gmail Facebook X LinkedIn More