An example of generalization of the Bernoulli numbers and polynomials to any dimension

Size: px
Start display at page:

Download "An example of generalization of the Bernoulli numbers and polynomials to any dimension"

Transcription

1 An example of generalization of the Bernoulli numbers and polynomials to any dimension Olivier Bouillot, Villebon-Georges Charpak institute, France C.A.L.I.N. team seminary. Tuesday, 29 th March 26.

2 Introduction Definition: The numbers Ze s,,s r defined by Ze s,,s r = <n r < <n n s nr s r, where s,, s r C such that R(s + + s k ) > k, k [[ ; r ]], are called multiple zeta values. Fact: There exist at least three different way to renormalize multiple zeta values at negative integers. Ze, 2 MP () = 7 72, Ze, 2 GZ () = 2, Ze, 2 FKMT () = 8. Question: Is there a group acting on the set of all possible multiple zeta values renormalisations? Main goal: Define multiple Bernoulli numbers in relation with this.

3 Outline Reminders Reminders on Bernoulli Polynomials and Numbers Reminders on Hurwitz Zeta Function and Hurwitz multiple zeta functions Reminders on Quasi-Symmetric Functions 2 Algebraic reformulation of the problem 3 The Structure of a Multiple Bernoulli Polynomial 4 The General Reflexion Formula of Multiple Bernoulli Polynomial 5 An Example of Multiple Bernoulli Polynomial 6 An algorithm to compute the double Bernoulli Numbers 7 Properties satisfied by Bernoulli polynomials and numbers

4 Outline Reminders Reminders on Bernoulli Polynomials and Numbers Reminders on Hurwitz Zeta Function and Hurwitz multiple zeta functions Reminders on Quasi-Symmetric Functions

5 Two Equivalent Definitions of Bernoulli Polynomials / Numbers Bernoulli numbers: By a generating function: Bernoulli polynomials: By a generating function: t e t = t n b n n!. te xt e t = B n(x) tn n!. n n By a recursive formula: By a recursive formula: b =, n N, n k= ( ) n + b k k =. First examples: B (x) =, n N, B n+(x) = (n + )B n(x), n N, B n(x) dx =. First examples: b n =, 2, 6,, 3,, 42, B(x) =, B (x) = x 2, B 2(x) = x 2 x + 6,.

6 Elementary properties satisfied by the Bernoulli polynomials and numbers P b 2n+ = if n >. P2 B n() = B n() if n >. P3 m ( ) m + b k k =, m >. P4 k= B n(z) = nb n (z) if n >. n ( n B n(x + y) = k k= ) B k (x)y n k for all n. P5 B n(x + ) B n(x) = nx n, for all n. P6 ( ) n B n( x) = B n(x), for all n. P7 P8 P9 N k n = k= x Bn+(N) Bn+() n + Bn+(x) Bn+(a) B n(t) dt =. a n + m ( B n(mx) = m n B n x + k ) for all m > and n. m k=.

7 Elementary properties satisfied by the Bernoulli polynomials and numbers P b 2n+ = if n >. Have to be extended, P2 B n() = B n() if n >. but is not restritive enough. P3 P4 m k= ( m + k ) b k =, m >. B n(z) = nb n (z) if n >. n ( n B n(x + y) = k k= ) B k (x)y n k for all n. P5 B n(x + ) B n(x) = nx n, for all n. P6 ( ) n B n( x) = B n(x), for all n. P7 N k p = k= Bn+(N) Bn+() n +. P8 P9 x a B n(t) dt = Bn+(x) Bn+(a) n + m ( B n(mx) = m n B n x + k ) for all m > and n. m k=.

8 Elementary properties satisfied by the Bernoulli polynomials and numbers P b 2n+ = if n >. Have to be extended, P2 B n() = B n() if n >. but is not restritive enough. P3 P4 m k= ( m + k ) b k =, m >. B n(z) = nb n (z) if n >. n ( n B n(x + y) = k k= Has to be extended, but too particular. ) B k (x)y n k for all n. P5 B n(x + ) B n(x) = nx n, for all n. P6 ( ) n B n( x) = B n(x), for all n. P7 N k p = k= Bn+(N) Bn+() n +. P8 P9 x a B n(t) dt = Bn+(x) Bn+(a) n + m ( B n(mx) = m n B n x + k ) for all m > and n. m k=.

9 Elementary properties satisfied by the Bernoulli polynomials and numbers P b 2n+ = if n >. Have to be extended, P2 B n() = B n() if n >. but is not restritive enough. P3 P4 m k= ( m + k ) b k =, m >. B n(z) = nb n (z) if n >. n ( n B n(x + y) = k k= Has to be extended, but too particular. ) B k (x)y n k for all n. P5 B n(x + ) B n(x) = nx n, for all n. P6 ( ) n B n( x) = B n(x), for all n. Important property, but turns out to have a generalization with a corrective term... P7 N k p = k= Bn+(N) Bn+() n +. P8 P9 x a B n(t) dt = Bn+(x) Bn+(a) n + m ( B n(mx) = m n B n x + k ) for all m > and n. m k=.

10 Elementary properties satisfied by the Bernoulli polynomials and numbers P b 2n+ = if n >. Have to be extended, P2 B n() = B n() if n >. but is not restritive enough. P3 P4 m k= ( m + k ) b k =, m >. B n(z) = nb n (z) if n >. n ( n B n(x + y) = k k= Has to be extended, but too particular. ) B k (x)y n k for all n. Important property, but turns out to have a generalization with a corrective term... P5 B n(x + ) B n(x) = nx n, for all n. Has to be extended, but how??? P6 ( ) n B n( x) = B n(x), for all n. P7 N k p = k= Bn+(N) Bn+() n +. P8 P9 x a B n(t) dt = Bn+(x) Bn+(a) n + m ( B n(mx) = m n B n x + k ) for all m > and n. m k=.

11 Elementary properties satisfied by the Bernoulli polynomials and numbers P b 2n+ = if n >. Have to be extended, P2 B n() = B n() if n >. but is not restritive enough. P3 P4 m k= ( m + k ) b k =, m >. B n(z) = nb n (z) if n >. n ( n B n(x + y) = k k= Has to be extended, but too particular. ) B k (x)y n k for all n. Important property, but turns out to have a generalization with a corrective term... P5 B n(x + ) B n(x) = nx n, for all n. Has to be extended, but how??? P6 ( ) n B n( x) = B n(x), for all n. Has to be extended, but how??? P7 N k p = k= Bn+(N) Bn+() n +. P8 P9 x a B n(t) dt = Bn+(x) Bn+(a) n + m ( B n(mx) = m n B n x + k ) for all m > and n. m k=.

12 Elementary properties satisfied by the Bernoulli polynomials and numbers P b 2n+ = if n >. Have to be extended, P2 B n() = B n() if n >. but is not restritive enough. P3 P4 m k= ( m + k ) b k =, m >. B n(z) = nb n (z) if n >. n ( n B n(x + y) = k k= Has to be extended, but too particular. ) B k (x)y n k for all n. Important property, but turns out to have a generalization with a corrective term... P5 B n(x + ) B n(x) = nx n, for all n. Has to be extended, but how??? P6 ( ) n B n( x) = B n(x), for all n. Has to be extended, but how??? P7 N k p = k= Bn+(N) Bn+() n +. Does not depend of the Bernoulli numbers... P8 P9 x a B n(t) dt = Bn+(x) Bn+(a) n + m ( B n(mx) = m n B n x + k ) for all m > and n. m k=.

13 Elementary properties satisfied by the Bernoulli polynomials and numbers P b 2n+ = if n >. Have to be extended, P2 B n() = B n() if n >. but is not restritive enough. P3 P4 m k= ( m + k ) b k =, m >. B n(z) = nb n (z) if n >. n ( n B n(x + y) = k k= Has to be extended, but too particular. ) B k (x)y n k for all n. Important property, but turns out to have a generalization with a corrective term... P5 B n(x + ) B n(x) = nx n, for all n. Has to be extended, but how??? P6 ( ) n B n( x) = B n(x), for all n. Has to be extended, but how??? P7 P8 P9 N k p = k= x a B n(t) dt = Bn+(N) Bn+() n + m B n(mx) = m n Bn+(x) Bn+(a) n + k=. Does not depend of the Bernoulli numbers.... Has a generalization using the derivative of a multiple Bernoulli polynomial instead of the Bernoulli polynmials. ( B n x + k ) for all m > and n. m

14 Elementary properties satisfied by the Bernoulli polynomials and numbers P b 2n+ = if n >. Have to be extended, P2 B n() = B n() if n >. but is not restritive enough. P3 P4 m k= ( m + k ) b k =, m >. B n(z) = nb n (z) if n >. n ( n B n(x + y) = k k= Has to be extended, but too particular. ) B k (x)y n k for all n. Important property, but turns out to have a generalization with a corrective term... P5 B n(x + ) B n(x) = nx n, for all n. Has to be extended, but how??? P6 ( ) n B n( x) = B n(x), for all n. Has to be extended, but how??? P7 P8 P9 N k p = k= x a B n(t) dt = Bn+(N) Bn+() n + m B n(mx) = m n Bn+(x) Bn+(a) n + k=. Does not depend of the Bernoulli numbers.... Has a generalization using the derivative of a multiple Bernoulli polynomial instead of the Bernoulli polynmials. ( B n x + k ) for all m > and n.??? m

15 Outline Reminders Reminders on Bernoulli Polynomials and Numbers Reminders on Hurwitz Zeta Function and Hurwitz multiple zeta functions Reminders on Quasi-Symmetric Functions

16 On the Hurwitz Zeta Function Definition: The Hurwitz Zeta Function is defined, for Re s >, and z C N <, by: ζ(s, z) = n> (n + z) s. Property: ζ z H (s, z) = sζ(s +, z). ( s n ζ(s, x + y) = n ) ζ(s + n, x)y n. H2 ζ(s, z ) ζ(s, z) = z s. m ( H3 ζ(s, mz) = m s ζ s, z + k ) if m N. m k=

17 Link between the Hurwitz Zeta Function and the Bernoulli polynomials Property: s ζ(s, z) can be analytically extend to a meromorphic function on C, with a simple pole located at. Remark: ζ( n, z) = Bn+(z) n + Related properties: for all n N. ζ( n, ) = bn+ for all n N. n + Hurwitz zeta function Bernoulli polynomials Derivative property H P4 Difference equation H2 P5 Multiplication theorem H3 P9 Consequence: The extension from Bernoulli to multiple Bernoulli polynomials will be done using a generalization of the Hurwitz zeta function: the Hurwitz multiple zeta functions.

18 On Hurwitz Multiple Zeta Functions Definition of Hurwitz Multiple Zeta Functions He s,,s r (z) =, if z C N (n + z) s < and <n r < <n (nr + z) sr (s,, s r ) (N ) r, such that s 2. Lemma : (B., J. Ecalle, 22) For all sequences (s,, s r ) (N ) r, s 2, we have: He s,,s r (z ) He s,,s r (z) = He s,,s r (z) z sr. Lemma 2: The Hurwitz Multiple Zeta Functions multiply by the stuffle product (of N ). Reminder: If (Ω, +) is a semi-group, the stuffle is defined over Ω by: { ε u = u ε = u. ua vb = (u vb) a + (ua v) b + (u v)(a + b).

19 Outline Reminders Reminders on Bernoulli Polynomials and Numbers Reminders on Hurwitz Zeta Function and Hurwitz multiple zeta functions Reminders on Quasi-Symmetric Functions

20 Reminders on Quasi-symmetric functions Definition: Let x = {x, x 2, x 3, } be an infinite commutative alphabet. A series is said to be quasi-symmetric when its coefficient of x s x r sr to this of x s i x sr i r for all i < < i r. is equals Example : M 2,(x, x 2, x 3,...) = x 2 x 2 + x 2 x x 2 x n + + x 2 2 x 3 + x x 2 2 is not in M 2, but in M,2. Fact : Quasi-symmetric functions span a vector space: QSym. A basis of QSym is given by the monomials M I, for composition I = (i,, i r ): M i,,i r (X ) = x i n xn ir r <n < <n r Fact 2: QSym is an algebra whose product is the stuffle product. QSym is also a Hopf algebra whose coproduct is given by: ( M i,,i r (x) ) = r M i,,i k (x) M ik+,,i r (x). k=

21 Outline Reminders 2 Algebraic reformulation of the problem 3 The Structure of a Multiple Bernoulli Polynomial 4 The General Reflexion Formula of Multiple Bernoulli Polynomial 5 An Example of Multiple Bernoulli Polynomial 6 An algorithm to compute the double Bernoulli Numbers 7 Properties satisfied by Bernoulli polynomials and numbers

22 Main Goal Heuristic: B s,,s r (z) = Multiple (Divided) Bernoulli Polynomials = He s,, s r (z). b s,,s r = Multiple (Divided) Bernoulli Numbers = He s,, s r (). We want to define B s,,s r (z) such that: their properties are similar to Hurwitz Multiple Zeta Functions properties. their properties generalize these of Bernoulli polynomials. Main Goal: Find some polynomials B s,,s r such that: B n (z) = Bn+(z) n +, where n, B n,,n r (z + ) B n,,n r (z) = B n,,n r (z)z nr, for n,, n r, the B n,,n r multiply by the stuffle product.

23 An algebraic construction Notation : Let X = {X,, X n, } be a (commutative) alphabet of indeterminates. We denotes: B Y,,Y r (z) = for all r N, Y,, Y r X. n,,n r B n,,n r (z) Y n n Y r nr! n r!, Remark: B Y,,Y r (z + ) B Y,,Y r (z) = B Y,,Y r (z)e zyr. Notation 2: Let A = {a,, a n, } be a non-commutative alphabet. We denotes: B(z) = + B X k,,x kr (z)a k a kr C[z][[X]] A. r> k,,k r > ( Remark: B(z + ) = B(z) + ) e zx k a k k>

24 The abstract construction in the case of quasi-symmetric functions Let see an analogue of B(z) where the multiple Bernoulli polynomials are replaced with the monomial functions M I (x) of QSym: M Y,,Y r (x) := n,,n r M n +,,n r +(x) Y n n Y r nr! n r!, for all Y,, Y r X. M := + M X k,,x kr (x) a k a kr r> k,,k r > = + r ( + x ne xnx k a k )M X k,,x kr (x) r> <p < <p r i= k> ( = + x ne xnx k a k ) C[[x]][[X]] A. n> k> Computation of the coproduct of M: (which does not act on the X s) M Y,,Y r (x) = M = M M. r M Y,...,Y k (x) M Y k+,...,y r (x). k=

25 Transcription of the multiplication by the stuffle Property: (J. Y. Thibon, F. Chapoton, J. Ecalle, F. Menous, D. Sauzin,...) A family of objects (B n,,n r ) n,n 2,n 3, multiply by the stuffle product if, and only if, there exists a character χ z of QSym such that χ z ( Mn +,,n r +(x) ) = B n,,n r (z) () Consequences:. χ z can be extended to QSym[[X]], applying it terms by terms. ) χ z (M Y,,Y r (x) = B Y,,Y r (z), for all Y,, Y r X. 2. If B n,,n r multiply the stuffle, B = χ z(m) is group-like in C[z][[X]] A.

26 Reformulation of the main goal Reformulation of the main goal Find some polynomials B n,,n r such that: B(z) a k = ezx k, e X k X k B(z + ) = B(z) E(z), where E(z) = + k> e zx k a k, B is a group-like element of C[z][[X]] A.

27 Outline Reminders 2 Algebraic reformulation of the problem 3 The Structure of a Multiple Bernoulli Polynomial 4 The General Reflexion Formula of Multiple Bernoulli Polynomial 5 An Example of Multiple Bernoulli Polynomial 6 An algorithm to compute the double Bernoulli Numbers 7 Properties satisfied by Bernoulli polynomials and numbers

28 A singular solution Remainder: E(z) = + k> e zx k a k. From a false solution to a singular solution... S(z) = n> E(z n) = + r> k,,k r > B(z) a k = false solution to system i= e z(x k + +X kr ) a r k a kr is a (e X k + +X ki ) ezx k e X k X k, B(z + ) = B(z) E(z), B is a group-like element of C[z][[X]] A. Explanations:. B(z) = = B(z n) E(z n) E(z ) ( ) = = lim B(z n) E(z n). n + 2. S(z) C[z]((X)) A, S(z) C[z][[X]] A. Heuristic: Find a correction of S, to send it into C[z][[X]] A. n>

29 Another solution Fact: If (f )(z) = f (z ) f (z), ker zc[z] = {}. Consequence: There exist a unique family of polynomials such that: { B n,,n r (z + ) B n,,n r (z) = B n,,n r (z)z nr. B n,,n r () =. This produces a series B C[z][[X]] A defined by: B (z) = + B X k,,x kr (z) a k a kr. r> Lemma: (B., 23) k,,k r > The noncommutative series B is a group-like element of C[z][[X]] A. 2 The coefficients of B (z) satisfy a recurence relation: B Y (z) = ezy, Y e Y X. B Y,,Y r (z) = BY +Y 2,Y 3,,Y r (z) B Y 2,Y 3,,Y r (z), Y e Y,, Y r X. 3 The series B can be expressed in terms of S: B (z) = ( S() ) S(z).

30 Characterization of the set of solutions Reminder: A family of multiple Bernoulli polynomials produces a series B such that: B(z + ) = B(z) E(z), where E(z) = + e zx k a k, k> B is a group-like element of C[z][[X]] A, B(z) a k = Proposition: (B. 23) ezx k e X k X k. Any familly of polynomials which are solution of the previous system comes from a noncommutative series B C[z][[X]] A such that there exists b C[[X]] A satisfying:. b A k = 2. b is group-like e X k X k 3. B(z) = b B = b (S() ) S(z). Theorem: (B., 23) The subgroup of group-like series of C[z][[X]] A, with vanishing coefficients in length, acts on the set of all possible multiple Bernoulli polynomials, i.e. on the set of all possible algebraic renormalization.

31 Outline Reminders 2 Algebraic reformulation of the problem 3 The Structure of a Multiple Bernoulli Polynomial 4 The General Reflexion Formula of Multiple Bernoulli Polynomial 5 An Example of Multiple Bernoulli Polynomial 6 An algorithm to compute the double Bernoulli Numbers 7 Properties satisfied by Bernoulli polynomials and numbers

32 Some notations New Goal: From B(z) = b B, determine a suitable series b such that the reflexion formula ( ) n B n( z) = B n(z), n N has a nice generalization. For a generic series s C[z][[X ]] A, s(z) = r N s X k,,x kr (z) a k a kr, k,,k r > we consider: s(z) = r N s(z) = r N s X kr,,x k (z) ak a kr k,,k r > k,,k r > s X k,, X kr (z) a k a kr

33 The reflection equation for B (z) Proposition: (B. 24) Let sg = + r> k,,k r > ( ) r a k a kr = ( + n> a n ). Then, S() = ( S() ) sg and S( z) = ( S(z) ). Corollary : (B. 24) For all z C, we have: sg B ( z) = ( B (z) ). Example: X, Y, Z B X,Y,Z X +Y,Z X,Y +Z ( z) = B (z) B (z) B (z) X +Y +Z B (z) + B Y,Z (z) + B Y +Z (z).

34 The generalization of the reflection formula Corollary 2: (B. 24) B( z) B(z) = b sg b. (2) Remark: S() sg S() =. Heuristic: A reasonable candidate for a multi-bernoulli polynomial comes from the coefficients of a series B(z) = b B (z) where b satisfies:. b a k = 2. b is group-like e X k X k 3. b sg b =.

35 Outline Reminders 2 Algebraic reformulation of the problem 3 The Structure of a Multiple Bernoulli Polynomial 4 The General Reflexion Formula of Multiple Bernoulli Polynomial 5 An Example of Multiple Bernoulli Polynomial 6 An algorithm to compute the double Bernoulli Numbers 7 Properties satisfied by Bernoulli polynomials and numbers

36 Resolution of an equation Goal: Characterise the solutions of { ũ sg u =. u is group-like. Proposition: (B., 24) ( ) r 2 2r ( ) 2r a r k a kr.. Let us denote sg = + r> k,,k r > Any group-like solution u of ũ sg u = comes from a primitive series v satisfying v + ṽ =, and is given by: u = exp(v) sg. If moreover u a k = e X k X k, then necessarily, we have: v a k = e X k X k + 2 := f (X k).

37 The choice of a series v New goal: Find a nice series v satisfying:. v is primitive. 2. v + ṽ =. 3. v a k = Remark: v a k is an odd formal series in X k X. Generalization: ṽ = v, so v = v. e X k X k + 2 = f (X k). = v a k a k2 = 2 f (X k + X k2 ), but does not determine v a k a k2 a k3. A restrictive condition: A natural condition is to have: there exists α r C such that v a k a kr = α r f (X k + + X kr ). Now, there is a unique primitive series v satisfying this condition and the new goal: v a k a kr = ( )r f (X k + + X kr ). r

38 Definition Definition : (B., 24) The series B(z) and b defined by { B(z) = exp(v) Sg (S()) S(z) b = exp(v) Sg are noncommutative series of C[z][[X]] A whose coefficients are respectively the exponential generating functions of multiple Bernoulli polynomials and multiple Bernoulli numbers. Example: The exponential generating function of bi-bernoulli polynomials and numbers are respectively: n,n 2 B n,n 2 (z) X n Y n 2 n! n 2! = 2 f (X + Y ) + 2 f (X )f (Y ) 2 f (X ) f (X ) ezy e Y 2 e zy e Y e z(x +Y ) + (e X )(e X +Y ) e zy (e X )(e Y ).

39 Examples of explicit expression for multiple Bernoulli numbers: Consequently, we obtain explicit expressions like, for n, n 2, n 3 > : b n,n 2 = 2 ( bn + ) b n2 + n + n 2 + bn +n 2 +. n + n 2 + b n + b n2 + b n3 + b n,n 2,n 3 = + 6 n + n 2 + n 3 + ( ) bn +n 2 + b n3 + 4 n + n 2 + n bn + b n2 +n 3 + n + n 2 + n 3 + b n +n 2 +n n + n 2 + n 3 +. Remark: If n =, n 2 = or n 3 =, the expressions are not so simple...

40 Table of Multiple Bernoulli Numbers in length 2 b p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 3 q = 8 2 q = q = 2 24 q = q = 4 54 q =

41 Outline Reminders 2 Algebraic reformulation of the problem 3 The Structure of a Multiple Bernoulli Polynomial 4 The General Reflexion Formula of Multiple Bernoulli Polynomial 5 An Example of Multiple Bernoulli Polynomial 6 An algorithm to compute the double Bernoulli Numbers 7 Properties satisfied by Bernoulli polynomials and numbers

42 Table of Multiple Bernoulli Numbers in length 2 b p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 3 q = q = q = q = q = q = one out of four Multiple Bernoulli Numbers is null

43 Table of Multiple Bernoulli Numbers in length 2 be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = q = q = q = one out of four Multiple Bernoulli Numbers is null. one out of two antidiagonals is constant

44 Table of Multiple Bernoulli Numbers in length 2 be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = q = q = q = one out of four Multiple Bernoulli Numbers is null. one out of two antidiagonals is constant. symmetrie relatively to p = q

45 Table of Multiple Bernoulli Numbers in length 2 be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 3 q = q = q = q = q = q = one out of four Multiple Bernoulli Numbers is null. one out of two antidiagonals is constant. symmetrie relatively to p = q cross product around the zeros are equals : =

46 Construction Table of Multiple Bernoulli Numbers in length 2 From these previous remarks, let us present an algorithm to compute bi-bernoulli numbers. b p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = 2 q = 3 q = 4 q = 5 q = 6

47 Construction Table of Multiple Bernoulli Numbers in length 2 From these previous remarks, let us present an algorithm to compute bi-bernoulli numbers. be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = 2 q = 3 q = 4 q = 5 q = 6 48

48 Construction Table of Multiple Bernoulli Numbers in length 2 From these previous remarks, let us present an algorithm to compute bi-bernoulli numbers. be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = 2 24 q = q = 4 54 q = q =

49 Construction Table of Multiple Bernoulli Numbers in length 2 From these previous remarks, let us present an algorithm to compute bi-bernoulli numbers. be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = 2 24 q = q = 4 54 q = q =

50 Construction Table of Multiple Bernoulli Numbers in length 2 From these previous remarks, let us present an algorithm to compute bi-bernoulli numbers. be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = 2 24 q = q = 4 54 q = q =

51 Construction Table of Multiple Bernoulli Numbers in length 2 From these previous remarks, let us present an algorithm to compute bi-bernoulli numbers. be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = 2 24 q = q = 4 54 q = q =

52 Construction Table of Multiple Bernoulli Numbers in length 2 From these previous remarks, let us present an algorithm to compute bi-bernoulli numbers. be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = 2 24 q = q = 4 54 q = q =

53 Construction Table of Multiple Bernoulli Numbers in length 2 From these previous remarks, let us present an algorithm to compute bi-bernoulli numbers. be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 q = q = q = 2 24 q = q = 4 54 q = q =

54 Construction Table of Multiple Bernoulli Numbers in length 2 From these previous remarks, let us present an algorithm to compute bi-bernoulli numbers. be p,q p = p = p = 2 p = 3 p = 4 p = 5 p = 6 3 q = 8 2 q = q = 2 24 q = q = 4 54 q = q =

55 Outline Reminders 2 Algebraic reformulation of the problem 3 The Structure of a Multiple Bernoulli Polynomial 4 The General Reflexion Formula of Multiple Bernoulli Polynomial 5 An Example of Multiple Bernoulli Polynomial 6 An algorithm to compute the double Bernoulli Numbers 7 Properties satisfied by Bernoulli polynomials and numbers

56 Properties satisfied by multiple Bernoulli polynomials Proposition: (B., 23) The multiple Bernoulli polynomials B n,,n r multiply the stuffle. Theorem: (B., 24) P All multiple Bernoulli numbers satisfy : b 2p,,2p r =. P 2 If n r >, B n,,n r () = B n,,n r (). P 5 B n,,n r (z + ) B n,,n r (z) = B n,,n r (z) z nr. P 6 There exists a reflexion formula for multiple Bernoulli polynoms: B( z) B(z) =. P 7 The truncated multiple sums of powers S s,,s r N, defined by S s,,s r s s N = n n r r n r < <n <N are given by the coefficients of B (N).

57 Properties satisfied by multiple Bernoulli polynomials 2 Proposition: (B. 24) For all positive integers n,, n r, b n,,n r = b nr,,n. Proposition: (B., 24) For a series s(z) C[z][[X ]] A, let us define (s)(z) by: (s)(z) = X k X kr s(z) a k a kr a k a kr. r N is a derivation, and : k,,k r > P 4 The derivation of multiple Bernoulli polynomials are given by: ( zb(z) = b S() ) ( b S() ) B(z) + (B(z)).

58 Properties satisfied by multiple Bernoulli polynomials 3 Proposition: (B., 25) P 3 ( The recurrence relation of bi-bernoulli numbers is (partially) given by: p ( )( ) q p q 2 )be k,l be p,q = k l k= l= ( 2 ) ( p + 2 ) q + ( + 2 ) ( be q + be p p + 2 ) q + ( 2 ) ( ) p + 2 p + q + if p, q >. be p + 3 4

59 Conclusion. We have respectively defined the Multiple (divided) Bernoulli Polynomials and Multiple (divided) Bernoulli Numbers by: { B(z) = exp(v) Sg (S()) S(z) b = exp(v) Sg They both multiply the stuffle. 2. The Multiple Bernoulli Polynomials satisfy a nice generalization of: the nullity of b 2n+ if n >. the symmetry B n() = B n() if n >. the difference equation (B n)(x) = nx n. the reflection formula ( ) n B n( x) = B n(x). THANK YOU FOR YOUR ATTENTION!

Multiple Bernoulli Polynomials and Numbers

Multiple Bernoulli Polynomials and Numbers Multiple Bernoulli Polynomials and Numbers Olivier Bouillot, Paris-Sud University Abstract The aim of this work is to describe what can be multiple Bernoulli polynomials. In order to do this, we solve

More information

Multiple divisor functions, their algebraic structure and the relation to multiple zeta values

Multiple divisor functions, their algebraic structure and the relation to multiple zeta values Multiple divisor functions, their algebraic structure and the relation to multiple zeta values Kyushu University - 13th November 2013 joint work: H.B., Ulf Kühn, arxiv:1309.3920 [math.nt] Multiple

More information

x 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?

x 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line? 1 How many natural numbers are between 1.5 and 4.5 on the number line? 2 How many composite numbers are between 7 and 13 on the number line? 3 How many prime numbers are between 7 and 20 on the number

More information

The algebra of multiple divisor functions and applications to multiple zeta values

The algebra of multiple divisor functions and applications to multiple zeta values The algebra of multiple divisor functions and applications to multiple zeta values ESF Workshop: New Approaches To Multiple Zeta Values ICMAT Madrid - 30th September 2013 joint work: H.B., Ulf Kühn, arxiv:1309.3920

More information

THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS BERNOULLI POLYNOMIALS AND RIEMANN ZETA FUNCTION

THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS BERNOULLI POLYNOMIALS AND RIEMANN ZETA FUNCTION THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS BERNOULLI POLYNOMIALS AND RIEMANN ZETA FUNCTION YIXUAN SHI SPRING 203 A thesis submitted in partial fulfillment of the

More information

Transcendental Numbers and Hopf Algebras

Transcendental Numbers and Hopf Algebras Transcendental Numbers and Hopf Algebras Michel Waldschmidt Deutsch-Französischer Diskurs, Saarland University, July 4, 2003 1 Algebraic groups (commutative, linear, over Q) Exponential polynomials Transcendence

More information

AN EXACT SEQUENCE FOR THE BROADHURST-KREIMER CONJECTURE

AN EXACT SEQUENCE FOR THE BROADHURST-KREIMER CONJECTURE AN EXACT SEQUENCE FOR THE BROADHURST-KREIMER CONJECTURE FRANCIS BROWN Don Zagier asked me whether the Broadhurst-Kreimer conjecture could be reformulated as a short exact sequence of spaces of polynomials

More information

Lecture III. Five Lie Algebras

Lecture III. Five Lie Algebras Lecture III Five Lie Algebras 35 Introduction The aim of this talk is to connect five different Lie algebras which arise naturally in different theories. Various conjectures, put together, state that they

More information

On the renormalization problem of multiple zeta values

On the renormalization problem of multiple zeta values On the renormalization problem of multiple zeta values joint work with K. Ebrahimi-Fard, D. Manchon and J. Zhao Johannes Singer Universität Erlangen Paths to, from and in renormalization Universität Potsdam

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

p-adic L-functions for Dirichlet characters

p-adic L-functions for Dirichlet characters p-adic L-functions for Dirichlet characters Rebecca Bellovin 1 Notation and conventions Before we begin, we fix a bit of notation. We mae the following convention: for a fixed prime p, we set q = p if

More information

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016 Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying

More information

MORE CONSEQUENCES OF CAUCHY S THEOREM

MORE CONSEQUENCES OF CAUCHY S THEOREM MOE CONSEQUENCES OF CAUCHY S THEOEM Contents. The Mean Value Property and the Maximum-Modulus Principle 2. Morera s Theorem and some applications 3 3. The Schwarz eflection Principle 6 We have stated Cauchy

More information

Renormalization and Euler-Maclaurin Formula on Cones

Renormalization and Euler-Maclaurin Formula on Cones Renormalization and Euler-Maclaurin Formula on Cones Li GUO (joint work with Sylvie Paycha and Bin Zhang) Rutgers University at Newark Outline Conical zeta values and multiple zeta values; Double shuffle

More information

MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS

MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS ABDUL HASSEN AND HIEU D. NGUYEN Abstract. This paper investigates a generalization the classical Hurwitz zeta function. It is shown that many of the properties

More information

Moreover this binary operation satisfies the following properties

Moreover this binary operation satisfies the following properties Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................

More information

Section III.6. Factorization in Polynomial Rings

Section III.6. Factorization in Polynomial Rings III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)

More information

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation

More information

Series Solutions. 8.1 Taylor Polynomials

Series Solutions. 8.1 Taylor Polynomials 8 Series Solutions 8.1 Taylor Polynomials Polynomial functions, as we have seen, are well behaved. They are continuous everywhere, and have continuous derivatives of all orders everywhere. It also turns

More information

Generating series of multiple divisor sums and other interesting q-series

Generating series of multiple divisor sums and other interesting q-series Generating series of multiple divisor sums and other interesting q-series 1th July 2014 Content of this talk We are interested in a family of q-series which arises in a theory which combines multiple zeta

More information

Symmetric Properties for Carlitz s Type (h, q)-twisted Tangent Polynomials Using Twisted (h, q)-tangent Zeta Function

Symmetric Properties for Carlitz s Type (h, q)-twisted Tangent Polynomials Using Twisted (h, q)-tangent Zeta Function International Journal of Algebra, Vol 11, 2017, no 6, 255-263 HIKARI Ltd, wwwm-hiaricom https://doiorg/1012988/ija20177728 Symmetric Properties for Carlitz s Type h, -Twisted Tangent Polynomials Using

More information

Mahler measure and special values of L-functions

Mahler measure and special values of L-functions Mahler measure and special values of L-functions Matilde N. Laĺın University of Alberta mlalin@math.ualberta.ca http://www.math.ualberta.ca/~mlalin October 24, 2008 Matilde N. Laĺın (U of A) Mahler measure

More information

9. Integral Ring Extensions

9. Integral Ring Extensions 80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications

More information

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

More information

Polynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example:

Polynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example: Polynomials Monomials: 10, 5x, 3x 2, x 3, 4x 2 y 6, or 5xyz 2. A monomial is a product of quantities some of which are unknown. Polynomials: 10 + 5x 3x 2 + x 3, or 4x 2 y 6 + 5xyz 2. A polynomial is a

More information

Absolute zeta functions and the absolute automorphic forms

Absolute zeta functions and the absolute automorphic forms Absolute zeta functions and the absolute automorphic forms Nobushige Kurokawa April, 2017, (Shanghai) 1 / 44 1 Introduction In this report we study the absolute zeta function ζ f (s) associated to a certain

More information

Local and global finite branching of solutions of ODEs in the complex plane

Local and global finite branching of solutions of ODEs in the complex plane Local and global finite branching of solutions of ODEs in the complex plane Workshop on Singularities and Nonlinear ODEs Thomas Kecker University College London / University of Portsmouth Warszawa, 7 9.11.2014

More information

THE ARITHMETIC OF THE COEFFICIENTS OF HALF INTEGRAL WEIGHT EISENSTEIN SERIES. H(1, n)q n =

THE ARITHMETIC OF THE COEFFICIENTS OF HALF INTEGRAL WEIGHT EISENSTEIN SERIES. H(1, n)q n = THE ARITHMETIC OF THE COEFFICIENTS OF HALF INTEGRAL WEIGHT EISENSTEIN SERIES ANTAL BALOG, WILLIAM J. MCGRAW AND KEN ONO 1. Introduction and Statement of Results If H( n) denotes the Hurwitz-Kronecer class

More information

Sums of Products of Bernoulli Numbers*

Sums of Products of Bernoulli Numbers* journal of number theory 60, 234 (996) article no. 00 Sums of Products of Bernoulli Numbers* Karl Dilcher Department of Mathematics, Statistics, and Computing Science, Dalhousie University, Halifax, Nova

More information

Dirichlet s Theorem. Martin Orr. August 21, The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions:

Dirichlet s Theorem. Martin Orr. August 21, The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions: Dirichlet s Theorem Martin Orr August 1, 009 1 Introduction The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions: Theorem 1.1. If m, a N are coprime, then there

More information

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter

More information

Part II. Number Theory. Year

Part II. Number Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler

More information

Some Fun with Divergent Series

Some Fun with Divergent Series Some Fun with Divergent Series 1. Preliminary Results We begin by examining the (divergent) infinite series S 1 = 1 + 2 + 3 + 4 + 5 + 6 + = k=1 k S 2 = 1 2 + 2 2 + 3 2 + 4 2 + 5 2 + 6 2 + = k=1 k 2 (i)

More information

1 Review of di erential calculus

1 Review of di erential calculus Review of di erential calculus This chapter presents the main elements of di erential calculus needed in probability theory. Often, students taking a course on probability theory have problems with concepts

More information

CALCULUS JIA-MING (FRANK) LIOU

CALCULUS JIA-MING (FRANK) LIOU CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion

More information

Congruent Number Problem and Elliptic curves

Congruent Number Problem and Elliptic curves Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using

More information

Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography

Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups

More information

Leapfrog Constructions: From Continuant Polynomials to Permanents of Matrices

Leapfrog Constructions: From Continuant Polynomials to Permanents of Matrices Leapfrog Constructions: From Continuant Polynomials to Permanents of Matrices Alberto Facchini Dipartimento di Matematica Università di Padova Padova, Italy facchini@mathunipdit André Leroy Faculté Jean

More information

SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS

SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite

More information

CONGRUENCES FOR BERNOULLI - LUCAS SUMS

CONGRUENCES FOR BERNOULLI - LUCAS SUMS CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the

More information

Get Ready. 6. Expand using the distributive property. a) 6m(2m 4) b) 8xy(2x y) c) 6a 2 ( 3a + 4ab) d) 2a(b 2 6ab + 7)

Get Ready. 6. Expand using the distributive property. a) 6m(2m 4) b) 8xy(2x y) c) 6a 2 ( 3a + 4ab) d) 2a(b 2 6ab + 7) Get Ready BLM 5 1... Classify Polynomials 1. Classify each polynomial by the number of terms. 2y x 2 + 3x + 2 c) 6x 2 y + 2xy + 4 d) x 2 + y 2 e) 3x 2 + 2x + y 4 6. Expand using the distributive property.

More information

EXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS. M. Aslam Chaudhry. Received May 18, 2007

EXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS. M. Aslam Chaudhry. Received May 18, 2007 Scientiae Mathematicae Japonicae Online, e-2009, 05 05 EXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS M. Aslam Chaudhry Received May 8, 2007 Abstract. We define

More information

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)

More information

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups

More information

Lecture 3. Frits Beukers. Arithmetic of values of E- and G-function. Lecture 3 E- and G-functions 1 / 20

Lecture 3. Frits Beukers. Arithmetic of values of E- and G-function. Lecture 3 E- and G-functions 1 / 20 Lecture 3 Frits Beukers Arithmetic of values of E- and G-function Lecture 3 E- and G-functions 1 / 20 G-functions, definition Definition An analytic function f (z) given by a powerseries a k z k k=0 with

More information

Review of Power Series

Review of Power Series Review of Power Series MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Introduction In addition to the techniques we have studied so far, we may use power

More information

Evaluating ζ(2m) via Telescoping Sums.

Evaluating ζ(2m) via Telescoping Sums. /25 Evaluating ζ(2m) via Telescoping Sums. Brian Sittinger CSU Channel Islands February 205 2/25 Outline 2 3 4 5 3/25 Basel Problem Find the exact value of n= n 2 = 2 + 2 2 + 3 2 +. 3/25 Basel Problem

More information

Polynomial Hopf algebras in Algebra & Topology

Polynomial Hopf algebras in Algebra & Topology Andrew Baker University of Glasgow/MSRI UC Santa Cruz Colloquium 6th May 2014 last updated 07/05/2014 Graded modules Given a commutative ring k, a graded k-module M = M or M = M means sequence of k-modules

More information

1 Euler s idea: revisiting the infinitude of primes

1 Euler s idea: revisiting the infinitude of primes 8.785: Analytic Number Theory, MIT, spring 27 (K.S. Kedlaya) The prime number theorem Most of my handouts will come with exercises attached; see the web site for the due dates. (For example, these are

More information

ON DIVISION ALGEBRAS*

ON DIVISION ALGEBRAS* ON DIVISION ALGEBRAS* BY J. H. M. WEDDERBURN 1. The object of this paper is to develop some of the simpler properties of division algebras, that is to say, linear associative algebras in which division

More information

UNIVERSAL IDENTITIES. b = det

UNIVERSAL IDENTITIES. b = det UNIVERSAL IDENTITIES KEITH CONRAD 1 Introduction We want to describe an idea which reduces the verification of algebraic identities valid over all commutative rings to the verification over the complex

More information

Additional Practice Lessons 2.02 and 2.03

Additional Practice Lessons 2.02 and 2.03 Additional Practice Lessons 2.02 and 2.03 1. There are two numbers n that satisfy the following equations. Find both numbers. a. n(n 1) 306 b. n(n 1) 462 c. (n 1)(n) 182 2. The following function is defined

More information

M3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS

M3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS M3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS (1) (a) Fix a monomial order. A finite subset G = {g 1,..., g m } of an ideal I k[x 1,..., x n ] is called a Gröbner basis if (LT(g

More information

FIELD THEORY. Contents

FIELD THEORY. Contents FIELD THEORY MATH 552 Contents 1. Algebraic Extensions 1 1.1. Finite and Algebraic Extensions 1 1.2. Algebraic Closure 5 1.3. Splitting Fields 7 1.4. Separable Extensions 8 1.5. Inseparable Extensions

More information

NONSTANDARD ARITHMETIC AND RECURSIVE COMPREHENSION

NONSTANDARD ARITHMETIC AND RECURSIVE COMPREHENSION NONSTANDARD ARITHMETIC AND RECURSIVE COMPREHENSION H. JEROME KEISLER Abstract. First order reasoning about hyperintegers can prove things about sets of integers. In the author s paper Nonstandard Arithmetic

More information

FastTrack - MA109. Exponents and Review of Polynomials

FastTrack - MA109. Exponents and Review of Polynomials FastTrack - MA109 Exponents and Review of Polynomials Katherine Paullin, Ph.D. Lecturer, Department of Mathematics University of Kentucky katherine.paullin@uky.edu Monday, August 15, 2016 1 / 25 REEF Question

More information

AP Calculus Chapter 9: Infinite Series

AP Calculus Chapter 9: Infinite Series AP Calculus Chapter 9: Infinite Series 9. Sequences a, a 2, a 3, a 4, a 5,... Sequence: A function whose domain is the set of positive integers n = 2 3 4 a n = a a 2 a 3 a 4 terms of the sequence Begin

More information

POLYNOMIALS. x + 1 x x 4 + x 3. x x 3 x 2. x x 2 + x. x + 1 x 1

POLYNOMIALS. x + 1 x x 4 + x 3. x x 3 x 2. x x 2 + x. x + 1 x 1 POLYNOMIALS A polynomial in x is an expression of the form p(x) = a 0 + a 1 x + a x +. + a n x n Where a 0, a 1, a. a n are real numbers and n is a non-negative integer and a n 0. A polynomial having only

More information

Problemen. x = 2X 3 y = 2Y 4

Problemen. x = 2X 3 y = 2Y 4 Problemen NAW 5/7 nr. 3 september 2006 219 Problemen Problem Section Edition 2006/1 For Session 2006/1 We received submissions from Rik Bos, Thomas Decru, Ruud Jeurissen, Jaap Spies, B. Sury, the Fejéntaláltuka

More information

Kent Co. Received Red Cross Service Abundantly in ' 4 9 E

Kent Co. Received Red Cross Service Abundantly in ' 4 9 E G N GN Y 95 89 N - q» B < ) < - 9 - - - - q ( B 6 - q - Q» x x 8 {) N - 9» -

More information

Practice problems for first midterm, Spring 98

Practice problems for first midterm, Spring 98 Practice problems for first midterm, Spring 98 midterm to be held Wednesday, February 25, 1998, in class Dave Bayer, Modern Algebra All rings are assumed to be commutative with identity, as in our text.

More information

Problem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that

Problem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume

More information

7 Asymptotics for Meromorphic Functions

7 Asymptotics for Meromorphic Functions Lecture G jacques@ucsd.edu 7 Asymptotics for Meromorphic Functions Hadamard s Theorem gives a broad description of the exponential growth of coefficients in power series, but the notion of exponential

More information

Section Taylor and Maclaurin Series

Section Taylor and Maclaurin Series Section.0 Taylor and Maclaurin Series Ruipeng Shen Feb 5 Taylor and Maclaurin Series Main Goal: How to find a power series representation for a smooth function us assume that a smooth function has a power

More information

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0

More information

Algebra I. Book 2. Powered by...

Algebra I. Book 2. Powered by... Algebra I Book 2 Powered by... ALGEBRA I Units 4-7 by The Algebra I Development Team ALGEBRA I UNIT 4 POWERS AND POLYNOMIALS......... 1 4.0 Review................ 2 4.1 Properties of Exponents..........

More information

How could you express algebraically, the total amount of money he earned for the three days?

How could you express algebraically, the total amount of money he earned for the three days? UNIT 4 POLYNOMIALS Math 11 Unit 4 Introduction p. 1 of 1 A. Algebraic Skills Unit 4 Polynomials Introduction Problem: Derrek has a part time job changing tires. He gets paid the same amount for each tire

More information

Polynomial Rings. i=0. i=0. n+m. i=0. k=0

Polynomial Rings. i=0. i=0. n+m. i=0. k=0 Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients

More information

Notes on the Riemann Zeta Function

Notes on the Riemann Zeta Function Notes on the Riemann Zeta Function March 9, 5 The Zeta Function. Definition and Analyticity The Riemann zeta function is defined for Re(s) > as follows: ζ(s) = n n s. The fact that this function is analytic

More information

Exercises for algebraic curves

Exercises for algebraic curves Exercises for algebraic curves Christophe Ritzenthaler February 18, 2019 1 Exercise Lecture 1 1.1 Exercise Show that V = {(x, y) C 2 s.t. y = sin x} is not an algebraic set. Solutions. Let us assume that

More information

Chapter 2 Subspaces of R n and Their Dimensions

Chapter 2 Subspaces of R n and Their Dimensions Chapter 2 Subspaces of R n and Their Dimensions Vector Space R n. R n Definition.. The vector space R n is a set of all n-tuples (called vectors) x x 2 x =., where x, x 2,, x n are real numbers, together

More information

A = A(f) = k x 1,...,x n /(f = f ij x i x j )

A = A(f) = k x 1,...,x n /(f = f ij x i x j ) Noncommutative Algebraic Geometry Shanghai September 12-16, 211 Calabi-Yau algebras linked to Poisson algebras Roland Berger (Saint-Étienne, France (jointly Anne Pichereau Calabi-Yau algebras viewed as

More information

FFTs in Graphics and Vision. Homogenous Polynomials and Irreducible Representations

FFTs in Graphics and Vision. Homogenous Polynomials and Irreducible Representations FFTs in Graphics and Vision Homogenous Polynomials and Irreducible Representations 1 Outline The 2π Term in Assignment 1 Homogenous Polynomials Representations of Functions on the Unit-Circle Sub-Representations

More information

PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes

PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be

More information

Dirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007

Dirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007 Dirichlet s Theorem Calvin Lin Zhiwei August 8, 2007 Abstract This paper provides a proof of Dirichlet s theorem, which states that when (m, a) =, there are infinitely many primes uch that p a (mod m).

More information

Formal power series rings, inverse limits, and I-adic completions of rings

Formal power series rings, inverse limits, and I-adic completions of rings Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely

More information

Wavelets and Filter Banks

Wavelets and Filter Banks Wavelets and Filter Banks Inheung Chon Department of Mathematics Seoul Woman s University Seoul 139-774, Korea Abstract We show that if an even length filter has the same length complementary filter in

More information

Module MA3411: Galois Theory Michaelmas Term 2009

Module MA3411: Galois Theory Michaelmas Term 2009 Module MA3411: Galois Theory Michaelmas Term 2009 D. R. Wilkins Copyright c David R. Wilkins 1997 2009 Contents 1 Basic Concepts and Results of Group Theory 1 1.1 Groups...............................

More information

Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0

Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0 Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can

More information

Singularities, Algebraic entropy and Integrability of discrete Systems

Singularities, Algebraic entropy and Integrability of discrete Systems Singularities, Algebraic entropy and Integrability of discrete Systems K.M. Tamizhmani Pondicherry University, India. Indo-French Program for Mathematics The Institute of Mathematical Sciences, Chennai-2016

More information

Continued fractions for complex numbers and values of binary quadratic forms

Continued fractions for complex numbers and values of binary quadratic forms arxiv:110.3754v1 [math.nt] 18 Feb 011 Continued fractions for complex numbers and values of binary quadratic forms S.G. Dani and Arnaldo Nogueira February 1, 011 Abstract We describe various properties

More information

5.1 Monomials. Algebra 2

5.1 Monomials. Algebra 2 . Monomials Algebra Goal : A..: Add, subtract, multiply, and simplify polynomials and rational expressions (e.g., multiply (x ) ( x + ); simplify 9x x. x Goal : Write numbers in scientific notation. Scientific

More information

Provenance Semirings. Todd Green Grigoris Karvounarakis Val Tannen. presented by Clemens Ley

Provenance Semirings. Todd Green Grigoris Karvounarakis Val Tannen. presented by Clemens Ley Provenance Semirings Todd Green Grigoris Karvounarakis Val Tannen presented by Clemens Ley place of origin Provenance Semirings Todd Green Grigoris Karvounarakis Val Tannen presented by Clemens Ley place

More information

On combinatorial zeta functions

On combinatorial zeta functions On combinatorial zeta functions Christian Kassel Institut de Recherche Mathématique Avancée CNRS - Université de Strasbourg Strasbourg, France Colloquium Potsdam 13 May 2015 Generating functions To a sequence

More information

Math Homework 2

Math Homework 2 Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is

More information

Chapter 2. Real Numbers. 1. Rational Numbers

Chapter 2. Real Numbers. 1. Rational Numbers Chapter 2. Real Numbers 1. Rational Numbers A commutative ring is called a field if its nonzero elements form a group under multiplication. Let (F, +, ) be a filed with 0 as its additive identity element

More information

ON q-analgue OF THE TWISTED L-FUNCTIONS AND q-twisted BERNOULLI NUMBERS. Yilmaz Simsek

ON q-analgue OF THE TWISTED L-FUNCTIONS AND q-twisted BERNOULLI NUMBERS. Yilmaz Simsek J. Korean Math. Soc. 40 (2003), No. 6, pp. 963 975 ON q-analgue OF THE TWISTED L-FUNCTIONS AND q-twisted BERNOULLI NUMBERS Yilmaz Simsek Abstract. The aim of this work is to construct twisted q-l-series

More information

Part 1. For any A-module, let M[x] denote the set of all polynomials in x with coefficients in M, that is to say expressions of the form

Part 1. For any A-module, let M[x] denote the set of all polynomials in x with coefficients in M, that is to say expressions of the form Commutative Algebra Homework 3 David Nichols Part 1 Exercise 2.6 For any A-module, let M[x] denote the set of all polynomials in x with coefficients in M, that is to say expressions of the form m 0 + m

More information

This ODE arises in many physical systems that we shall investigate. + ( + 1)u = 0. (λ + s)x λ + s + ( + 1) a λ. (s + 1)(s + 2) a 0

This ODE arises in many physical systems that we shall investigate. + ( + 1)u = 0. (λ + s)x λ + s + ( + 1) a λ. (s + 1)(s + 2) a 0 Legendre equation This ODE arises in many physical systems that we shall investigate We choose We then have Substitution gives ( x 2 ) d 2 u du 2x 2 dx dx + ( + )u u x s a λ x λ a du dx λ a λ (λ + s)x

More information

A PROBLEM ON THE CONJECTURE CONCERNING THE DISTRIBUTION OF GENERALIZED FERMAT PRIME NUMBERS (A NEW METHOD FOR THE SEARCH FOR LARGE PRIMES)

A PROBLEM ON THE CONJECTURE CONCERNING THE DISTRIBUTION OF GENERALIZED FERMAT PRIME NUMBERS (A NEW METHOD FOR THE SEARCH FOR LARGE PRIMES) A PROBLEM ON THE CONJECTURE CONCERNING THE DISTRIBUTION OF GENERALIZED FERMAT PRIME NUMBERS A NEW METHOD FOR THE SEARCH FOR LARGE PRIMES) YVES GALLOT Abstract Is it possible to improve the convergence

More information

Liouvillian solutions of third order differential equations

Liouvillian solutions of third order differential equations Article Submitted to Journal of Symbolic Computation Liouvillian solutions of third order differential equations Felix Ulmer IRMAR, Université de Rennes, 0 Rennes Cedex, France felix.ulmer@univ-rennes.fr

More information

Algorithmic Tools for the Asymptotics of Diagonals

Algorithmic Tools for the Asymptotics of Diagonals Algorithmic Tools for the Asymptotics of Diagonals Bruno Salvy Inria & ENS de Lyon Lattice walks at the Interface of Algebra, Analysis and Combinatorics September 19, 2017 Asymptotics & Univariate Generating

More information

Cyclic inclusion/exclusion

Cyclic inclusion/exclusion Cyclic inclusion/exclusion Valentin Féray LaBRI, CNRS, Bordeaux Journées Combinatoire Algébrique du GDR-IM, Rouen Valentin Féray (LaBRI, CNRS) Cyclic inclusion/exclusion Rouen, 011 06 1 / 16 Introduction

More information

The converse is clear, since

The converse is clear, since 14. The minimal polynomial For an example of a matrix which cannot be diagonalised, consider the matrix ( ) 0 1 A =. 0 0 The characteristic polynomial is λ 2 = 0 so that the only eigenvalue is λ = 0. The

More information

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same. Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read

More information

Primes, partitions and permutations. Paul-Olivier Dehaye ETH Zürich, October 31 st

Primes, partitions and permutations. Paul-Olivier Dehaye ETH Zürich, October 31 st Primes, Paul-Olivier Dehaye pdehaye@math.ethz.ch ETH Zürich, October 31 st Outline Review of Bump & Gamburd s method A theorem of Moments of derivatives of characteristic polynomials Hypergeometric functions

More information

MATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series.

MATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series. MATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series. The objective of this section is to become familiar with the theory and application of power series and Taylor series. By

More information

On the singularities of non-linear ODEs

On the singularities of non-linear ODEs On the singularities of non-linear ODEs Galina Filipuk Institute of Mathematics University of Warsaw G.Filipuk@mimuw.edu.pl Collaborators: R. Halburd (London), R. Vidunas (Tokyo), R. Kycia (Kraków) 1 Plan

More information

Math 61CM - Solutions to homework 2

Math 61CM - Solutions to homework 2 Math 61CM - Solutions to homework 2 Cédric De Groote October 5 th, 2018 Problem 1: Let V be the vector space of polynomials of degree at most 5, with coefficients in a field F Let U be the subspace of

More information

or E ( U(X) ) e zx = e ux e ivx = e ux( cos(vx) + i sin(vx) ), B X := { u R : M X (u) < } (4)

or E ( U(X) ) e zx = e ux e ivx = e ux( cos(vx) + i sin(vx) ), B X := { u R : M X (u) < } (4) :23 /4/2000 TOPIC Characteristic functions This lecture begins our study of the characteristic function φ X (t) := Ee itx = E cos(tx)+ie sin(tx) (t R) of a real random variable X Characteristic functions

More information