# Independence of Hyperlogarithms over Function Fields via Algebraic Combinatorics

@inproceedings{Deneufchtel2011IndependenceOH,
title={Independence of Hyperlogarithms over Function Fields via Algebraic Combinatorics},
author={Matthieu Deneufch{\^a}tel and G{\'e}rard H. E. Duchamp and Vincel Hoang Ngoc Minh and Allan I. Solomon},
booktitle={CAI},
year={2011}
}
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.
39 Citations

#### Topics from this paper

Families of eulerian functions involved in regularization of divergent polyzetas
• Mathematics
• 2020
Extending the Eulerian functions, we study their relationship with zeta function of several variables. In particular, starting with Weierstrass factorization theorem (and Newton-Girard identity) forExpand
Picard-Vessiot Extensions For Unipotent Algebraic Groups
Let F be a differential field of characteristic zero. In this article, we construct Picard-Vessiot extensions of F whose differential Galois group is isomorphic to the full unipotent subgroup of theExpand
On the solutions of the universal differential equation with three regular singularities (On solutions of KZ 3 )
This review concerns the resolution of a special case of Knizhnik-Zamolodchikov equations (KZ3) and our recent results on combinatorial aspects of zeta functions on several variables. In particular,Expand
Kleene stars of the plane, polylogarithms and symmetries
Algebraic and analytic aspects of this extension allowing index polylogarithms at non positive multi-indices, by rational series and regularize polyzetas at non negative multi-Indices are concentrated on. Expand
On Drinfel'd associators
• Mathematics, Computer Science
• ArXiv
• 2017
These formal series can be considered as a class of associators and an interpretation of them are given as well as some new tools over Noncommutative Evolution Equations. Expand
A ug 2 02 0 A localized version of the basic triangle theorem Lie-theoretic aspects of the basic triangle theorem
In this paper, we examine some aspects of the BTT (basic triangle theorem), first published in 2011 (see [8]). In a first part, we review the interplay between integration of Non CommutativeExpand
Combinatorics of $\phi$-deformed stuffle Hopf algebras
• Mathematics, Computer Science
• 2013
The combinatorial aspects of the Hopf algebra of the φ-deformed stuffle product is developed systematically in a parallel way with those of the shuffle product to give an effective construction of pair of bases in duality. Expand
Computer Algebra in Scientific Computing
• Computer Science
• Lecture Notes in Computer Science
• 2015
This work proposes an algorithm based on the resolving procedure which is proposed as a suitable auxiliary tool for finding hypergeometric solutions of scalar linear difference equations with rational-function coefficients for a first-order system of such equations. Expand
A localized version of the basic triangle theorem
• Computer Science, Mathematics
• ArXiv
• 2019
A localized version of the basic triangle theorem is given in order to prove the independence of hyperlogarithms over various function fields and provides direct access to rings of scalars and avoids the recourse to fraction fields as that of meromorphic functions for instance. Expand
A ug 2 02 0 Towards a noncommutative Picard-Vessiot theory
A Chen generating series, along a path and with respect to m differential forms, is a noncommutative series on m letters and with coefficients which are holomorphic functions over a simply connectedExpand

#### References

SHOWING 1-10 OF 26 REFERENCES
Shuffle algebra and polylogarithms
• Computer Science, Mathematics
• Discret. Math.
• 2000
It is proved that the algebra of polylogarithms is isomorphic to a shue algebra, and the monodromy formulae involve special constants, called multiple zeta values. Expand
Galois Theory of Linear Differential Equations
• Mathematics
• 2012
Linear differential equations form the central topic of this volume, Galois theory being the unifying theme. A large number of aspects are presented: algebraic theory especially differential GaloisExpand
Un critère de rationalité provenant de la géométrie non commutative
• Mathematics
• 1997
We prove a conjecture of A. Connes, which gives a rationality criterion for elements of the closure of ℂΓ (Γ a free group) in the space of bounded operators in l2(Γ). We show that this criterionExpand
On the exponential solution of differential equations for a linear operator
The present investigation was stimulated by a recent paper of K. 0. Friedrichs 113, who arrived at some purely algebraic problems in connection with the theory of linear operators in quantumExpand
Free Lie Algebras
Introduction 1. Free Lie algebras 2. Lie polynomials 3. Algebraic properties 4. Logarithms and exponentials 5. Hall bases 6. Applications of Hall sets 7. Shuffle algebra and subwords 8. CircularExpand
An Operator calculus having applications in quantum electrodynamics
An alteration in the notation used to indicate the order of operation of noncommuting quantities is suggested. Instead of the order being defined by the position on the paper, an ordering subscriptExpand
Structural Properties of Polylogarithms
The evolution of the ladder concept by L. Lewin Dilogarithmic ladders by L. Lewin Polylogarithmic ladders by M. Abouzahra and L. Lewin Ladders in the trans-Kummer region by M. Abouzahra and L. LewinExpand
Theory of sets
The theory of sets is a theory which contains the relational signs =, ∈ and the substantific sign ⊃ (all these signs being of weight 2); in addition to the schemes S1 to S7 given in Chapter I, itExpand
Fonctionnelles causales non linaires et indtermines non commutatives
— Thé foundations ofa theory of non-lmear causal functionals are laid down using non-commutative indeterminates.
Rational series and their languages
• Mathematics, Computer Science
• EATCS monographs on theoretical computer science
• 1988
This chapter discusses the development of Rational Series over a Principal Ring, a model based on the model developed in Chapter I, and its applications to Languages and Codes. Expand