Displaying 21 – 40 of 248

Showing per page

Analytic and combinatoric aspects of Hurwitz polyzêtas

Jean-Yves Enjalbert, Hoang Ngoc Minh (2007)

Journal de Théorie des Nombres de Bordeaux

In this work, a symbolic encoding of generalized Di-richlet generating series is found thanks to combinatorial techniques of noncommutative rational power series. This enables to explicit periodic generalized Dirichlet generating series – particularly the coloured polyzêtas – as linear combinations of Hurwitz polyzêtas. Moreover, the noncommutative version of the convolution theorem gives easily rise to an integral representation of Hurwitz polyzêtas. This representation enables us to build the...

ARI/GARI, la dimorphie et l'arithmétique des multizêtas : un premier bilan

Jean Ecalle (2003)

Journal de théorie des nombres de Bordeaux

Nous tentons, dans ce survol, de présenter une structure méconnue : l'algèbre de Lie ARI et son groupe GARI. Puis nous montrons quels progrès elle a déjà permis de réaliser dans l'étude arithmético-algébrique des valeurs zêta multiples et aussi quelles possibilités elle ouvre pour l'exploration du phénomène plus général de /emph{dimorphie numérique}.

Bounds for double zeta-functions

Isao Kiuchi, Yoshio Tanigawa (2006)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

In this paper we shall derive the order of magnitude for the double zeta-functionof Euler-Zagier type in the region 0 s j < 1 ( j = 1 , 2 ) .First we prepare the Euler-Maclaurinsummation formula in a suitable form for our purpose, and then we apply the theory of doubleexponential sums of van der Corput’s type.

Circles passing through five or more integer points

Shaunna M. Plunkett-Levin (2013)

Acta Arithmetica

We find an improvement to Huxley and Konyagin’s current lower bound for the number of circles passing through five integer points. We conjecture that the improved lower bound is the asymptotic formula for the number of circles passing through five integer points. We generalise the result to circles passing through more than five integer points, giving the main theorem in terms of cyclic polygons with m integer point vertices. Theorem. Let m ≥ 4 be a fixed integer. Let W m ( R ) be the number of cyclic polygons...

Currently displaying 21 – 40 of 248