Abstract
We extend the definition and construct several bases for polylogarithms LiT, where T are some series, recognizable by a finite state (multiplicity) automaton of alphabet1X={x0,x1}. The kernel of this new “polylogarithmic map” Li• is also characterized and provides a rewriting process which terminates to a normal form. We concentrate on algebraic and analytic aspects of this extension allowing index polylogarithms at non-positive multi-indices, by rational series and regularize polyzetas at non-positive multi-indices2.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
