Independence of hyperlogarithms over function fields via algebraic combinatorics. - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2011

Independence of hyperlogarithms over function fields via algebraic combinatorics.

Résumé

We obtain a necessary and sufficient condition for the linear independence of solutions of differential equations for hyperlogarithms. The key fact is that the multiplier (i.e. the factor $M$ in the differential equation $dS=MS$) has only singularities of first order (Fuchsian-type equations) and this implies that they freely span a space which contains no primitive. We give direct applications where we extend the property of linear independence to the largest known ring of coefficients.
Fichier principal
Vignette du fichier
HL_after_sub_v5.pdf (161.1 Ko) Télécharger le fichier
llncs.cls (34.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00558773 , version 1 (24-01-2011)
hal-00558773 , version 2 (28-02-2014)
hal-00558773 , version 3 (22-01-2017)
hal-00558773 , version 4 (29-05-2020)

Identifiants

Citer

Matthieu Deneufchâtel, Gérard H.E. Duchamp, Vincel Hoang Ngoc Minh, Allan I. Solomon. Independence of hyperlogarithms over function fields via algebraic combinatorics.. Lecture Notes in Computer Science, Volume 6742 (2011),, 2011. ⟨hal-00558773v4⟩
323 Consultations
246 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More