THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

Size: px
Start display at page:

Download "THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS"

Transcription

1 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 matrix usig at most 2 row operatios ad i geeral that may operatios might be eeded. I [1] the authors cosidered matrices i GL(, q), the set of ivertible matrices i the fiite field of q elemets, ad provided a algorithm usig oly row operatios which performs asymptotically better tha the Gauss-Jorda elimiatio. More specifically their striped elimiatio algorithm has asymptotic complexity 2 log q. Furthermore they proved that up to a costat factor this algorithm is best possible as almost all matrices i GL(, q) eed asymptotically at least 2 2 log q operatios. I this short ote we show that the striped elimiatio algorithm is asymptotically optimal by provig that almost all matrices i GL(, q) eed asymptotically at least 2 log q operatios. 1. Itroductio Let A be a matrix with etries i some field. Our aim is to compute the iverse of A. The well-kow Gaussia elimiatio does this i O( 3 ) steps. There are eve faster algorithms tha this. For example, Strasse s [3] fast matrix multiplicatio computes the product of two matrices i O( log 2 7 ) steps ad this ca be used (see e.g. [2]) to compute the iverse of a matrix i O( log 2 7 ) steps as well. I [1] the authors cosidered the complexity of matrix iversio from a differet poit of view. More specifically they cosidered methods based oly o row operatios ad measured the complexity of matrix iversio based o the umber of such operatios eeded. The ratioale for this approach was that row operatios ca be implemeted o existig processors far more efficietly tha straight lie programs. With this approach it is Date: May 20, Mathematics Subject Classificatio. 05A16, 15A09. Key words ad phrases. Matrix Reductio, Complexity, Fiite Fields. Demetres Christofides, School of Scieces, UCLa Cyprus, 7080 Pyla, Laraka, Cyprus, dchristofides@ucla.ac.uk. This work was doe durig a visit to the Istitut Mittag-Leffler (Djursholm, Swede). 1

2 2 DEMETRES CHRISTOFIDES also the case that the problem becomes more combiatorial i ature as it is equivalet with determiig the diameter of a specific Cayley graph. Recall that if we apply some row operatios to a matrix A i order to reduce it to the idetity matrix, the applyig the same row operatios to the idetity matrix produces the iverse of A. Sice our measure of complexity here is the umber of row operatios performed, the problems of ivertig a matrix ad of reducig it to the idetity matrix have the same complexity. Therefore from ow o we will be thikig i terms of ivertig a ivertible matrix or reducig it to the idetity iterchageably. The Gauss-Jorda algorithm ca reduce a ivertible matrix to the idetity i at most 2 row operatios (oe operatio per matrix elemet). It is easy to see that we caot expect to improve this i geeral sice if we have a matrix over the reals ad we take all elemets of the matrix to be algebraically idepedet, the we really do eed at least 2 row operatios. I [1] the authors showed that if we restrict the elemets of the matrix to lie i a fiite field the oe ca improve o the Gauss-Jorda algorithm sigificatly. Let GL(, q) deote the set of all ivertible matrices with etries i the field of q elemets. The striped elimiatio algorithm of [1] reduces a matrix i GL(, q) to the idetity i asymptotically at most 2 log q row operatios. Furthermore, it is also show that this algorithm is optimal i the sese that for almost every matrix i GL(, q) we eed asymptotically at least 2 row operatios i order to reduce it to the 2 log q idetity. Our aim i this short ote is to show that the striped elimiatio algorithm is optimal i a much stroger sese: Almost every matrix i GL(, q) row operatios i order to be reduced eeds asymptotically at least 2 log q to the idetity. More specifically, we show that followig result: Theorem 1.1. Let be a positive iteger, q a prime power, ad 0 < α < 1. The usig at most 2 2 log q log q 2 1 q 1 log q e log q 1 a log q + log q 8qe row operatios, we caot reduce more tha a α proportio of all matrices i GL(, q) to the idetity matrix. We have decided to write the boud i Theorem 1 i a explicit rather tha a asymptotic format. We have ot tried to optimise the lower order terms i the statemets eve though some of them could clearly be improved at the expese of more calculatios. I ay case sice the striped elimiatio algorithm of [1] rus i a little bit more tha 2 / log q steps, we have o hope to match the secod order asymptotics of the algorithm usig our approach.

3 THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS3 I Sectio 2 we recall some elemetary liear algebra facts. These are very basic facts appearig i almost every udergraduate liear algebra module. We the show that ay product of elemetary matrices ca be writte as a product of elemetary matrices i a caoical way. We will use these caoical products i Sectio 3 i order to prove Theorem. 2. Caoical products of elemetary matrices Let A be a ivertible matrix with etries i some field F. We are allowed to perform the followig row operatios: (1) For 1 i, j with i j, iterchage the i-th row of A with its j-th row. (2) For 1 i ad λ F with λ 0, multiply all elemets of the i-th row by λ. (3) For 1 i, j with i j ad λ F with λ 0, add λ times the i-th row to the j-th row The result of each row operatio o a matrix A, is exactly the same as the multiplicatio of A from the left by a elemetary row matrix. We deote these matrices by E ij, E i (λ) ad E ij (λ) correspodig to the operatios (1), (2) ad (3) respectively. We perform these operatios oe by oe util we reduce A to the idetity matrix. A crucial fact that will eable us to improve o the lower boud of [1] is that eve though the elemetary matrices do ot i geeral commute, i may istaces they do commute pairwise. The ovelty of our argumet is ot this trivial observatio per se, but how to make a good use of it. I fact we will ot make full use of the commutativity, but oly of the fact that if a set of row operatios affect pairwise differet rows, the these operatios pairwise commute. So for example, eve thought E ij (λ) ad E ik (µ) do commute, we will ot use this fact. The other crucial fact is that eve though two elemetary matrices E, E might ot commute we ca sometimes fid aother elemetary matrix E such that E E = EE. We will use the followig istaces of this observatio: E ij (µ)e i (λ) = E i (λ)e ij (λµ) (1) E ji (µ)e i (λ) = E i (λ)e ji (µ/λ) (2) E kl (λ)e ij = E ij E πij (k)π ij (l)(λ) (3) E k (λ)e ij = E ij E πij (k)(λ) (4) where i (3) ad (4), π ij is the traspositio iterchagig i ad j. All of these equalities follow trivially if we cosider the effects of those elemetary matrices o aother matrix B.

4 4 DEMETRES CHRISTOFIDES Suppose ow that we have a product of k elemetary matrices. Usig the above facts ad observatios, we will rewrite this ito a ew product of at most k elemetary matrices as follows: Usig (3),(4) ad commutativity where ecessary we ca move all appearaces of elemetary matrices of the form E ij to the left. Now we look at the product of the remaiig matrices ad usig (1),(2) ad commutativity we ca move all appearaces of elemetary matrices of the form E i (λ) to the left. We ca also assume by commutativity that for i < j, every appearace of E i (λ) is to the left of every appearace of E j (µ). Furthermore for each i, all appearaces of E i (λ) for λ R ow appear cosecutively i the product ad we ca replace them with their product which is agai a elemetary matrix of that form. Now we look at the product of the remaiig matrices which are all of the form E ij (λ). Give a elemetary matrix of the form E ij (λ), we will call the set {i, j} its idex set. We begi by partitioig these matrices ito blocks as follows: We start from the left by puttig each matrix ito the first block oe by oe for as log as their idex sets are disjoit. Oce we reach a matrix whose idex set meets the idex set of a matrix i the first block, the we put this ito the secod block. We ow repeat by puttig matrices ito the secod block, the create a ew block as we reach a matrix whose idex set meets the idex set of a matrix i the secod block ad so o. Observe that the matrices i each block commute ad so we ca if we wish permute the matrices i the same block at will without chagig their product. We ow do the followig modificatios: Iitially we do o modificatio i the first block. We the look at the first (from the left) matrix of the secod block, if it exists, whose idex set does ot meet the idex set of ay matrix of the first block. If o such matrix exists the we do o modificatio to the secod block either. Otherwise we move this matrix from the secod block to the first, say to the last positio of the first block. By repeatig this for as log as it is ecessary, we will ed up with the situatio tha every matrix of the secod block meets every matrix of the first block. We ow move o to the third block ad i the same way move matrices back to the secod block for as log as they do ot meet the idex sets of matrices of the secod block. Each time we move a matrix oto the secod block we also check to see whether its idex set meets a idex set of a matrix of the first block. If it does ot the we move it ito the first block. By repeatig this procedure we will ed up with the situatio that we will have several blocks of matrices, such that withi each block the idex set of matrices are disjoit while for every matrix from the secod block owards its idex set will meeet the idex set of at least oe matrix from the previous block. This procedure is guarateed to fiish i a fiite umber of steps. For example, givig to each matrix as value the umber

5 THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS5 of the block i which it appears, the the sum of the values of the matrices reduces after each step of the procedure. Furthermore this umber is a o-egative iteger ad so the procedure caot go o forever. We have ow fiished i rewritig the iitial product of elemetary matrices as a ew product with some specific properties. We call ay such product a caoical product of elemetary matrices. More specifically, we say that a product E 1 E 2 E k of elemetary matrices matrices is caoical if there exist o-egative itegers r, r 0, r 1,..., r s such that (a) Each E 1,..., E r is equal to E ij for some i, j. (b) Each E r+1,..., E r+r0 is equal to E i (λ) for some i, λ. Furthermore, if E t = E i (λ) ad E t = E i (λ ) where r + 1 t < t r + r 0 the i < i. (c) Each E k with k > r + r 0 is equal to E ij (λ) for some i, j, λ. Furthermore, if we write I k = {i, j} for the idex set of this elemetary matrix ad defie r i = r + r 0 + r r i for each 0 i s the the followig holds: (i) For each 1 i s, we have that the idex sets I r i 1 +1,..., I r i are pairwise disjoit. (i) For each 2 i s, ad each t [r i 1 + 1, r i] there is a t [r i 2 + 1, r i 1] with I t I t. 3. Proof of Theorem 1 Suppose that every matrix i GL(, q) ca be reduced to the idetity matrix usig at most k row-operatios. From our results i Sectio 2, it follows that every such matrix ca be writte as a caoical product of at most k elemetary matrices. This caoical product starts with a product of matrices of the form E ij. Their product is a permutatio matrix, so there are at most! = q log q differet product that ca be obtaied so far. The caoical product cotiues with a product of matrices of the form E i (λ). There are 2 ways to choose which idices i appear i the matrices of this product. For each such matrix, there is a total of q 1 ways to choose λ. So i total the product of those matrices ca be formed i at most 2 (q 1) q log q 2+ ways. Fially, there are at most k more matrices to cosider, all of the form E ij (λ). These matrices will appear ito blocks of r 1, r 2,..., r s matrices for some o-egative iteger s ad some positive itegers r 1,..., r s with r r s k. Withi each block the idex sets of the matrices used are

6 6 DEMETRES CHRISTOFIDES all disjoit, while the idex set of every matrix of a block meets the idex set of at least oe matrix of the previous block. There are exactly 2 k ways i order to choose the umbers r 1,..., r s. To see this observe that give positive itegers r 1,..., r s such that r r s k, these determie the subset {r 1, r 1 + r 2,..., r r s } of {1, 2,..., k}. Coversely, give ay subset {x 1,..., x s } of {1, 2,..., k} with x 1 < x 2 < < x s the r 1 = x 1, r 2 = x 2 x 1,..., r s = x s x s 1 are positive itegers with r r s k. Furthermore these two maps betwee tuples of positive itegers summig up to at most k, ad subsets of {1, 2,..., k} are iverses of each other ad so ideed the umber of ways to choose r 1,..., r s is equal to 2 k = q k log q 2. Suppose ow that r 1,..., r s have bee chose. There are at most q r 1 2r 1 ways to choose the first r 1 matrices. Here the q r 1 is for the choose of λ s ad the 2r 1 for the choice of idices. Havig chose those, there are at most q r 2 (4r 1 ) r 2 ways to choose the secod r matrices. This is because whe choosig each of the r 2 matrices of this block, there are 2 ways to choose which elemet of its idex set will meet the idex set of a matrix from the previous block, there are at most 2r 1 ways to choose that elemet, ad there are at most ways to choose the other elemet. Similarly, there are q r 3 (4r 2 ) r 3 ways to choose the matrices of the third block ad so o. So i total for fixed r 1, r 2,..., r s there are q r 1 2r 1 (4qr 1 ) r2 (4qr s 1 ) rs 2r 1+r 2 +r s (4q) r 1+ +r s r r 2 1 r rs s 1r r 1 s +k (4q) k r r 2 1 r rs s 1r r 1 s = q log q +k log q +2k log q 2+k r r 2 1 r rs s 1r r 1 s. ways to form this product. However may of those products give rise to the same matrix. I particular, the order i which we pick the matrices of the first block does ot matter as it will give up the same product. The same holds for the order of the matrices withi each block. So for each r 1,..., r s, each possible product has bee appeared i the above calculatio at least r 1! r s! times. We ow observe that r 1! r s! ( ) r 1e r1 ( r se ) rs r r 1 1 rs rs. e k Sice the fuctio x log q x is a icreasig fuctio of x, the rearragemet iequality shows that ad so r 1 log q r 1 r s log q r s r 2 log q r r s log q r s 1 + r 1 log q r s

7 THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS7 r r 1 1 rs rs r r 2 1 rs 1r r 1 So i total, for each r 1,..., r s there are at most q log q +k log q +2k log q 2+k+k log q e differet products that ca be formed. So puttig everythig together, there is a total of at most q (k+2) log q +(3k+) log q 2++k+k log q e (5) distict matrices that ca arise from caoical products of at most k matrices from GL(, q). Fially, it is ot difficult to see that 1 1 GL(, q) = (q q k ) = q 2 (1 q k ) = q (1 2 1q ). r But k=0 (1 1q ) r r=1 ad so there are at least k=0 s. r=1 = e r=1 log(1 q r) e r=1 q r e 1 q 1 e 1 q 1 q 2 = q 2 1 q 1 log q e ivertible matrices with etries i F q. This, together with (5), complete the proof of Theorem 1. Refereces [1] D. Adré, L. Hellström ad K. Markström, O the complexity of matrix reductio over fiite fields, Adv. i Appl. Math. 39 (2007), [2] J. R. Buch ad J. E. Hopcroft, Triagular factorizatio ad iversio by fast matrix multiplicatio, Math. Comp. 28 (1974), [3] V. Strasse, Gaussia elimiatio is ot optimal, Numer. Math. 13 (1969),

Matrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc.

Matrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc. 2 Matrix Algebra 2.2 THE INVERSE OF A MATRIX MATRIX OPERATIONS A matrix A is said to be ivertible if there is a matrix C such that CA = I ad AC = I where, the idetity matrix. I = I I this case, C is a

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

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

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Inverse Matrix. A meaning that matrix B is an inverse of matrix A. Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix

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

(I.C) Matrix algebra

(I.C) Matrix algebra (IC) Matrix algebra Before formalizig Gauss-Jorda i terms of a fixed procedure for row-reducig A, we briefly review some properties of matrix multiplicatio Let m{ [A ij ], { [B jk ] p, p{ [C kl ] q be

More information

MATH10212 Linear Algebra B Proof Problems

MATH10212 Linear Algebra B Proof Problems MATH22 Liear Algebra Proof Problems 5 Jue 26 Each problem requests a proof of a simple statemet Problems placed lower i the list may use the results of previous oes Matrices ermiats If a b R the matrix

More information

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row: Math 50-004 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig

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

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

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e. Theorem: Let A be a square matrix The A has a iverse matrix if ad oly if its reduced row echelo form is the idetity I this case the algorithm illustrated o the previous page will always yield the iverse

More information

Lecture 23 Rearrangement Inequality

Lecture 23 Rearrangement Inequality Lecture 23 Rearragemet Iequality Holde Lee 6/4/ The Iequalities We start with a example Suppose there are four boxes cotaiig $0, $20, $50 ad $00 bills, respectively You may take 2 bills from oe box, 3

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

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

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

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 for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a Math E-2b Lecture #8 Notes This week is all about determiats. We ll discuss how to defie them, how to calculate them, lear the allimportat property kow as multiliearity, ad show that a square matrix A

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

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

1 Last time: similar and diagonalizable matrices

1 Last time: similar and diagonalizable matrices Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero

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

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

Stochastic Matrices in a Finite Field

Stochastic Matrices in a Finite Field Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices

More information

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

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

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

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1) 5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper

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

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

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

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ. 2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For

More information

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc. 2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES 2012 Pearso Educatio, Ic. Theorem 8: Let A be a square matrix. The the followig statemets are equivalet. That is, for a give A, the statemets

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

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

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

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

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 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass

More information

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients. Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,

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

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

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a Math S-b Lecture # Notes This wee is all about determiats We ll discuss how to defie them, how to calculate them, lear the allimportat property ow as multiliearity, ad show that a square matrix A is ivertible

More information

Review Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =

Review Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = = Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:

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

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

7. Modern Techniques. Data Encryption Standard (DES)

7. Modern Techniques. Data Encryption Standard (DES) 7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio

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

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

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

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row: Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,

More information

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >

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

Math 609/597: Cryptography 1

Math 609/597: Cryptography 1 Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit

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

Introductory Analysis I Fall 2014 Homework #7 Solutions

Introductory Analysis I Fall 2014 Homework #7 Solutions Itroductory Aalysis I Fall 214 Homework #7 Solutios Note: There were a couple of typos/omissios i the formulatio of this homework. Some of them were, I believe, quite obvious. The fact that the statemet

More information

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors 5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields

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

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

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

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

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

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

A Proof of Birkhoff s Ergodic Theorem

A Proof of Birkhoff s Ergodic Theorem A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

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

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

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

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

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

Lecture 12: November 13, 2018

Lecture 12: November 13, 2018 Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,

More information

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1. Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6

More information

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

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

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

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum

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

Exercises 1 Sets and functions

Exercises 1 Sets and functions Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,

More information

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of

More information

The inverse eigenvalue problem for symmetric doubly stochastic matrices

The inverse eigenvalue problem for symmetric doubly stochastic matrices Liear Algebra ad its Applicatios 379 (004) 77 83 www.elsevier.com/locate/laa The iverse eigevalue problem for symmetric doubly stochastic matrices Suk-Geu Hwag a,,, Sug-Soo Pyo b, a Departmet of Mathematics

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

Sequences I. Chapter Introduction

Sequences I. Chapter Introduction Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which

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

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

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

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

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x

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

The Growth of Functions. Theoretical Supplement

The Growth of Functions. Theoretical Supplement The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that

More information

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

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

A Note on the Symmetric Powers of the Standard Representation of S n

A Note on the Symmetric Powers of the Standard Representation of S n A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,

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

HOMEWORK 2 SOLUTIONS

HOMEWORK 2 SOLUTIONS HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k

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

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

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

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