Expected Norms of Zero-One Polynomials

Size: px
Start display at page:

Download "Expected Norms of Zero-One Polynomials"

Transcription

1 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page Sheet of Caad. Math. Bull. Vol. XX (Y, ZZZZ pp. 0 0 Expected Norms of Zero-Oe Polyomials Peter Borwei, Kwok-Kwog Stephe Choi, ad Idris Mercer 5 5 Abstract. Let A = a 0 + a z + + a z : a j 0, }, whose elemets are called zerooe polyomials ad correspod aturally to the subsets of [] := 0,,..., }. We also let A,m = α(z A : α( = m}, whose elemets correspod to the ` m subsets of [] of size m, ad let B = A + \ A, whose elemets are the zero-oe polyomials of degree exactly. May researchers have studied orms of polyomials with restricted coefficiets. Usig α p to deote the usual L p orm of α o the uit circle, oe easily sees that α(z = a 0 +a z+ +a N z N R[z] satisfies α = c 0 ad α = c 0 + (c + + c N, where c k := P j=0 a ja j+k for 0 k N. If α(z A,m, say α(z = z β + + z β m where β < < β m, the c k is the umber of times k appears as a differece β i β j. The coditio that α A,m satisfies c k 0, } for k is thus equivalet to the coditio that β,..., β m } is a Sido set (meaig all differeces of pairs of elemets are distict. 6 I this paper, we fid the average of α over α A, α B, ad α A,m. We further 6 show that our expressio for the average of α over A,m yields a ew proof of the kow result: if 8 m = o( /4 ad B(, m deotes the umber of Sido sets of size m i [], the almost all subsets 8 of [] of size m are Sido, i the sese that lim B(, m/` m =. Itroductio ad Statemet of Mai Result 3 3 We let A deote the set a 0 + a z + + a z : a j 0, } for all j}, ad we call the elemets of A zero-oe polyomials. There is a atural bijectio betwee the 35 polyomials i A ad the subsets of [] := 0,,..., }. Geerally, if α(z A, we defie m := α( = the umber of coefficiets of α(z that are, ad we write α(z = z β + z β + + z β m where β < β < < β m, so 40 4 β 4, β,...,β m } is the subset of [] that correspods to α(z. We let A,m deote 4 the set α(z A 4 : α( = m}, so A,m = ( m ad A = A,0 A, A,. 43 We also defie B 43 := A + \ A, so B cosists of the zero-oe polyomials of degree exactly. A recurrig theme i the literature is the problem of fidig a polyomial with small orm subject to some restrictio o its coefficiets. (See [3, Problem 6], 4 [5, Problem ], or [, Ch. 4, 5]. I geeral, for 4 (. α(z = a a z + + a N z N R[z], 50 5 Received by the editors May, The research of Peter Borwei ad Stephe Choi is supported by NSERC of Caada AMS subject classificatio: Primary: B83; secodary: C08, C0. 53 c Caadia Mathematical Society ZZZZ

2 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page Sheet of P. Borwei, K.-K. S. Choi, ad I. Mercer we defie the usual L p orms of α(z o the uit circle: 0 ( 0 π α p := α(e iθ /p, dθ p π 0 where p is real. The mai result of this paper, which appears as Theorem 4. i Sectio 4, is that if 4 ad m, we have 5 5 E A ( α = (, 6 E A,m ( α = m m + m[4] 3( 3 + m[3] ( m( 4 + (, E B ( α = (, 6 where E Ω ( α deotes the average of α over the polyomials i Ω, ad the otatio x [k] is shorthad for x(x (x k +. This complemets results of 6 Newma ad Byres [], who foud the average of α over the polyomials of 6 the form 8 8 (. a 0 + a z + + a z, a j +, } for all j, ad Borwei ad Choi [], who foud (amog other thigs the average of α 6 6 ad α over the polyomials of the form (., ad the average of α, α, 3 ad α over the 3 polyomials of the form a a z + + a z, a j +, 0, } for all j Autocorrelatio Notice that if α is of the form (. ad z =, we have ( 40 4 α(z = α(zα(z = (a 0 + a z + + a N z N a 0 + a 4 z + + a N z N = c N 43 z z + c 0 + c z + + c N z N, where the c k are the so-called (aperiodic autocorrelatios of α, defied for 0 k N by c k := j=0 a ja j+k. Usig the geeral fact that π ( 4 b M 4 π 0 z M + + b z + b 0 + b z + + b M z M dθ = b 0, (z = e iθ, 5 we see that for α of the form (., we have α 53 = π ( c N π 0 z N + + c z + c 0 + c z + + c N z N dθ = c 0, (z = e iθ, 55

3 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page 3 Sheet 3 of Expected Norms of Zero-Oe Polyomials 3 ad 0 (. 0 α = π ( c N π 0 z N + + c z + c 0 + c z + + c N z N dθ = cn + + c + c0 + c + + cn = c0 + (c + + cn, (z = e iθ. 5 5 We further observe that, say, ( c k = a j a j+k = a i a i+k a j a j+k = a i a j a i+k a j+k j=0 i=0 j=0 i=0 j=0 = f (i, j. i=0 j=0 Notig that f (i, j := a i a j a i+k a j+k satisfies f (i, j = f ( j, i, we have 6 6 (. ck = f (i, j = f (i, i + f (i, j 8 8 i=0 j=0 i=0 0 i< j = a i a i+k + a i a j a i+k a j+k. 3 i=0 0 i< j 3 If α(z = a a z = z β + + z β m A,m, the we have c 0 = m ad c k is 35 the umber of j such that a j ad a j+k are both ad is equal to the umber of times k appears as a differece β i β j. Thus c + + c = m(m /, ad sice the Author: Redudat (? displayed lies deleted c k are oegative itegers, we have (.3 c c c + + c = m(m / 3 with equality if ad oly if c k 0, } for k, or i other words, if ad oly 4 4 if all differeces of pairs of elemets of β,...,β m } are distict. If all differeces of 4 4 pairs of elemets of β,...,β m } are distict, we call β,...,β m } a Sido set. Usig (., we see that (.3 ad c 0 = m prove the followig. Propositio. For ay α(z = z β + + z β m A,m, we have α m m, with equality if ad oly if β,...,β m } is a Sido set. We observe also that (.3 implies that c + +c m(m / is a oegative iteger, ad is zero if ad oly if β 4,...,β m } is Sido. 4 3 Some Facts ad Notatio If Ω deotes A 53, B, or A,m, the we tur Ω ito a probability space by givig each 53 polyomial α Ω equal weight p(α. 55

4 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page 4 Sheet 4 of 4 P. Borwei, K.-K. S. Choi, ad I. Mercer Geerally, we will deote a typical elemet of A or A,m by 0 0 α(z = a 0 + a z + + a z, ad deote a typical elemet of B by α(z = a 0 + a z + + a z + z. As i Sectio, if α A,m, we also write 5 5 α(z = z β + z β + + z β m where β < β < < β m. If Ω is oe of the three spaces A, B, or A,m ad X is a radom variable o Ω, we of course have E Ω (X = α Ω X(αp(α, ad we will sometimes omit the subscript Ω if it is clear from the cotext what probability space we are cosiderig. Two facts we will use that are each immediate from first priciples are Markov s iequality, Pr[X a] E(X/a, where X is a oegative real radom variable, ad liearity of expectatio, E(X + +X k = E(X + +E(X k, which holds regardless of depedece or idepedece of the X i Calculatio of E( α 8 8 Let j, j, j 3, j 4 deote distict itegers. We begi this sectio by fidig some averages of products of a ji that we will eed later. First, suppose our probability space Ω is A. We the have 3 3 (4. E(a j a j = (umber of α A such that a j = a j = = = 4, 36 ad by similar reasoig, we have (4. E(a j a j a j3 = /8, E(a j a j a j3 a j4 = / Now suppose our probability space Ω is A,m. We the have (4.3 E(a j a j = ( (umber of α A,m such that a j = a j = 43 m ( m m(m = ( = ( = m[] m ad by similar reasoig, we have (4.4 E(a 5 j a j a j3 = m [3] / [3], E(a j a j a j3 a j4 = m [4] / [4] We ote that we eed 4 i order for all expressios i (4.3 ad (4.4 to be defied. For Ω = A,m, the case 3 will be treated separately. 55

5 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page 5 Sheet 5 of Expected Norms of Zero-Oe Polyomials 5 Now if Ω is either of the probability spaces A or A,m, the equatio (. gives 0 0 k (4.5 ck = a i a i+k + a i a i+k a j a j+k. i=0 0 i< j k We defie λ := k ad also defie 5 5 λ (4.6 S := a i a i+k, i=0 (4. T := a i a j a i+k a j+k, 0 i< j λ which of course implies ck = S + T. If k = 0, the k = m. So if Ω = A,m, we have simply E(c0 = m, whereas if Ω = A, we have ( 6 (4.8 E(c0 = m 6. m=0 8 8 It is a exercise to see that the right side of (4.8 evaluates to ( + /4. Alteratively, we may observe that c 0 has a biomial distributio with parameters ad /, which implies 3 3 (4. E(c 0 = Var(c 0 + E(c 0 = ( + + =. 4 Havig foud E(c 36 0 for Ω = A,m ad for Ω = A, we ow shift our attetio 36 to E(c 3 k for k 0. 3 Assume k 0, ad observe that (4.5, (4.6, ad (4. (ad liearity of expectatio give us λ 4 (4.0 E(c 4 k = E(S + E(T = E(a i a i+k + E(a i a j a i+k a j+k. 4 i=0 0 i< j λ 4 Sice k 0, each of the λ terms i the sum E(S is of the form E(a j a j where j j. We thus have 4 λ/4 if Ω = A 4, (4. E(S = λm [] / [] if Ω = A,m, 5 by (4. ad (4.. As for the ( λ terms i the sum E(T, each term is of the form 5 5 E(a i a j a i+k a j+k. Sice k 0 ad i < j, the four subscripts i, j, i + k, j + k costitute 5 either three distict itegers (if j = i + k or four distict itegers (if j i + k. If i, j, i + k, j + k} cosists of three distict itegers j, j, j 3 where j 3 is the oe that is 55

6 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page 6 Sheet 6 of 6 P. Borwei, K.-K. S. Choi, ad I. Mercer repeated, the, sice a j 0, } for all j, we have E(a i a j a i+k a j+k = E(a j a j a j 3 = E(a 0 j a j a j3, whereas, of course, if i, j, i + k, j + k} cosists of four distict itegers, 0 the E(a i a j a i+k a j+k is of the form E(a j a j a j3 a j4. Therefore, we ow ask the questio: For which of the ( λ terms i the sum E(T does the set i, j, i +k, j +k} cosist of oly three distict itegers? For some i 0,,..., λ }, there is exactly oe j satisfyig both i < j λ 5 ad j = i + k, ad for other values of i, there is o such j. We will say that i is of 5 type I if the former criterio holds, ad is of type II if the latter criterio holds. A iteger i is of type I if ad oly if i + k < λ, or equivaletly, i < λ k = k. If k 0 (i.e., if k /, the i < k ever happes, i.e., o i is of type I ad so all of the ( λ terms i the sum E(T are of the form E(a j a j a j3 a j4. O the other had, if k > 0 (i.e., if k < /, the i < k = λ k sometimes happes; amely, it happes if ad oly if i is oe of the λ k itegers 0,,...,λ k. I that case, each of those λ k values of i is of type I, which implies that precisely λ k of the ( λ terms i the sum E(T are of the form E(a j a j a j3 ad the remaiig terms are of the form E(a j a j a j3 a j4. This implies that we have 6 ( λ 6 E(a j a j a j3 a j4 if k /, ( 8 E(T = λ E(a j a j a j3 a j4 8 +(λ k [ E(a j a j a j3 E(a j a j a j3 a j4 ] if k < /. Thus, if Ω = A, the 3 ( λ 3 / if k /, E(T = ( λ / + (λ k/ if k < /, 36 ad hece by (4.0 ad (4., λ/4 + λ(λ / if k /, 38 E(c 38 k = 3 λ/4 + λ(λ / + (λ k/ if k < /. 3 4 O the other had, if Ω = A,m, the 4 4 ( λ 4 43 m [4] / [4] if k /, E(T = ( 43 λ m [4] / [4] + (λ k[m [3] / [3] m [4] / [4] ] if k < /, ad hece 4 λ m [] 4 E(c + λ(λ m[4] if k /, k = [4] 4 λ m[] + λ(λ m[4] + (λ k [ ] m [3] m[4] if k < /. [] [4] [3] [4] 4 It the follows that if Ω = A, we have ( 5 λ ( λ(λ / ( (λ k 53 (4. E(c + + c = + +, 53 4 k= k= k= 55

7 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page Sheet of Expected Norms of Zero-Oe Polyomials whereas if Ω = A,m, we have 0 0 (4. E(c + + c = (λ m[] [] + (λ(λ m[4] [4] k= k= / ( [ 5 m [3] ] + (λ k 5 [3] m[4] [4]. k= Recallig that λ is simply shorthad for k, it is straightforward to verify that ( λ =, (λ ( ( λ =, 3 k= k= ad that / ( / if is eve, (λ k = ( / if is odd. 6 k= 6 So, if Ω = A, the from (4. we get 8 8 E(c + + c 4 = + ( ( 3 + ( if is eve, 4 ( + ( ( 3 + ( if is odd, 3 ( 3 + /6 if is eve, 3 = ( /6 if is odd, which, usig (. ad (4., implies E( α = = + if is eve, = + +3 if is odd, 3 4 or equivaletly (4. E A ( α 3 4 = (. 6 O the other had, if Ω = A,m, the from (4. we get 4 E(c c m [] 4 ( 4 = [] + m[4] ( ( [4] 3 + ( m [3] m[4] [3] ( [4] if is eve, 50 m [] ( m[4] ( ( [4] 3 + ( m [3] m[4] [3] ( [4] if is odd, 5 ( 5 m 5 = + m [4] /(3( 3 + m [3] ( m( /( [4] if is eve, ( 53 m 53 + m [4] /(3( 3 + m [3] ( m( + /( [4] if is odd, 55

8 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page 8 Sheet 8 of 8 P. Borwei, K.-K. S. Choi, ad I. Mercer which, usig (., implies 0 m 0 E( α 4 4 = m + m [4] 3( 3 + m[3] ( m( if is eve, [4] m m + m[4] 3( 3 + m[3] ( m( + if is odd, [4] or equivaletly 5 (4.5 E A,m ( α = m m + m[4] 3( 3 + m[3] ( m( 4 + ( [4]. Notice that if m is fixed ad approaches ifiity, the E A,m ( α approaches m m, i.e., for fixed m ad large, we expect a radom α A,m to correspod to a Sido set, as is cosistet with ituitio. If Ω = B, sice B := A + \ A, we get E B ( α 4 4 = α = E A + ( α E A ( α α B = ( by (4.. Therefore we have proved 8 Theorem 4. If m, we have 8 E A ( α 4 4 = (, E A,m ( α = m m + m[4] 3( 3 + m[3] ( m( 4 + ( [4] (if 4, 36 E B ( α = ( For completeess, we also determie E A,m ( α whe 3. If 3, we have 38 3 α(z = a 0 + a z + a z ad the 3 α 4 = c 0 + c + c 4 4 = (a 0 + a + a + (a 0 a + a a + (a 0 a 4 = a a 4 + a 4 + 4(a 0a + a 0a + a a + 4a 0 a a = a 0 + a + a + 4(a 0 a + a 0 a + a a + 4a 0 a a, 4 sice a j 0, } from which it readily follows that 4 E A,0 ( α = E A 3,0 ( α = 0, 50 E A, ( α = E A 3, ( α =, E A, ( α = E A 3, ( α = 6, E A3,3 ( α =. 55

9 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page Sheet of Expected Norms of Zero-Oe Polyomials We remark that substitutig m 0,,, 3} ito the secod equatio i Theorem 4. ad the formally cacellig commo factors as appropriate, we get 0 0 E A,3 ( α = 5 + 3( 4 + (, ( ( E A, ( α = 6, 5 5 E A, ( α =, E A,0 ( α = 0, yieldig results cosistet with the explicit averages just obtaied for 3. 5 Ubiquity of Sido Sets We show that our expressio for E A,m ( α yields a ew proof of a result that appears i articles by Godbole et al. [4] ad Nathaso [6]. Suppose Ω = A,m, ad as before, deote a typical elemet of A,m by 6 6 α(z = z β + + z β m. 8 Recall from Sectio that X := c c ( m is a oegative-iteger-valued radom variable o Ω that attais the value 0 if ad oly if β,...,β m } is a Sido set. We have 3 ( 3 m E A,m (X = E A,m (c + + c 35 m [4] 35 3( 3 36 = ( m( if is eve, [4] m [4] 36 ( 3 + m[3] ( m( + if is odd [4] m[4] 3 3( 3 + m[3] ( m( [4] 4 m(m (m (m 3 m = 4 4 6( 4 m4 3 if 4. O the other had, if we let B(, m be the umber of Sido sets i [] with 4 m elemets, the we have 4 E(X = ( 4 X = ( X ( 4 m α A,m m #α A,m : X(α > 0} α A,m,X>0 m 5 5 ( 5 B(, m. 5 m Hece we have proved (by essetially usig Markov s iequality the followig. 55

10 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page 0 Sheet 0 of 0 P. Borwei, K.-K. S. Choi, ad I. Mercer Corollary 5. For 4 m, we have 0 ( 0 ( B(, m m4 m 3 ad 5 Pr[β,...,β m } is Sido] > m Hece if m = o( /4, the as approaches ifiity, the probability that a radomly chose m-subset of [] is Sido approaches. Although whe m = o( /4, the probability that a radomly chose m-subset of [] is Sido approaches (i.e., α is m m for almost all α A,m, there are some other cases i which a positive proportio of polyomials i A,m have very large L 4 orm. For α A,m, sice for 0 k, c k = k j=0 a j a j+k, we have c 0 = m, ad for k, c k mim, k}. Therefore, we have 6 6 m+ 8 α = c0 + ck m + (m + ( k 8 k= k= k= m+ = m 4 3 m3 + 4m 4m m 3 3 = ( + o(m ( 3 m if = o(m as m, ad o the other had, from (4.5 we have ( + o(m 4 38 E A,m ( α ( α m α A,m 3 4 = ( 4 α 4 m 4 + } α α 4 x α >x x + ( α m α >x 4 x + ( 4 ( ( + o(m 3 m. m α It the follows that for ay x < ( + o(m 4 /(3, we have #α A 53,m : α 4 ( 4 > x} 53 ( + o(m4 /(3 x ( + o(m m ( m/3. 55

11 DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page Sheet of Expected Norms of Zero-Oe Polyomials I particular, for ay ǫ > 0, if m = c ad x = c m for 0 < c < ad 0 < c 0 < ( ǫc/3, we have 0 #α A,m : α > c m } ( ǫc /3 c m ( + ǫ( c /3 > 0 5 for sufficietly large ad m, i.e., there is a positive proportio of polyomials i 5 A,m havig large L 4 orm (ote that the L 4 orm i A,m is at most as large as ( + o(m. Refereces [] P. B. Borwei, Computatioal Excursios i Aalysis ad Number Theory. CMS Books i Mathematics/Ouvrages de Mathmatiques de la SMC 0. Spriger-Verlag, New York, 0. [] P. B. Borwei ad K.-K. S. Choi. The average orm of polyomials of fixed height. To appear. Author: re: [] please furish [3] P. Erdős, Some usolved problems. Michiga Math. J. 4(5, 0. details: ame of joural to which submitted or url; or [4] A. P. Godbole, S. Jaso, N. W. Locatore, Jr., ad R. Rapoport, Radom Sido sequeces. delete. J. Number Theory 5(, o.,. [5] J. E. Littlewood, Some Problems i Real ad Complex Aalysis. D.C. Heath, Lexigto, MA, [6] M. B. Nathaso. O the ubiquity of Sido sets. I: Number Theory. Spriger, New York, 04, 6 pp. 63. [] D. J. Newma ad J. S. Byres, The L 4 orm of a polyomial with coefficiets ±. Amer. Math. 8 Mothly (0, 4. 8 Departmet of Mathematics, Simo Fraser Uiversity, Buraby, BC, V5A S6 pborwei@cecm.sfu.ca 3 kkchoi@cecm.sfu.ca 3 Departmet of Mathematics, Atkiso Faculty, York Uiversity, Toroto, ON, M3J P3 idmercer@yorku.ca

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

The value of Banach limits on a certain sequence of all rational numbers in the interval (0,1) Bao Qi Feng

The value of Banach limits on a certain sequence of all rational numbers in the interval (0,1) Bao Qi Feng The value of Baach limits o a certai sequece of all ratioal umbers i the iterval 0, Bao Qi Feg Departmet of Mathematical Scieces, Ket State Uiversity, Tuscarawas, 330 Uiversity Dr. NE, New Philadelphia,

More information

TRIGONOMETRIC POLYNOMIALS WITH MANY REAL ZEROS AND A LITTLEWOOD-TYPE PROBLEM. Peter Borwein and Tamás Erdélyi. 1. Introduction

TRIGONOMETRIC POLYNOMIALS WITH MANY REAL ZEROS AND A LITTLEWOOD-TYPE PROBLEM. Peter Borwein and Tamás Erdélyi. 1. Introduction TRIGONOMETRIC POLYNOMIALS WITH MANY REAL ZEROS AND A LITTLEWOOD-TYPE PROBLEM Peter Borwei ad Tamás Erdélyi Abstract. We examie the size of a real trigoometric polyomial of degree at most havig at least

More information

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the

More information

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

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

More information

Problem Set 2 Solutions

Problem Set 2 Solutions CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S

More information

(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

(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 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

Zeros of Polynomials

Zeros of Polynomials Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Basics of Probability Theory (for Theory of Computation courses)

Basics of Probability Theory (for Theory of Computation courses) Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Assignment 5: Solutions

Assignment 5: Solutions McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients: Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!

More information

Discrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15

Discrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15 CS 70 Discrete Mathematics ad Probability Theory Sprig 2012 Alistair Siclair Note 15 Some Importat Distributios The first importat distributio we leared about i the last Lecture Note is the biomial distributio

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15 CS 70 Discrete Mathematics ad Probability Theory Summer 2014 James Cook Note 15 Some Importat Distributios I this ote we will itroduce three importat probability distributios that are widely used to model

More information

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS Joural of Algebra, Number Theory: Advaces ad Applicatios Volume, Number, 00, Pages 7-89 ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS OLCAY KARAATLI ad REFİK KESKİN Departmet

More information

Some p-adic congruences for p q -Catalan numbers

Some p-adic congruences for p q -Catalan numbers Some p-adic cogrueces for p q -Catala umbers Floria Luca Istituto de Matemáticas Uiversidad Nacioal Autóoma de México C.P. 58089, Morelia, Michoacá, México fluca@matmor.uam.mx Paul Thomas Youg Departmet

More information

Commutativity in Permutation Groups

Commutativity in Permutation Groups Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are

More information

Large holes in quasi-random graphs

Large holes in quasi-random graphs Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,

More information

Notes for Lecture 11

Notes for Lecture 11 U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with

More information

Math 140A Elementary Analysis Homework Questions 1

Math 140A Elementary Analysis Homework Questions 1 Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula

More information

On the distribution of coefficients of powers of positive polynomials

On the distribution of coefficients of powers of positive polynomials AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 49 (2011), Pages 239 243 O the distributio of coefficiets of powers of positive polyomials László Major Istitute of Mathematics Tampere Uiversity of Techology

More information

Boundaries and the James theorem

Boundaries and the James theorem Boudaries ad the James theorem L. Vesely 1. Itroductio The followig theorem is importat ad well kow. All spaces cosidered here are real ormed or Baach spaces. Give a ormed space X, we deote by B X ad S

More information

The standard deviation of the mean

The standard deviation of the mean Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider

More information

CS161 Handout 05 Summer 2013 July 10, 2013 Mathematical Terms and Identities

CS161 Handout 05 Summer 2013 July 10, 2013 Mathematical Terms and Identities CS161 Hadout 05 Summer 2013 July 10, 2013 Mathematical Terms ad Idetities Thaks to Ady Nguye ad Julie Tibshirai for their advice o this hadout. This hadout covers mathematical otatio ad idetities that

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

Math 475, Problem Set #12: Answers

Math 475, Problem Set #12: Answers Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe

More information

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

Hoggatt and King [lo] defined a complete sequence of natural numbers REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies

More information

Lecture 2: April 3, 2013

Lecture 2: April 3, 2013 TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

Law of the sum of Bernoulli random variables

Law of the sum of Bernoulli random variables Law of the sum of Beroulli radom variables Nicolas Chevallier Uiversité de Haute Alsace, 4, rue des frères Lumière 68093 Mulhouse icolas.chevallier@uha.fr December 006 Abstract Let be the set of all possible

More information

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 +

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 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Let us consider the following problem to warm up towards a more general statement.

Let us consider the following problem to warm up towards a more general statement. Lecture 4: Sequeces with repetitios, distributig idetical objects amog distict parties, the biomial theorem, ad some properties of biomial coefficiets Refereces: Relevat parts of chapter 15 of the Math

More information

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

The log-behavior of n p(n) and n p(n)/n Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a. Departmet of Mathematical Scieces Istructor: Daiva Puciskaite Discrete Mathematics Fermat s Little Theorem 43.. For all a Z 3, calculate a 2 ad a 3. Case a = 0. 0 0 2-times Case a 0. 0 0 3-times a a 2-times

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Week 5-6: The Binomial Coefficients

Week 5-6: The Binomial Coefficients Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers

More information

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l SRC Techical Note 1997-011 Jue 17, 1997 Tight Thresholds for The Pure Literal Rule Michael Mitzemacher d i g i t a l Systems Research Ceter 130 Lytto Aveue Palo Alto, Califoria 94301 http://www.research.digital.com/src/

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman: Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio

More information

Legendre-Stirling Permutations

Legendre-Stirling Permutations Legedre-Stirlig Permutatios Eric S. Egge Departmet of Mathematics Carleto College Northfield, MN 07 USA eegge@carleto.edu Abstract We first give a combiatorial iterpretatio of Everitt, Littlejoh, ad Wellma

More information

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Chapter 6 Principles of Data Reduction

Chapter 6 Principles of Data Reduction Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a

More information

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) = COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.

More information

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

More information

MDIV. Multiple divisor functions

MDIV. Multiple divisor functions MDIV. Multiple divisor fuctios The fuctios τ k For k, defie τ k ( to be the umber of (ordered factorisatios of ito k factors, i other words, the umber of ordered k-tuples (j, j 2,..., j k with j j 2...

More information

Math 216A Notes, Week 5

Math 216A Notes, Week 5 Math 6A Notes, Week 5 Scribe: Ayastassia Sebolt Disclaimer: These otes are ot early as polished (ad quite possibly ot early as correct) as a published paper. Please use them at your ow risk.. Thresholds

More information

Section 5.1 The Basics of Counting

Section 5.1 The Basics of Counting 1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

A 2nTH ORDER LINEAR DIFFERENCE EQUATION A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II C. T. LONG J. H. JORDAN* Washigto State Uiversity, Pullma, Washigto 1. INTRODUCTION I the first paper [2 ] i this series, we developed certai properties

More information

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers) Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.

More information

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play. Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers

More information

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio

More information

ON POINTWISE BINOMIAL APPROXIMATION

ON POINTWISE BINOMIAL APPROXIMATION Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece

More information

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002 ECE 330:541, Stochastic Sigals ad Systems Lecture Notes o Limit Theorems from robability Fall 00 I practice, there are two ways we ca costruct a ew sequece of radom variables from a old sequece of radom

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

Lecture 10: Mathematical Preliminaries

Lecture 10: Mathematical Preliminaries Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this

More information

COMMON FIXED POINT THEOREMS VIA w-distance

COMMON FIXED POINT THEOREMS VIA w-distance Bulleti of Mathematical Aalysis ad Applicatios ISSN: 1821-1291, URL: http://www.bmathaa.org Volume 3 Issue 3, Pages 182-189 COMMON FIXED POINT THEOREMS VIA w-distance (COMMUNICATED BY DENNY H. LEUNG) SUSHANTA

More information

Sieve Estimators: Consistency and Rates of Convergence

Sieve Estimators: Consistency and Rates of Convergence EECS 598: Statistical Learig Theory, Witer 2014 Topic 6 Sieve Estimators: Cosistecy ad Rates of Covergece Lecturer: Clayto Scott Scribe: Julia Katz-Samuels, Brado Oselio, Pi-Yu Che Disclaimer: These otes

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

arxiv: v1 [math.co] 5 Jan 2014

arxiv: v1 [math.co] 5 Jan 2014 O the degree distributio of a growig etwork model Lida Farczadi Uiversity of Waterloo lidafarczadi@gmailcom Nicholas Wormald Moash Uiversity ickwormald@moashedu arxiv:14010933v1 [mathco] 5 Ja 2014 Abstract

More information

Polynomial Functions and Their Graphs

Polynomial Functions and Their Graphs Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively

More information

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007 UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Roud For all Colorado Studets Grades 7- November, 7 The positive itegers are,,, 4, 5, 6, 7, 8, 9,,,,. The Pythagorea Theorem says that a + b =

More information

Dr. Clemens Kroll. Abstract

Dr. Clemens Kroll. Abstract Riema s Hypothesis ad Stieltjes Cojecture Riema s Hypothesis ad Stieltjes Cojecture Dr. Clemes Kroll Abstract It is show that Riema s hypothesis is true by showig that a equivalet statemet is true. Eve

More information

FINITE GROUPS WITH THREE RELATIVE COMMUTATIVITY DEGREES. Communicated by Ali Reza Ashrafi. 1. Introduction

FINITE GROUPS WITH THREE RELATIVE COMMUTATIVITY DEGREES. Communicated by Ali Reza Ashrafi. 1. Introduction Bulleti of the Iraia Mathematical Society Vol. 39 No. 2 203), pp 27-280. FINITE GROUPS WITH THREE RELATIVE COMMUTATIVITY DEGREES R. BARZGAR, A. ERFANIAN AND M. FARROKHI D. G. Commuicated by Ali Reza Ashrafi

More information

Math 2784 (or 2794W) University of Connecticut

Math 2784 (or 2794W) University of Connecticut ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really

More information

Riesz-Fischer Sequences and Lower Frame Bounds

Riesz-Fischer Sequences and Lower Frame Bounds Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.

More information

Math 4400/6400 Homework #7 solutions

Math 4400/6400 Homework #7 solutions MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH

More information

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by

More information

Math 4707 Spring 2018 (Darij Grinberg): homework set 4 page 1

Math 4707 Spring 2018 (Darij Grinberg): homework set 4 page 1 Math 4707 Sprig 2018 Darij Griberg): homewor set 4 page 1 Math 4707 Sprig 2018 Darij Griberg): homewor set 4 due date: Wedesday 11 April 2018 at the begiig of class, or before that by email or moodle Please

More information

Shannon s noiseless coding theorem

Shannon s noiseless coding theorem 18.310 lecture otes May 4, 2015 Shao s oiseless codig theorem Lecturer: Michel Goemas I these otes we discuss Shao s oiseless codig theorem, which is oe of the foudig results of the field of iformatio

More information

Classroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in

Classroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in Classroom I this sectio of Resoace, we ivite readers to pose questios likely to be raised i a classroom situatio. We may suggest strategies for dealig with them, or ivite resposes, or both. Classroom is

More information

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n BINOMIAL PREDICTORS VLADIMIR SHEVELEV arxiv:0907.3302v2 [math.nt] 22 Jul 2009 Abstract. For oegative itegers, k, cosider the set A,k = { [0, 1,..., ] : 2 k ( ). Let the biary epasio of + 1 be: + 1 = 2

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

Sequences of Definite Integrals, Factorials and Double Factorials

Sequences of Definite Integrals, Factorials and Double Factorials 47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology

More information

Some remarks for codes and lattices over imaginary quadratic

Some remarks for codes and lattices over imaginary quadratic Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract

More information

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS H. W. Gould Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV

More information

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

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

Injections, Surjections, and the Pigeonhole Principle

Injections, Surjections, and the Pigeonhole Principle Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

Math 220A Fall 2007 Homework #2. Will Garner A

Math 220A Fall 2007 Homework #2. Will Garner A Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative

More information

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]

More information