On the Inverse of a Certain Matrix Involving Binomial Coefficients

Similar documents
It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca

Series with Central Binomial Coefficients, Catalan Numbers, and Harmonic Numbers

#A51 INTEGERS 14 (2014) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES

Math 140A Elementary Analysis Homework Questions 1

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

Sequences of Definite Integrals, Factorials and Double Factorials

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

1 6 = 1 6 = + Factorials and Euler s Gamma function

Section 11.8: Power Series

Interesting Series Associated with Central Binomial Coefficients, Catalan Numbers and Harmonic Numbers

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology

Math 2784 (or 2794W) University of Connecticut

1 Generating functions for balls in boxes

Math 155 (Lecture 3)

Infinite Sequences and Series

Properties and Tests of Zeros of Polynomial Functions

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is

MDIV. Multiple divisor functions

INFINITE SEQUENCES AND SERIES

NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

1 Approximating Integrals using Taylor Polynomials

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

Harmonic Number Identities Via Euler s Transform

Zeros of Polynomials

The r-generalized Fibonacci Numbers and Polynomial Coefficients

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

Stochastic Matrices in a Finite Field

AMS Mathematics Subject Classification : 40A05, 40A99, 42A10. Key words and phrases : Harmonic series, Fourier series. 1.

Enumerative & Asymptotic Combinatorics

Math 475, Problem Set #12: Answers

arxiv: v1 [math.fa] 3 Apr 2016

The Arakawa-Kaneko Zeta Function

MT5821 Advanced Combinatorics

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.

Random Models. Tusheng Zhang. February 14, 2013

SHARP INEQUALITIES INVOLVING THE CONSTANT e AND THE SEQUENCE (1 + 1/n) n

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

Dirichlet s Theorem on Arithmetic Progressions

MAT1026 Calculus II Basic Convergence Tests for Series

(I.C) THE DISTRIBUTION OF PRIMES

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

Sequences and Series of Functions

Bertrand s Postulate

THE TRANSFORMATION MATRIX OF CHEBYSHEV IV BERNSTEIN POLYNOMIAL BASES

On a class of convergent sequences defined by integrals 1

Topic 9: Sampling Distributions of Estimators

Abstract. 1. Introduction This note is a supplement to part I ([4]). Let. F x (1.1) x n (1.2) Then the moments L x are the Catalan numbers

Square-Congruence Modulo n

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

Riesz-Fischer Sequences and Lower Frame Bounds

MT5821 Advanced Combinatorics

4 The Sperner property.

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

Lecture 1. January 8, 2018

On the distribution of coefficients of powers of positive polynomials

1 Last time: similar and diagonalizable matrices

4. Partial Sums and the Central Limit Theorem

Hoggatt and King [lo] defined a complete sequence of natural numbers

The log-behavior of n p(n) and n p(n)/n

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

(6), (7) and (8) we have easily, if the C's are cancellable elements of S,

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,

CALCULATION OF FIBONACCI VECTORS

Topic 9: Sampling Distributions of Estimators

Course : Algebraic Combinatorics

CHAPTER I: Vector Spaces

Induction proofs - practice! SOLUTIONS

1, if k = 0. . (1 _ qn) (1 _ qn-1) (1 _ qn+1-k) ... _: =----_...:... q--->1 (1- q) (1 - q 2 ) (1- qk) - -- n! k!(n- k)! n """"' n. k.

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

Short and fuzzy derivations of five remarkable formulas for primes

WHAT ARE THE BERNOULLI NUMBERS? 1. Introduction

SOME NEW IDENTITIES INVOLVING π,

f(x)g(x) dx is an inner product on D.

Problem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =

Topic 9: Sampling Distributions of Estimators

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

7.1 Convergence of sequences of random variables

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

PROPERTIES OF THE POSITIVE INTEGERS

A solid Foundation for q-appell Polynomials

Chimica Inorganica 3

Mathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis

Some integrals related to the Basel problem

A Combinatoric Proof and Generalization of Ferguson s Formula for k-generalized Fibonacci Numbers

Factors of sums and alternating sums involving binomial coefficients and powers of integers

, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)

ON RUEHR S IDENTITIES

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Some families of generating functions for the multiple orthogonal polynomials associated with modified Bessel K-functions

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

Applied Mathematics Letters. On the properties of Lucas numbers with binomial coefficients

Chapter 8. Euler s Gamma function

arxiv: v1 [cs.sc] 2 Jan 2018

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

Asymptotic Formulae for the n-th Perfect Power

Transcription:

It. J. Cotemp. Math. Scieces, Vol. 3, 008, o. 3, 5-56 O the Iverse of a Certai Matrix Ivolvig Biomial Coefficiets Yoshiari Iaba Kitakuwada Seior High School Keihokushimoyuge, Ukyo-ku, Kyoto, 60-0534, Japa iava@kyoto-be.e.jp Abstract I this short essay we aim to give the explicit form for the iverse of a certai upper triagular matrix which cotais biomial coefficiets as its elemets. This matrix has played a importat role i the article by Burrows & Talbot [], i which a certai extesio for a approximatio formula of r= rk has bee give. We shall obtai our result by makig use of some idetities cocerig Beroulli umbers. Mathematics Subject Classificatio:B68, 5A09, Y55 Keywords: iverse matrix, Beroulli umbers, sums of powers. Itroductio I the paper Burrows & Talbot [], a approximatio formula of the sums of powers of itegers, r k ( + )k+ k + r= has bee refied ad exteded to the case where k is ay real umber. Especially i the case where k is positive real umber, for the polyomials i, g(k) = k + {( + )k+ ( )k+ }, (k ), g( ) = log( +) ad for the power sums S(k) = r= rk (k>0), the relatio i a matrix form ( ) k... 3 4 5 4 6 7 ( 6 k... 3 4 5 ) 4... 3 g(k) S(k) g(k ) 0 S(k ) ( g(k 4) = 0 0 k 4 S(k 4) g(k 6) 0 0 0... S(k 6).......

5 Y. Iaba has bee show. Here, we shall compute the explicit form of the iverse of this upper triagular matrix whose (i, j)-elemet is ( ) k i (0 (j i) (j i)+ (j i) i, j ). Ad we shall see the fact that the iverse of it also cotais biomial coefficiets i (j i)).. Some idetities cocerig Beroulli umbers First, we shall see two elemetary idetities cocerig Beroulli umbers. They are show by usig the well kow Euler Maclauri sum formula. Lemma. Let B be the -th Beroulli umber, the we have followig elemetary idetities. ( ) m + m + () B k =, m =,, 3,...<, k ( ) m + () k m + B k =. m =0,,, 3,...< k Proof. For the Euler Maclauri sum formula, f(i) = f(x)dx + 0 (f() f(0)) + B k (k)! (f (k ) () f (k ) (0)). k= i= Let us start with settig f(x) =x m (m =,, 3,...< ). I this case, sice f(x) is fiite times differetiable, we do ot eed cosider the remaider term. m i m = m+ m + + m + B k (m)! (k)! (m k + )! m k+. i= Settig =, we have whece = Therefore we obtai (), k= m + + m + m = m + = = k= B k (m)! (k)! (m k + )!, B k (m)! (k)! (m k + )!. B k (m + )! (k)! (m k + )! ( ) m + B k. k

Iverse of a certai matrix 53 Next let us advace to the proof of (). Startig with f(x) =(x ) m (m =,, 3,...< ) ad processig with same above brig us the fact, (i ) m = ( )m+ + + ( )m (m +) B k (m)! + (k)! (m k + )! k (( ) m k+ +). i= Settig =, we have = k= m m + + k= B k (m)! (k)! (m k + )! k, whece = B k (m)! (k)! (m k + )! k. Thus ( ) m + k B k = k m +. This idetity is also true for the case m =0. This lemma tells us the followig oe immediately, ad we ca state a corollary. ( ) m + B k ) = 0, k Corollary. k (k)!((m k) + )! B k =0. m =0,,, 3,...< Next we see a idetity which is cocered with the Beroulli umber, ad by which we ca express our result more simply. Lemma. Let B (x) be the -th Beroulli polyomial, the we fid the followig idetity. B = B ( )

54 Y. Iaba Proof. Let us show it by usig the well kow (for istace, see []) geeratig fuctios. B (x) z! = zexz e z, B z! = z e z, we have z B! = (B B )z! z = B! (z/) B! = z e z z/ e z/ = zez/ e z. 3. Explicit iverse of the matrix We ow proceed to our mai cosequece. Let A be the matrix whose (i, j)- elemet is A ij = ( ) k i (j i) (j i)+ (j i), where k is a costat such that k =,, 3,... <. Ad the biomial coefficiet ( m) is take to be zero for the case <m, m<0. Sice this matrix is upper triagular matrix, to compute the iverse of this oe is ot so difficult i terms of the elemetary study of the matrix theory. But to deduce the explicit expressio for the iverse of this matrix is ot so easy. Propositio. Let A ad B are ( +) ( + ) upper triagular matrices whose (i, j)-elemets are as follows. ( ) k i A ij = (j i) (j i)+, ( ) (j i) k i B ij = B (j i) ( (j i) ). The we have A ilb lj = δ ij, where δ ij is Kroecker delta. I other words, the matrix B is the iverse of the matrix A.

Iverse of a certai matrix 55 Proof. First it is clear that A ilb lj = A ii B ii = for i = j. Next we compute the matrix elemets of AB for i j. ( ) k i A il B lj = (l i) (l i)+ (l i) ( ) k i ((j i))! = (j i) ((l i))!((j l))! ( ) k i ((j i))! = (j i) (j i) Thus we should just show the followig idetity, (j l) ((j l))!((l i) + )! B (j l) =0. By settig j l = t, j i = s, The LHS is foud that, s t (t)!((s t) + )! B t t=0 ( ) k l (j l) B (j l) (j l) (j l) (j l) (j i) (l i)+ B (j l) (j l) ((j l))!((l i) + )! B (j l). ad it is clearly equal to zero by corollary above. Note that we ca see the same biomial coefficiets i (j i)) both i the matrix A ad i the iverse B. Now let us see a example. Example For the matrix, ( ) k we get A 5 = 3 4 5 4 6 7 6 8 9 8 0 ( 0 k 3 4 5 4 6 7 6 8 9 ( 8 k 4 4 4 3 4 5 4 6 7 ( 6 k 6 6 3 4 5 ) 4 3 0 0 0 A 5 = 0 0 0 ( 0 0 0 0 k 8 0 0 0 0 0 ( ) k ) 7 3 4 5 4 6, ) 3 7 ( ) k 555 6 8 5 8 0 33 0 7 ( ) k 3 7 5 4 6 6 8 5 ) 8 4 ) 7 ( ) k 4 3 3 4 5 4 6 ) 6 6 ) 7 3 4 5 ) 4 3 0 ( ) k 3 4 0 0 4 0 0 0 6 0 0 0 0 0 0 0 0 0 8.

56 Y. Iaba To coclude this essay, we apped statig a formula of the sums of powers of itegers S(k) = r= rk with the help of cosequeces of [] ad of our aboves. Let k be a atural umber, we ca state the followig formula. S(k) = k/ i=0 ( ) k B i ( )g(k i) i where, g(k) = {( + k+ )k+ ( )k+ }, ad x meas the highest iteger less tha or equal to x. Example Puttig k = 9. The we have 9/ ( ) 9 S(9) = B i ( )g(9 i) i i=0 = 3 0 + 4 7 0 6 + 3 4 8 + 9 + 0 0. This formula is usually ot available because the computig process is too troublesome. However, this is ot meaigless because of oly a reaso that we have ot see ever. 4. Refereces [] B.L.Burrows ad R.F.Talbot, Sums of powers of itegers, America Mathematical Mothly 9(984), 394-403. [] R.Graham, D.Kuth, ad O.Patashik, Cocrete Mathematics, Addiso- Wesley, 989. Received: March 8, 008