Some remarks for codes and lattices over imaginary quadratic

Size: px
Start display at page:

Download "Some remarks for codes and lattices over imaginary quadratic"

Transcription

1 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. Abstract Let l > 0 be a square-free iteger, l 3 mod, K = Q( l), ad O K the rig of itegers of K. Codes C over rigs R := O K/pO K determie lattices Λ l (C) over K. The theta series θ Λl (C) of such lattice ca be writte i terms of the complete weight eumerator of C. For ay l > l the first l+1 terms of their correspodig theta fuctios are the same with those of Λ l (C). I [6] it was cojectured that for l > p(+1)(+2) there is a uique complete weight 2 eumerator correspodig to a give theta fuctio. I this paper, we explore this cojecture ad some ew computatioal results. 1 Itroductio Keywords Codes, theta fuctios, complete weight eumerators Let l > 0 be a square-free iteger cogruet to 3 modulo, K = Q( l) be the imagiary quadratic field, ad O K its rig of itegers. Codes, Hermitia lattices, ad their theta-fuctios over rigs R := O K /po K, for small primes p, have bee studied by may authors, see [1], [], [5], amog others. I [1], explicit descriptios of theta fuctios ad MacWilliams idetities are give for p = 2, 3. I [7] we explored codes C defied over R for p > 2. For ay l oe ca costruct a lattice Λ l (C) via Costructio A ad defie theta fuctios based o the structure of the rig R. Such costructios suggested some relatios betwee the complete weight eumerator of the code ad the theta fuctio of the correspodig lattice. I this paper we further study the weight eumerators of such codes i terms of the theta fuctios of the correspodig lattices. For ay prime p with p l, let R := O K /po K = { a + bω : a, b F p, ω 2 + ω + d = 0 }, where d = (l + 1)/. We have the map ρ l,p : O K O K /po k =: R A liear code C of legth over R is a R-submodule of R. The dual is defied as C = {u R : u v = 0 for all v C}. If C = C the C is self-dual. We defie Λ l (C) := {u = (u 1,..., u ) O K : (ρ l,p (u 1 ),..., ρ l,p (u )) C}, I other words, Λ l (C) cosists of all vectors i OK i the iverse image of C, take compoetwise by ρ l,p. This method of lattice costructio is kow as Costructio A. Let τ H = {z C : Im(z) > 0}, the upper-half plae. Ad let q = e πiτ. For ay lattice Λ i K, we have a associated theta fuctio θ Λ (q), give by θ Λ (q) = z Λ q z z, where deotes the usual dot product ad z deotes compoet-wise cojugatio. Thus, for ay liear code C, we have a associated lattice Λ l (C) ad associated theta fuctio θ Λl (C)(q).

2 For otatio, let r a+pb+1 = a bω, so R = { r 1,..., r p 2}. For a codeword u = (u1,..., u ) R ad r i R, we defie the coutig fuctio i (u) := #{j : u j = r i }. The complete weight eumerator of the R code C is the polyomial cwe C (z 1, z 2,..., z p 2) = u C z 1(u) 1 z 2(u) 2... z p 2 (u) p 2. (1) We ca use the complete weight eumerator polyomial to fid the theta fuctio of the lattice Λ l (C). For a proof of the followig result see [7]. Lemma 1. Let C be a code defied over R ad cwe C its complete weight eumerator as above. For itegers a ad b ad a prime p, let Λ a,b deote the lattice a bω l + po K. The, θ Λl (C)(q) = cwe C (θ Λ0,0 (q), θ Λ1,0 (q),..., θ Λp 1,p 1 (q)). Note that the q 2 argumets of this polyomial ca be computed i terms of certai oedimesioal theta series which are defied i Sectio 2.1 of [7]. I [2], for p = 2, the symmetric weight eumerator polyomial swe C of a code C over a rig or field of cardiality is defied to be swe C (X, Y, Z) = cwe C (X, Y, Z, Z). For Λ Λl (C)(q), the lattice obtaied from C by Costructio A, by Theorem 5.2 of [2], oe ca the write θ Λl (C)(q) = swe C (θ Λ0,0 (q), θ Λ1,0 (q), θ Λ0,1 (q)). These theta fuctios are referred to as A d (q), C d (q), ad G d (q) i [2] ad [8]. Remark 1. The coectio betwee complete weight eumerators of self-dual codes over F p ad Siegel theta series of uimodular lattices is well kow. Costructio A associates to ay legth code C = C a -dimesioal uimodular lattice; see [3] for details. For p > 2, however, there are (p+1)2 theta fuctios associated to the various lattices, so our aalog of the symmetric weight eumerator polyomial eeds more tha 3 variables. Problem 1. Determie a explicit relatio betwee theta fuctios ad the symmetric weight eumerator polyomial of a code defied over R for p > 3. We expect that the aswer to the above problem is that the theta fuctio is give as the symmetric weight eumerator swe C of C, evaluated o the theta fuctios defied o cosets of O K /po K. 2 Theta fuctios ad the correspodig complete weight eumerator polyomials For a fixed prime p, let C be a liear code over R = F p 2 or F p F p of legth ad dimesio k. A admissible level l is a iteger l such that O K /po K is isomorphic to R. For a admissible l, let Λ l (C) be the correspodig lattice as i the previous sectio. The, the level l theta fuctio θ Λl (C)(q) of the lattice Λ l (C) is determied by the complete weight eumerator cwe C of C, evaluated o the theta fuctios defied o cosets of O K /po K. We cosider the followig questios. How do the theta fuctios θ Λl (C)(q) of the same code C differ for differet levels l? Ca o-equivalet codes give the same theta fuctios for all levels l? We give a satisfactory aswer to the first questio (cf. Theorem 1, Lemma 2) ad for the secod questio we cojecture that: Cojecture 1. Let C be a code of size defied over R ad θ Λl (C) be its correspodig theta fuctio for level l. The, for large eough l, there is a uique complete weight eumerator polyomial which correspods to θ Λl (C). Let C be a code defied over R for a fixed p > 2. Let the complete weight eumerator of C be the degree polyomial cwe C = f(x 1,..., x r ), for r = p 2. The from Lemma 1 we have that θ Λl (C)(q) = f(θ Λ0,0 (q),..., θ Λp 1,p 1 (q)) for a give l. First we wat to address how θ Λl (C)(q) ad θ Λl (C)(q) differ for differet l ad l.

3 Theorem 1. Let C be a code defied over R. For all admissible l, l with l < l the followig holds θ Λl (C)(q) = θ Λl (C)(q) + O(q l+1 ). Proof. See [6] for details. We have the followig lemma; see [6]. Lemma 2. Let C be a fixed code of size defied over R ad θ(q) = λ i q i be its theta fuctio for level l. The, there exists a boud B l,p, such that θ(q) is uiquely determied by its first B l,p, coefficiets. For otatio, whe p ad are fixed, we will let B l = B l,p,. To exted the theory for p = 2 to p > 2 we have to fid a relatio betwee the theta fuctio θ Λl (C) ad the umber of complete weight eumerator polyomials correspodig to it. Fix a odd prime p ad let C be a give code of legth over R. Choose a admissible value of l such that there are (p+1)2 idepedet theta fuctios. The, the complete weight eumerator of C has degree ad r = (p+1)2 variables x 1,..., x r. We call a geeric complete weight eumerator polyomial a homogeous polyomial P Q[x 1,..., x r ]. Deote by P (x 1,..., x r ) a geeric r-ary, degree, homogeeous polyomial. Assume that there is a legth code C defied over R such that P (x 1,..., x r ) is the symmetric weight eumerator polyomial. I other words, Fix the level l. The, by replacig swe C (x 1,..., x r ) = P (x 1,..., x r ) x 1 = θ Λ0,0 (q),......, x r = θ Λp 1,p 1 (q), we compute the left side of the above equatio as a series i=0 λ iq i. By equatig both sides of i=0 λ iq i = P (x 1,..., x r ), we ca get a liear system of equatios. Sice the first λ 0,..., λ Bl 1 determie all the coefficiets of the theta series the we have to pick B l equatios (these equatios are ot ecessarily idepedet). Cosider the coefficiets of the polyomial P (x 1,..., x r ) as parameters c 1,... c s. The, the liear map L l : C s C B l 1 (c 1,... c s ) (λ 0,..., λ Bl 1) has a associated matrix M l. For a fixed value of (λ 0,..., λ Bl 1), determiig the rak of the matrix M l would determie the umber of polyomials givig the same theta series. There is a uique complete weight eumerator correspodig to a give theta fuctio whe ull (M l ) = s rak (M l ) = 0 Cojecture 2. For l p(+1)(+2) 1 we have ull M l = 0, or i other words ) ( 1 + (p+1)2! rak (M l ) = ( )! (p+1) 2 1! The choice of l is take from experimetal results for primes p = 2 ad 3. More details are give i the ext sectio. It is obvious that Cojecture 2 implies Cojecture 1. If Cojecture 1 is true the for large eough l there would be a oe to oe correspodece betwee the complete weight eumerator polyomials ad the correspodig theta fuctios. Perhaps, more iterestig is to fid l ad p for which there is ot a oe to oe such correspodece. Cosider the map Φ(l, p) = (λ 0 (l, p),..., λ Bl 1(l, p)), where λ 0,..., λ Bl 1 are ow fuctios i l ad p. Let V be the variety give by the Jacobia of the map Φ. Fidig iteger poits l, p o this variety such that l ad p satisfy our assumptios would give us values for l, p whe the above correspodece is ot oe to oe. However, it seems quite hard to get explicit descriptio of the map Φ. Next, we will try to shed some light over the above cojectures for fixed small primes p.

4 3 Bouds for small primes I [8] we determie explicit bouds for the above theorems for prime p = 2. I this sectio we give some computatio evidece for the geeralizatio of the result for p = 3. We recall the theorem for p = 2. Theorem 2 ([8], Thm. 2). Let p = 2 ad C be a code of size defied over R ad θ Λl (C) be its correspodig theta fuctio for level l. The the followig hold: i) For l < 2(+1)(+2) 1 there is a δ-dimesioal family of symmetrized weight eumerator polyomials correspodig to θ Λl (C), where δ (+1)(+2) 2 (l+1) 1. ii) For l 2(+1)(+2) 1 ad < l+1 there is a uique symmetrized weight eumerator polyomial which correspods to θ Λl (C). These results were obtaied by usig the explicit expressio of theta i terms of the symmetric weight eumerator valuated o the theta fuctios of the cosets. Next we wat to fid explicit bouds for p = 3 as i the case of p = 2. I the case of p = 3 it is eough to cosider four theta fuctios, θ Λ0,0 (q), θ Λ1,0 (q), θ Λ0,1 (q), ad θ Λ1,1 (q) sice θ Λ2,0 (q) = θ Λ1,0 (q), θ Λ2,2 (q) = θ Λ1,1 (q) ad θ Λ0,2 (q) = θ Λ1,2 (q) = θ Λ2,1 (q) = θ Λ0,1 (q). If we are give a code C ad its weight eumerator polyomial the we ca fid the theta fuctio of the lattice costructed from C usig Costructio A. Let θ(q) = i=0 λ iq i be the theta series for level l ad p(x, y, z, w) = c i,j,k x i y j z k w m i+j+k+m= be a degree geeric -ary homogeeous polyomial. We would like to fid out how may polyomials p(x, y, z, w) correspod to θ(q) for a fixed l. For a give l fid θ Λ0,0 (q), θ Λ1,0 (q), θ Λ0,1 (q) ad θ Λ1,1 (q) ad substitute them i the p(x, y, z, w). Hece, p(x, y, z, w) is ow writte as a series i q. We get ifiitely may equatios by equatig the correspodig coefficiets of the two sides of the equatio p(θ Λ0,0 (q), θ Λ1,0 (q), θ Λ0,1 (q), θ Λ1,1 (q)) = λ i q i. Sice the first λ 0,..., λ Bl 1 determie all the coefficiets of the theta series the it is eough to pick the first B l equatios. The liear map L l : (c 1,... c 20 ) (λ 0,..., λ Bl 1) has a associated matrix M l. If the ullity of M l is zero the we have a uique polyomial that correspods to the give theta series. We have calculated the ullity of the matrix ad B l for small ad l. Example 1 (The case p = 3, = 3). The geeric homogeous polyomial is give by i=0 P (x, y, z) = c 1 x 3 + c 2 x 2 y + c 3 x 2 z + c x 2 w + c 5 xy 2 + c 6 xz 2 + c 7 xw 2 + c 8 xyz + c 9 xyw + c 10 xzw + c 11 y 3 + c 12 y 2 z + c 13 y 2 w + c 1 yz 2 + c 15 yw 2 + c 16 yzw + c 17 z 3 + c 18 z 2 w + c 19 zw 2 + c 20 w 3. (2) The system of equatios ca be writte by the form of A c = λ where c = ( c 1 c 2 c 20 ) t, λ = ( λ0 λ 1 λ 15 ) t. I the case of l = 7 the matrix M7 has ull (M 7 ) =. We have a positive dimesio family of solutio set. The case of l = 11 the matrix M 11 has ull (M 11 ) = 1. For ay case where l 19 the ullity of the matrix is 0. Hece, for every give theta series, there is a uique symmetric weight eumerator polyomial.. We summarize the results i the followig table:

5 l = 3 = = 5 B l ull M l B l ull M l B l ull M l Recall that l 3 mod ad p l. It seems from the table that the same boud of B l = 2(+1)(+2) as for p = 2 holds also for p = 3, = 3. We have the followig cojecture for geeral p, ad l. Cojecture 3. For a give theta fuctio θ Λl (C) of a code C for level l there is a uique complete weight eumerator polyomial correspodig to θ Λl (C) if l p(+1)(+2). It is iterestig to cosider such questio for such lattices idepedetly of the coectio to codig theory. What is the meaig of the boud B l for the rig O K /po K? Do the theta fuctios defied here correspod to ay modular forms? Is there ay differece betwee the cases whe the rig is F p F p or F p 2? Refereces [1] C. Bachoc, Applicatios of codig theory to the costructio of modular lattices. J. Combi. Theory Ser. A 78 (1997), o. 1, [2] K. S. Chua, Codes over GF() ad F 2 F 2 ad Hermitia lattices over imagiary quadratic fields. Proc. Amer. Math. Soc. 133 (2005), o. 3, (electroic). [3] J. Leech ad N. J. A. Sloae, Sphere packig ad error-correctig codes, Caadia J. Math., 23, (1971), [] F. J. MacWilliams, N. J. A. Sloae, The theory of error-correctig codes. II. North-Hollad Mathematical Library, Vol. 16. North-Hollad Publishig Co., Amsterdam-New York-Oxford, pp. i ix ad [5] F. J. MacWilliams, N. J. A. Sloae, The theory of error-correctig codes. I. North-Hollad Mathematical Library, Vol. 16. North-Hollad Publishig Co., Amsterdam-New York-Oxford, pp. i xv ad [6] T. Shaska, C. Shor, C. S. Wijesiri, Codes over rigs of size p 2 ad lattices over imagiary quadratic fields. Fiite Fields Appl. 16 (2010), o. 2, [7] T. Shaska ad C. Shor, Codes over F p 2 ad F p F p, lattices, ad correspodig theta fuctios. Advaces i Codig Theory ad Cryptology, vol 3. (2007), pg [8] T. Shaska ad S. Wijesiri, Codes over rigs of size four, Hermitia lattices, ad correspodig theta fuctios, Proc. Amer. Math. Soc., 136 (2008), [9] T. Shaska ad C. Shor, Theta fuctios ad complete weight eumerators for codes over imagiary quadratic fields, (work i progress).

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)

More information

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

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4. 11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although

More information

Complex Numbers Solutions

Complex Numbers Solutions Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

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

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

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

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

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

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

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

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

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

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

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163

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

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

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

4 The Sperner property.

4 The Sperner property. 4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,

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

Binary codes from graphs on triples and permutation decoding

Binary codes from graphs on triples and permutation decoding Biary codes from graphs o triples ad permutatio decodig J. D. Key Departmet of Mathematical Scieces Clemso Uiversity Clemso SC 29634 U.S.A. J. Moori ad B. G. Rodrigues School of Mathematics Statistics

More information

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION ANOTHER GENERALIZED FIBONACCI SEQUENCE MARCELLUS E. WADDILL A N D LOUIS SACKS Wake Forest College, Wisto Salem, N. C., ad Uiversity of ittsburgh, ittsburgh, a. 1. INTRODUCTION Recet issues of umerous periodicals

More information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 304: MIDTERM EXAM SOLUTIONS MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

Journal of Ramanujan Mathematical Society, Vol. 24, No. 2 (2009)

Journal of Ramanujan Mathematical Society, Vol. 24, No. 2 (2009) Joural of Ramaua Mathematical Society, Vol. 4, No. (009) 199-09. IWASAWA λ-invariants AND Γ-TRANSFORMS Aupam Saikia 1 ad Rupam Barma Abstract. I this paper we study a relatio betwee the λ-ivariats of a

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

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

More information

Math 128A: Homework 1 Solutions

Math 128A: Homework 1 Solutions Math 8A: Homework Solutios Due: Jue. Determie the limits of the followig sequeces as. a) a = +. lim a + = lim =. b) a = + ). c) a = si4 +6) +. lim a = lim = lim + ) [ + ) ] = [ e ] = e 6. Observe that

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

Enumerative & Asymptotic Combinatorics

Enumerative & Asymptotic Combinatorics C50 Eumerative & Asymptotic Combiatorics Stirlig ad Lagrage Sprig 2003 This sectio of the otes cotais proofs of Stirlig s formula ad the Lagrage Iversio Formula. Stirlig s formula Theorem 1 (Stirlig s

More information

3 Gauss map and continued fractions

3 Gauss map and continued fractions ICTP, Trieste, July 08 Gauss map ad cotiued fractios I this lecture we will itroduce the Gauss map, which is very importat for its coectio with cotiued fractios i umber theory. The Gauss map G : [0, ]

More information

1 Generating functions for balls in boxes

1 Generating functions for balls in boxes Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways

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

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y Questio (a) A square matrix A= A is called positive defiite if the quadratic form waw > 0 for every o-zero vector w [Note: Here (.) deotes the traspose of a matrix or a vector]. Let 0 A = 0 = show that:

More information

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots.

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots. 15 Cubics, Quartics ad Polygos It is iterestig to chase through the argumets of 14 ad see how this affects solvig polyomial equatios i specific examples We make a global assumptio that the characteristic

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

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 enumeration of flags in finite vector spaces

An enumeration of flags in finite vector spaces A eumeratio of flags i fiite vector spaces C Rya Viroot Departmet of Mathematics College of William ad Mary P O Box 8795 Williamsburg VA 23187 viroot@mathwmedu Submitted: Feb 2 2012; Accepted: Ju 27 2012;

More information

SOME TRIBONACCI IDENTITIES

SOME TRIBONACCI IDENTITIES Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece

More information

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) = AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,

More information

8. Applications To Linear Differential Equations

8. Applications To Linear Differential Equations 8. Applicatios To Liear Differetial Equatios 8.. Itroductio 8.. Review Of Results Cocerig Liear Differetial Equatios Of First Ad Secod Orders 8.3. Eercises 8.4. Liear Differetial Equatios Of Order N 8.5.

More information

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this

More information

CHAPTER 5. Theory and Solution Using Matrix Techniques

CHAPTER 5. Theory and Solution Using Matrix Techniques A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL

More information

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

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca Idia J Pure Appl Math 45): 75-89 February 204 c Idia Natioal Sciece Academy A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS Mircea Merca Departmet of Mathematics Uiversity

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

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

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

Bijective Proofs of Gould s and Rothe s Identities

Bijective Proofs of Gould s and Rothe s Identities ESI The Erwi Schrödiger Iteratioal Boltzmagasse 9 Istitute for Mathematical Physics A-1090 Wie, Austria Bijective Proofs of Gould s ad Rothe s Idetities Victor J. W. Guo Viea, Preprit ESI 2072 (2008 November

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

Largest families without an r-fork

Largest families without an r-fork Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite

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

A Note on Matrix Rigidity

A Note on Matrix Rigidity A Note o Matrix Rigidity Joel Friedma Departmet of Computer Sciece Priceto Uiversity Priceto, NJ 08544 Jue 25, 1990 Revised October 25, 1991 Abstract I this paper we give a explicit costructio of matrices

More information

Subject: Differential Equations & Mathematical Modeling-III

Subject: Differential Equations & Mathematical Modeling-III Power Series Solutios of Differetial Equatios about Sigular poits Subject: Differetial Equatios & Mathematical Modelig-III Lesso: Power series solutios of differetial equatios about Sigular poits Lesso

More information

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

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;

More information

Section 11.8: Power Series

Section 11.8: Power Series Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i

More information

R is a scalar defined as follows:

R is a scalar defined as follows: Math 8. Notes o Dot Product, Cross Product, Plaes, Area, ad Volumes This lecture focuses primarily o the dot product ad its may applicatios, especially i the measuremet of agles ad scalar projectio ad

More information

Presentation of complex number in Cartesian and polar coordinate system

Presentation of complex number in Cartesian and polar coordinate system a + bi, aεr, bεr i = z = a + bi a = Re(z), b = Im(z) give z = a + bi & w = c + di, a + bi = c + di a = c & b = d The complex cojugate of z = a + bi is z = a bi The sum of complex cojugates is real: z +

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES 9 SEQUENCES AND SERIES INTRODUCTION Sequeces have may importat applicatios i several spheres of huma activities Whe a collectio of objects is arraged i a defiite order such that it has a idetified first

More information

Another diametric theorem in Hamming spaces: optimal group anticodes

Another diametric theorem in Hamming spaces: optimal group anticodes Aother diametric theorem i Hammig spaces: optimal group aticodes Rudolf Ahlswede Departmet of Mathematics Uiversity of Bielefeld POB 003, D-3350 Bielefeld, Germay Email: ahlswede@math.ui-bielefeld.de Abstract

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

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

(for homogeneous primes P ) defining global complex algebraic geometry. Definition: (a) A subset V CP n is algebraic if there is a homogeneous

(for homogeneous primes P ) defining global complex algebraic geometry. Definition: (a) A subset V CP n is algebraic if there is a homogeneous Math 6130 Notes. Fall 2002. 4. Projective Varieties ad their Sheaves of Regular Fuctios. These are the geometric objects associated to the graded domais: C[x 0,x 1,..., x ]/P (for homogeeous primes P )

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig

More information

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

#A51 INTEGERS 14 (2014) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES #A5 INTEGERS 4 (24) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES Kohtaro Imatomi Graduate School of Mathematics, Kyushu Uiversity, Nishi-ku, Fukuoka, Japa k-imatomi@math.kyushu-u.ac.p

More information

CALCULATING FIBONACCI VECTORS

CALCULATING FIBONACCI VECTORS THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet

More information

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

AMS Mathematics Subject Classification : 40A05, 40A99, 42A10. Key words and phrases : Harmonic series, Fourier series. 1. J. Appl. Math. & Computig Vol. x 00y), No. z, pp. A RECURSION FOR ALERNAING HARMONIC SERIES ÁRPÁD BÉNYI Abstract. We preset a coveiet recursive formula for the sums of alteratig harmoic series of odd order.

More information

Polynomial identity testing and global minimum cut

Polynomial identity testing and global minimum cut CHAPTER 6 Polyomial idetity testig ad global miimum cut I this lecture we will cosider two further problems that ca be solved usig probabilistic algorithms. I the first half, we will cosider the problem

More information

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j. Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α

More information

A NOTE ON PASCAL S MATRIX. Gi-Sang Cheon, Jin-Soo Kim and Haeng-Won Yoon

A NOTE ON PASCAL S MATRIX. Gi-Sang Cheon, Jin-Soo Kim and Haeng-Won Yoon J Korea Soc Math Educ Ser B: Pure Appl Math 6(1999), o 2 121 127 A NOTE ON PASCAL S MATRIX Gi-Sag Cheo, Ji-Soo Kim ad Haeg-Wo Yoo Abstract We ca get the Pascal s matrix of order by takig the first rows

More information

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

Implicit function theorem

Implicit function theorem Jovo Jaric Implicit fuctio theorem The reader kows that the equatio of a curve i the x - plae ca be expressed F x, =., this does ot ecessaril represet a fuctio. Take, for example F x, = 2x x =. (1 either

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

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

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

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

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

Benaissa Bernoussi Université Abdelmalek Essaadi, ENSAT de Tanger, B.P. 416, Tanger, Morocco

Benaissa Bernoussi Université Abdelmalek Essaadi, ENSAT de Tanger, B.P. 416, Tanger, Morocco EXTENDING THE BERNOULLI-EULER METHOD FOR FINDING ZEROS OF HOLOMORPHIC FUNCTIONS Beaissa Beroussi Uiversité Abdelmalek Essaadi, ENSAT de Tager, B.P. 416, Tager, Morocco e-mail: Beaissa@fstt.ac.ma Mustapha

More information

Question 1: The magnetic case

Question 1: The magnetic case September 6, 018 Corell Uiversity, Departmet of Physics PHYS 337, Advace E&M, HW # 4, due: 9/19/018, 11:15 AM Questio 1: The magetic case I class, we skipped over some details, so here you are asked to

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

Math Solutions to homework 6

Math Solutions to homework 6 Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there

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

Chimica Inorganica 3

Chimica Inorganica 3 himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule

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

PAPER : IIT-JAM 2010

PAPER : IIT-JAM 2010 MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure

More information

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS BROTHER ALFRED BROUSSEAU St. Mary's College, Califoria Give a secod-order liear recursio relatio (.1) T. 1 = a T + b T 1,

More information

On forward improvement iteration for stopping problems

On forward improvement iteration for stopping problems O forward improvemet iteratio for stoppig problems Mathematical Istitute, Uiversity of Kiel, Ludewig-Mey-Str. 4, D-24098 Kiel, Germay irle@math.ui-iel.de Albrecht Irle Abstract. We cosider the optimal

More information

Frequency Response of FIR Filters

Frequency Response of FIR Filters EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state

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

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad

More information

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?

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? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

Linear Differential Equations of Higher Order Basic Theory: Initial-Value Problems d y d y dy

Linear Differential Equations of Higher Order Basic Theory: Initial-Value Problems d y d y dy Liear Differetial Equatios of Higher Order Basic Theory: Iitial-Value Problems d y d y dy Solve: a( ) + a ( )... a ( ) a0( ) y g( ) + + + = d d d ( ) Subject to: y( 0) = y0, y ( 0) = y,..., y ( 0) = y

More information

PAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION

PAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION Iteratioal Joural of Pure ad Applied Mathematics Volume 94 No. 204, 9-20 ISSN: 3-8080 (prited versio); ISSN: 34-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/0.2732/ijpam.v94i.2 PAijpam.eu

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

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

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

On the Lebesgue constant for the Xu interpolation formula

On the Lebesgue constant for the Xu interpolation formula O the Lebesgue costat for the Xu iterpolatio formula Le Bos Dept. of Mathematics ad Statistics, Uiversity of Calgary Caada Stefao De Marchi Dept. of Computer Sciece, Uiversity of Veroa Italy Marco Viaello

More information