Course : Algebraic Combinatorics

Size: px
Start display at page:

Download "Course : Algebraic Combinatorics"

Transcription

1 Course 8.32: Algebraic Combiatorics Lecture Notes # Addedum by Gregg Musier February 4th - 6th, 2009 Recurrece Relatios ad Geeratig Fuctios Give a ifiite sequece of umbers, a geeratig fuctio is a compact way of expressig this data. We begi with the otio of ordiary geeratig fuctios. To illustrate this defiitio, we start with the example of the Fiboacci umbers. {F } =0 = {F 0, F, F 2, F 3,...} defied by F 0 =, F =, ad F = F + F 2 for 2. We defie,, 2, 3, 5, 8, 3, 2, 34,... F(X) := F 0 + F x + F 2 x2 + F 3 x3 + F 4 x = + x + 2x2 + 3x3 + 5x4 + 8x I other words, F(X) is the formal power series =0 F x. Remar. This is called a formal power series because we will cosider x to be a idetermiate variable rather tha a specific real umber. I geeral, give a sequece of umbers {a i } i=0 = {a 0, a, a 2, a 3,...}, the associated formal power series is A(X) := a x = a 0 + a x + a 2 x2 + a 3 x =0 We will shortly write dow F(X) i a compact form, but we begi with a easier example that you have already see.

2 ( )! Recall that =. For example,!( )! {( ) 8 } 8 = {, 8, 28, 56, 70, 56, 28, 8, }. =0 ( ) ( ) 8 8 I fact if > 8, (e.g. ) equals zero. Thus we ca cosider the etire ifiite 9 sequece as {( ) 8 } = {, 8, 28, 56, 70, 56, 28, 8,, 0, 0, 0,...}, =0 ad the the associated formal power series + 8x + 28x2 + 56x3 + 70x4 + 56x5 + 28x6 + 8x7 + x8 + 0x9 + 0x ca be writte compactly as ( + x) 8. {( )} Geeralizig this to ay positive iteger, has associated power series ( ) =0 ( + x), sice ( + x) = =0 x by the Biomial Theorem. This illustrates that from a formal power series, we ca recover a sequece of umbers. We call these umbers the coefficiets of the formal power series. For ( ) example, we say that is the coefficiet of x i ( + x). This is sometimes ( ) ( ) writte as ( + x) = or [x ]( + x) =. x. More complicated formal power series We ow wat to write a similar expressio for F(X) = =0 F x, where F = F + F 2 for 2 ad F 0 = F =. Notice that a x ± b x = (a ± b )x. =0 =0 =0 As a cosequece, F = F + F 2 for 2 implies F(X) = + F x + =2 F x = + F x + (F + F 2 )x =2 = + F x + F x + F 2 x =2 =2 ( ) = + F x + xf(x) F 0 x + x2 F(X).

3 Thus ad we obtai the ratioal expressio F(X)( x x2 ) = + (F F 0 )x = + 0x F(X) =. x x 2 If we loo at the Taylor series for this ratioal fuctio, we ideed obtai coefficiets that are the Fiboacci umbers. Geeratig Fuctios are also helpful for obtaiig closed formulas or asymptotic formulas. If we use partial fractio decompositio, we see that A B F(X) = +. λ x λ 2 x We ow that ( λ x)( λ 2 x) = x x 2 so Thus {λ, λ 2 } = { + 2 5, 5 }. 2 λ λ 2 λ λ 2 = ad = Exercise : Solve for A ad B ad use this to obtai a closed form expressio for F. Notice that as a cosequece we ca compute that {F + /F } = {/, 2/, 3/2, 5/3, 8/5, 3/8,...} ( ) coverges to 5 sice 5 0 as, so Aλ + + Bλ + 2 Aλ + = λ. Aλ + Bλ 2 Aλ.2 A Combiatorial Iterpretatio of the Fiboacci Numbers Give a sequece of itegers S = {s 0, s, s 2,...}, a combiatorial iterpretatio of S is a family F of objects (of various sizes) such that the umber of objects i F of size is exactly couted by s. For example, a combiatorial iterpretatio of ( ) is as the umber of subsets of a {, 2,..., } of size. A domio tilig of a rectagular regio R is a coverig of R by horizotal (-by-2) domio tiles ad vertical (2-by-) domio tiles such that every square of R is covered by exactly oe domio.

4 For example, if we let R be a 2-by-2 grid, the there are two possible domio tiligs. Either both tiles are vertical or both are horizotal. If we let R be a 2-by-3 grid, the there are three possible domio tiligs, ad a 2-by-4 grid would have five such domio tiligs. Propositio. The umber of domio tiligs of a 2-by- grid is couted by the th Fiboacci umber, F for. Proof. Let DT deote the umber of domio tiligs of the 2-by- grid. We first chec the iitial coditios. There is oe way to tile the 2-by- grid, ad there are two ways to tile the 2-by-2 grid. Thus DT = = F ad DT 2 = 2 = F 2. (Recall that F 0 =, but we do ot use this quatity i this combiatorial iterpretatio.) Domio tiligs of the 2-by- grid either loo lie a domio tilig of the 2-by ( ) grid with a vertical tile taced oto the ed, or a domio tilig of the 2-by-( 2) grid with two horizotal tiles taced oto the ed. Cosequetly, DT = DT + DT 2, the same recurrece as the F s. Exercise 2: Show that this combiatorial iterpretatio ca be rephrased as the statemet F = The umber of subsets S of {a, a 2,...,a } such that a i ad a i+ are ot both cotaied i S..3 Covolutio Product Formula I additio to addig formal power series together, we ca also multiply them. If A(X) = =0 a x ad B(X) = =0 b x, where a (resp. b ) couts the umber of objects of type A (resp. B) ad size, the A(X)B(X) = C(X) = c x where c = a b, ad has a combiatorial iterpretatio as the umber of =0 objects of size formed by taig a object of type A ad cocateatig it with a object of type B. =0

5 .4 Coectio betwee Liear Recurreces ad Ratioal Geeratig Fuctios The behavior we saw of the Fiboacci umbers ad its geeratig fuctio is a example of a more geeral theorem. Theorem. (Theorem 4.. of Eumerative Combiatorics by Richard Staley) Let α, α 2,...,α d be a fixed sequece of complex umbers, d, ad α d = 0. The followig coditios o a fuctio f : N C are equivalet: i) The geeratig fuctio F(X) equals f()x = =0 P(x) Q(x) where Q(x) = + α x + α 2 x α d x d ad P(x) is a polyomial of degree < d. ii) For all 0, f() satisfies the liear recurrece relatio f( + d) + α f( + d ) + α 2 f( + d 2) α d f() = 0. where iii) For all 0, f() = P i ()γ i i= + α x + α 2 x α d xd = ( γ i x) e i with the γ i s distict ad each P i () is a uivariate polyomial (i ) of degree less tha e i. i= Defitio. A geeratig fuctio of the form eratig fuctio. P (x) is a called a ratioal ge- Q(x)

6 MIT OpeCourseWare Algebraic Combiatorics Sprig 2009 For iformatio about citig these materials or our Terms of Use, visit:

Course : Algebraic Combinatorics

Course : Algebraic Combinatorics Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,

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

+ au n+1 + bu n = 0.)

+ au n+1 + bu n = 0.) Lecture 6 Recurreces - kth order: u +k + a u +k +... a k u k 0 where a... a k are give costats, u 0... u k are startig coditios. (Simple case: u + au + + bu 0.) How to solve explicitly - first, write characteristic

More information

Enumerative & Asymptotic Combinatorics

Enumerative & Asymptotic Combinatorics C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,

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

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT5821 Advaced Combiatorics 9 Set partitios ad permutatios It could be said that the mai objects of iterest i combiatorics are subsets, partitios ad permutatios of a fiite set. We have spet some time coutig

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

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

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

Ma 530 Infinite Series I

Ma 530 Infinite Series I Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li

More information

Unit 4: Polynomial and Rational Functions

Unit 4: Polynomial and Rational Functions 48 Uit 4: Polyomial ad Ratioal Fuctios Polyomial Fuctios A polyomial fuctio y px ( ) is a fuctio of the form p( x) ax + a x + a x +... + ax + ax+ a 1 1 1 0 where a, a 1,..., a, a1, a0are real costats ad

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

Solutions to Final Exam

Solutions to Final Exam Solutios to Fial Exam 1. Three married couples are seated together at the couter at Moty s Blue Plate Dier, occupyig six cosecutive seats. How may arragemets are there with o wife sittig ext to her ow

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

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

Properties and Tests of Zeros of Polynomial Functions

Properties and Tests of Zeros of Polynomial Functions Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

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

Solutions to Problem Set 8

Solutions to Problem Set 8 8.78 Solutios to Problem Set 8. We ow that ( ) ( + x) x. Now we plug i x, ω, ω ad add the three equatios. If 3 the we ll get a cotributio of + ω + ω + ω + ω 0, whereas if 3 we ll get a cotributio of +

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

Generating Functions II

Generating Functions II Geeratig Fuctios II Misha Lavrov ARML Practice 5/4/2014 Warm-up problems 1. Solve the recursio a +1 = 2a, a 0 = 1 by usig commo sese. 2. Solve the recursio b +1 = 2b + 1, b 0 = 1 by usig commo sese ad

More information

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0 GENERATING FUNCTIONS Give a ifiite sequece a 0,a,a,, its ordiary geeratig fuctio is A : a Geeratig fuctios are ofte useful for fidig a closed forula for the eleets of a sequece, fidig a recurrece forula,

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

Generating Functions. 1 Operations on generating functions

Generating Functions. 1 Operations on generating functions Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example

More information

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

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1 . Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely

More information

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences Aales Mathematicae et Iformaticae 43 2014 pp. 3 12 http://ami.etf.hu The log-cocavity ad log-covexity properties associated to hyperpell ad hyperpell-lucas sequeces Moussa Ahmia ab, Hacèe Belbachir b,

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

Roger Apéry's proof that zeta(3) is irrational

Roger Apéry's proof that zeta(3) is irrational Cliff Bott cliffbott@hotmail.com 11 October 2011 Roger Apéry's proof that zeta(3) is irratioal Roger Apéry developed a method for searchig for cotiued fractio represetatios of umbers that have a form such

More information

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture) CSI 101 Discrete Structures Witer 01 Prof. Lucia Moura Uiversity of Ottawa Homework Assigmet #4 (100 poits, weight %) Due: Thursday, April, at 1:00pm (i lecture) Program verificatio, Recurrece Relatios

More information

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif.

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif. AN ALMOST LINEAR RECURRENCE Doald E. Kuth Calif. Istitute of Techology, Pasadea, Calif. form A geeral liear recurrece with costat coefficiets has the U 0 = a l* U l = a 2 " ' " U r - l = a r ; u = b, u,

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

REVIEW FOR CHAPTER 1

REVIEW FOR CHAPTER 1 REVIEW FOR CHAPTER 1 A short summary: I this chapter you helped develop some basic coutig priciples. I particular, the uses of ordered pairs (The Product Priciple), fuctios, ad set partitios (The Sum Priciple)

More information

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES Publ. Math. Debrece 8504, o. 3-4, 85 95. ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES QING-HU HOU*, ZHI-WEI SUN** AND HAOMIN WEN Abstract. We cofirm Su s cojecture that F / F 4 is strictly decreasig

More information

6.003: Signals and Systems. Feedback, Poles, and Fundamental Modes

6.003: Signals and Systems. Feedback, Poles, and Fundamental Modes 6.003: Sigals ad Systems Feedback, Poles, ad Fudametal Modes February 9, 2010 Last Time: Multiple Represetatios of DT Systems Verbal descriptios: preserve the ratioale. To reduce the umber of bits eeded

More information

Combinatorially Thinking

Combinatorially Thinking Combiatorially Thiig SIMUW 2008: July 4 25 Jeifer J Qui jjqui@uwashigtoedu Philosophy We wat to costruct our mathematical uderstadig To this ed, our goal is to situate our problems i cocrete coutig cotexts

More information

Math 172 Spring 2010 Haiman Notes on ordinary generating functions

Math 172 Spring 2010 Haiman Notes on ordinary generating functions Math 72 Sprig 200 Haima Notes o ordiary geeratig fuctios How do we cout with geeratig fuctios? May eumeratio problems which are ot so easy to hadle by elemetary meas ca be solved usig geeratig fuctios

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

PROBLEMS ON ABSTRACT ALGEBRA

PROBLEMS ON ABSTRACT ALGEBRA PROBLEMS ON ABSTRACT ALGEBRA 1 (Putam 197 A). Let S be a set ad let be a biary operatio o S satisfyig the laws x (x y) = y for all x, y i S, (y x) x = y for all x, y i S. Show that is commutative but ot

More information

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio

More information

Lecture 1: Generating Functions

Lecture 1: Generating Functions Advaced Topics i Combiatorics Summer 08 Lecturer: Kavish Gadhi Lecture : Geeratig Fuctios Itroductio The geeratig fuctio is a very powerful tool i combiatorics, ad is the first oe we will be itroducig

More information

Algebraic Geometry I

Algebraic Geometry I 6.859/15.083 Iteger Programmig ad Combiatorial Optimizatio Fall 2009 Lecture 14: Algebraic Geometry I Today... 0/1-iteger programmig ad systems of polyomial equatios The divisio algorithm for polyomials

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

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

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

CHAPTER 1 SEQUENCES AND INFINITE SERIES

CHAPTER 1 SEQUENCES AND INFINITE SERIES CHAPTER SEQUENCES AND INFINITE SERIES SEQUENCES AND INFINITE SERIES (0 meetigs) Sequeces ad limit of a sequece Mootoic ad bouded sequece Ifiite series of costat terms Ifiite series of positive terms Alteratig

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

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

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

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet

More information

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION J Korea Math Soc 44 (2007), No 2, pp 487 498 GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION Gi-Sag Cheo ad Moawwad E A El-Miawy Reprited from the Joural of the Korea Mathematical

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

Math 104: Homework 2 solutions

Math 104: Homework 2 solutions Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does

More information

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT5821 Advaced Combiatorics 3 Formal power series Geeratig fuctios are the most powerful tool available to combiatorial eumerators. This week we are goig to look at some of the thigs they ca do. 3.1 Commutative

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

V. Adamchik 1. Recursions. Victor Adamchik Fall of x n1. x n 2. Here are a few first values of the above sequence (coded in Mathematica)

V. Adamchik 1. Recursions. Victor Adamchik Fall of x n1. x n 2. Here are a few first values of the above sequence (coded in Mathematica) V. Adamchik Recursios Victor Adamchik Fall of 2005 Pla. Covergece of sequeces 2. Fractals 3. Coutig biary trees Covergece of Sequeces I the previous lecture we cosidered a cotiued fractio for 2 : 2 This

More information

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

Mathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis Mathematics review for CSCI 303 Sprig 019 Departmet of Computer Sciece College of William & Mary Robert Michael Lewis Copyright 018 019 Robert Michael Lewis Versio geerated: 13 : 00 Jauary 17, 019 Cotets

More information

2.4 - Sequences and Series

2.4 - Sequences and Series 2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,

More information

Definition An infinite sequence of numbers is an ordered set of real numbers.

Definition An infinite sequence of numbers is an ordered set of real numbers. Ifiite sequeces (Sect. 0. Today s Lecture: Review: Ifiite sequeces. The Cotiuous Fuctio Theorem for sequeces. Usig L Hôpital s rule o sequeces. Table of useful its. Bouded ad mootoic sequeces. Previous

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

Chapter 6. Advanced Counting Techniques

Chapter 6. Advanced Counting Techniques Chapter 6 Advaced Coutig Techiques 6.: Recurrece Relatios Defiitio: A recurrece relatio for the sequece {a } is a equatio expressig a i terms of oe or more of the previous terms of the sequece: a,a2,a3,,a

More information

GENERATING FUNCTIONS AND RANDOM WALKS

GENERATING FUNCTIONS AND RANDOM WALKS GENERATING FUNCTIONS AND RANDOM WALKS SIMON RUBINSTEIN-SALZEDO 1 A illustrative example Before we start studyig geeratig fuctios properly, let us look a example of their use Cosider the umbers a, defied

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

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

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

The r-generalized Fibonacci Numbers and Polynomial Coefficients

The r-generalized Fibonacci Numbers and Polynomial Coefficients It. J. Cotemp. Math. Scieces, Vol. 3, 2008, o. 24, 1157-1163 The r-geeralized Fiboacci Numbers ad Polyomial Coefficiets Matthias Schork Camillo-Sitte-Weg 25 60488 Frakfurt, Germay mschork@member.ams.org,

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

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

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

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

September 2012 C1 Note. C1 Notes (Edexcel) Copyright   - For AS, A2 notes and IGCSE / GCSE worksheets 1 September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

LECTURE NOTES, 11/10/04

LECTURE NOTES, 11/10/04 18.700 LECTURE NOTES, 11/10/04 Cotets 1. Direct sum decompositios 1 2. Geeralized eigespaces 3 3. The Chiese remaider theorem 5 4. Liear idepedece of geeralized eigespaces 8 1. Direct sum decompositios

More information

Chapter 7: The z-transform. Chih-Wei Liu

Chapter 7: The z-transform. Chih-Wei Liu Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability

More information

Infinite Series. Definition. An infinite series is an expression of the form. Where the numbers u k are called the terms of the series.

Infinite Series. Definition. An infinite series is an expression of the form. Where the numbers u k are called the terms of the series. Ifiite Series Defiitio. A ifiite series is a expressio of the form uk = u + u + u + + u + () 2 3 k Where the umbers u k are called the terms of the series. Such a expressio is meat to be the result of

More information

Singular Continuous Measures by Michael Pejic 5/14/10

Singular Continuous Measures by Michael Pejic 5/14/10 Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable

More information

arxiv: v1 [math.co] 23 Mar 2016

arxiv: v1 [math.co] 23 Mar 2016 The umber of direct-sum decompositios of a fiite vector space arxiv:603.0769v [math.co] 23 Mar 206 David Ellerma Uiversity of Califoria at Riverside August 3, 208 Abstract The theory of q-aalogs develops

More information

Lecture 7: Properties of Random Samples

Lecture 7: Properties of Random Samples Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ

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

A Study on Some Integer Sequences

A Study on Some Integer Sequences It. J. Cotemp. Math. Scieces, Vol. 3, 008, o. 3, 03-09 A Study o Some Iteger Sequeces Serpil Halıcı Sakarya Uiversity, Departmet of Mathematics Esetepe Campus, Sakarya, Turkey shalici@sakarya.edu.tr Abstract.

More information

arxiv: v1 [math.fa] 3 Apr 2016

arxiv: v1 [math.fa] 3 Apr 2016 Aticommutator Norm Formula for Proectio Operators arxiv:164.699v1 math.fa] 3 Apr 16 Sam Walters Uiversity of Norther British Columbia ABSTRACT. We prove that for ay two proectio operators f, g o Hilbert

More information

arxiv: v1 [math.co] 3 Feb 2013

arxiv: v1 [math.co] 3 Feb 2013 Cotiued Fractios of Quadratic Numbers L ubomíra Balková Araka Hrušková arxiv:0.05v [math.co] Feb 0 February 5 0 Abstract I this paper we will first summarize kow results cocerig cotiued fractios. The we

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 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

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

1 Counting and Stirling Numbers

1 Counting and Stirling Numbers 1 Coutig ad Stirlig Numbers Natural Numbers: We let N {0, 1, 2,...} deote the set of atural umbers. []: For N we let [] {1, 2,..., }. Sym: For a set X we let Sym(X) deote the set of bijectios from X to

More information

Solutions to Homework 1

Solutions to Homework 1 Solutios to Homework MATH 36. Describe geometrically the sets of poits z i the complex plae defied by the followig relatios /z = z () Re(az + b) >, where a, b (2) Im(z) = c, with c (3) () = = z z = z 2.

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

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0. 40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig

More information

Lecture 4: Grassmannians, Finite and Affine Morphisms

Lecture 4: Grassmannians, Finite and Affine Morphisms 18.725 Algebraic Geometry I Lecture 4 Lecture 4: Grassmaias, Fiite ad Affie Morphisms Remarks o last time 1. Last time, we proved the Noether ormalizatio lemma: If A is a fiitely geerated k-algebra, the,

More information

Worksheet on Generating Functions

Worksheet on Generating Functions Worksheet o Geeratig Fuctios October 26, 205 This worksheet is adapted from otes/exercises by Nat Thiem. Derivatives of Geeratig Fuctios. If the sequece a 0, a, a 2,... has ordiary geeratig fuctio A(x,

More information

q-lucas polynomials and associated Rogers-Ramanujan type identities

q-lucas polynomials and associated Rogers-Ramanujan type identities -Lucas polyomials associated Rogers-Ramauja type idetities Joha Cigler Faultät für Mathemati, Uiversität Wie johacigler@uivieacat Abstract We prove some properties of aalogues of the Fiboacci Lucas polyomials,

More information

Math 312 Lecture Notes One Dimensional Maps

Math 312 Lecture Notes One Dimensional Maps Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,

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

Fibonacci polynomials, generalized Stirling numbers, and Bernoulli, Genocchi and tangent numbers

Fibonacci polynomials, generalized Stirling numbers, and Bernoulli, Genocchi and tangent numbers Fiboacci polyomials, geeralied Stirlig umbers, ad Beroulli, Geocchi ad taget umbers Joha Cigler oha.cigler@uivie.ac.at Abstract We study matrices hich trasform the sequece of Fiboacci or Lucas polyomials

More information

Math 299 Supplement: Real Analysis Nov 2013

Math 299 Supplement: Real Analysis Nov 2013 Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality

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

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S. Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the

More information

Curve Sketching Handout #5 Topic Interpretation Rational Functions

Curve Sketching Handout #5 Topic Interpretation Rational Functions Curve Sketchig Hadout #5 Topic Iterpretatio Ratioal Fuctios A ratioal fuctio is a fuctio f that is a quotiet of two polyomials. I other words, p ( ) ( ) f is a ratioal fuctio if p ( ) ad q ( ) are polyomials

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information