MT5821 Advanced Combinatorics

Similar documents
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

A probabilistic proof of a binomial identity

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

CS103X: Discrete Structures Homework 4 Solutions

Factors of sums of powers of binomial coefficients

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Sequences and Series

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

Asymptotic Growth of Functions

Lecture 5: Span, linear independence, bases, and dimension

Soving Recurrence Relations

5.3. Generalized Permutations and Combinations

1. MATHEMATICAL INDUCTION

Department of Computer Science, University of Otago

Chapter 5: Inner Product Spaces

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Properties of MLE: consistency, asymptotic normality. Fisher information.

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Infinite Sequences and Series

I. Chi-squared Distributions

Overview of some probability distributions.

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

Convexity, Inequalities, and Norms

Notes on exponential generating functions and structures.

A Recursive Formula for Moments of a Binomial Distribution

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

BINOMIAL EXPANSIONS In this section. Some Examples. Obtaining the Coefficients

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

2 MATH 101B: ALGEBRA II, PART D: REPRESENTATIONS OF GROUPS

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

THE HEIGHT OF q-binary SEARCH TREES

Section 11.3: The Integral Test

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

The Stable Marriage Problem

Normal Distribution.


3. Greatest Common Divisor - Least Common Multiple

Overview on S-Box Design Principles

How To Solve The Homewor Problem Beautifully

Irreducible polynomials with consecutive zero coefficients

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Class Meeting # 16: The Fourier Transform on R n

THE ABRACADABRA PROBLEM

Modified Line Search Method for Global Optimization

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE The absolute value of the complex number z a bi is

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Permutations, the Parity Theorem, and Determinants

Chapter 7 Methods of Finding Estimators

Section 8.3 : De Moivre s Theorem and Applications

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

Math 113 HW #11 Solutions

INFINITE SERIES KEITH CONRAD

S. Tanny MAT 344 Spring be the minimum number of moves required.

Lecture 4: Cheeger s Inequality

Part - I. Mathematics

Lesson 17 Pearson s Correlation Coefficient

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means)

3 Basic Definitions of Probability Theory

Elementary Theory of Russian Roulette

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Your organization has a Class B IP address of Before you implement subnetting, the Network ID and Host ID are divided as follows:

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

Notes on Combinatorics. Peter J. Cameron

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

How To Understand The Theory Of Coectedess

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

Theorems About Power Series

MEI Structured Mathematics. Module Summary Sheets. Statistics 2 (Version B: reference to new book)

Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork

Multiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives

Determining the sample size

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

SEQUENCES AND SERIES

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10

Basic Elements of Arithmetic Sequences and Series

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

1 Correlation and Regression Analysis

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4

Lecture 2: Karger s Min Cut Algorithm

Math 114- Intermediate Algebra Integral Exponents & Fractional Exponents (10 )

Incremental calculation of weighted mean and variance

2-3 The Remainder and Factor Theorems

Lesson 15 ANOVA (analysis of variance)

Analysis Notes (only a draft, and the first one!)

Now here is the important step

1 Computing the Standard Deviation of Sample Means

Case Study. Normal and t Distributions. Density Plot. Normal Distributions

Transcription:

MT581 Advaced Combiatorics 6 Gaussia coefficiets The -aaolgue of a combiatorial formula is, loosely speaig, a formula ivolvig a parameter, which teds to the origial formula as 1 However, this is much too vague to be a defiitio, ad it turs out that there are some very specific -aalogues which crop up i several differet fields Most importat of these are the Gaussia, or -biomial, coefficiets, which we discuss i this chapter Amog other places, they come up i the followig areas: Combiatorics of vector spaces over fiite fields It turs out that there are close aalogies betwee sets ad subsets, o oe had, ad vector spaces ad subspaces, o the other The coutig formulae replace the biomial coefficiets by their -aalogues Lattice paths We ow that the umber of lattice ( paths ) from (0,0) to (m,) m + (usig oly orthward ad eastward steps) is To cout these paths by the area uder them, we itroduce a ew variable to give a geeratig fuctio, ad the formula becomes the -aalogue of the biomial coefficiet No-commutative geometry I will ot give a detailed accout of this, but ote a couple of occurreces The simplest to describe is the biomial theorem for idetermiates x, y which satisfy yx = xy; the biomial coefficiets i the expasio are replaced by their -aalogues There are several further applicatios of the -biomial coefficiets, amog them uatum calculus ad braided categories I will ot discuss these, but there is a very accessible boo o uatum calculus if you are iterested: V Kac ad P Cheug, Quatum Calculus, Spriger, New Yor, 00 1

61 The defiitio Let ad be o-egative itegers The Gaussia or -biomial coefficiet is defied to be = ( 1)( 1 1) ( +1 1) ( 1)( 1 1) ( 1) I other words, we tae the formula for the biomial coefficiet, ad replace each factor m i either umerator or deomiator by m 1 For example, [ ] 4 = (4 1)( 3 1) ( 1)( 1) = ( + 1)( + + 1), a polyomial of degree 4 i Puttig = 1, we obtai 3 = 6, which is eual 4 to Propositio 61 lim 1 = Proof By L Hôpital s Rule, we have a 1 lim 1 b 1 = lim a a 1 1 b b 1 = a b Now brea the fractioal expressio givig the Gaussia coefficiet ito the product of fractios, of which the ith teds to ( i + 1)/( i + 1) as 1 The result follows 6 Vector spaces over fiite fields The umber of elemets i a fiite field is ecessarily a prime power, ad there is a uiue field (up to isomorphism) of ay give prime power order The field with elemets is deoted by GF(), or sometimes F

From elemetary liear algebra, we ow that a -dimesioal vector space V over GF() has a basis v 1,,v such that every vector v has a uiue expressio as a liear combiatio of basis vectors: v = c 1 v 1 + c v + + c v, c i GF() So, as usual, V ca be idetified with the space GF() of all -tuples of elemets of GF(), with coordiatewise operatios I particular, we see: Propositio 6 If V is a -dimesioal vector space over GF(), the V = Now the coectio with Gaussia coefficiets is the followig: Theorem 63 The umber [ ] of -dimesioal subspaces of a -dimesioal vector space over GF() is Proof We specify a -dimesioal subspace by givig a basis, a liearly idepedet -tuple (v 1,,v ) of vectors i V The umber of choices for v 1 is 1 (ay vector except 0); for v is (ay vector except oe of the multiples of v 1 ); for v 3 is (ay vector except oe of the liear combiatios of v 1 ad v ); ad so o; the total umber of choices is ( 1)( ) ( 1 ) However, we have over-couted, sice a give -dimesioal subspace has may bases How may? The umber is foud from the same formula usig istead of, sice we are worig withi a -dimesioal space So the umber of -dimesioal subspaces is ( 1)( ) ( 1 ) ( 1)( ) ( 1 ) Cacellig powers of, this reduces to the formula for the Gaussia coefficiet This result has aother coutig iterpretatio Recall that a matrix A over a field F is i reduced echelo form if 3

if a row is ot idetically zero, the first o-zero elemet i it is 1; the leadig oes i the o-zero rows occur further to the right as we go dow the matrix; all the other elemets i the colum of a leadig oe are zero Now stadard liear algebra shows that ay matrix ca be put ito reduced echelo form by elemetary row operatios, which do ot chage the row space of the matrix So ay -dimesioal subspace of F has a basis whose vectors are the rows of a matrix i reduced echelo form Moreover, it is easy to see that the reduced echelo basis of a give subspace is uiue So: Propositio 64 The umber of matrices [ ] over GF() which have o zero rows ad are i reduced echelo form is The defiitio of reduced echelo does ot deped o properties of fields; ay alphabet cotaiig distiguished elemets called 0 ad 1 will do So we have a coutig iterpretatio of the Gaussia coefficiets for arbitrary positive itegers > 1 Example For = 4 ad =, the matrices i reduced echelo form are show ca be ay elemet of the field Beside each matrix is the umber of matrices of this form over GF() 1 0 We fid, as before, that 4 0 1 1 0 0 0 1 3 1 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 0 0 1 [ ] 4 = ( + 1)( + + 1) 4

63 Relatios betwee Gaussia coefficiets The -biomial coefficiets satisfy a aalogue of the recurrece relatio for biomial coefficiets [ ] [ ] [ ] [ ] [ ] 1 1 Propositio 65 = = 1, = + for 0 < < 0 1 Proof This comes straight from the defiitio Suppose that 0 < < The [ ] [ ] ( 1 )[ ] 1 1 = 1 1 1 1 ( = )[ ] 1 1 1 1 = 1 The array of Gaussia coefficiets has the same symmetry as that of biomial coefficiets Propositio 66 [ ] [ ] = The proof is a exercise from the formula Note that, i the vector space iterpretatio, we have a differet way to see this Give a -dimesioal vector space V over GF(), it has a dual space V, the space of liear maps from V to GF() Now ay -dimesioal subspace of V has a ( )-dimesioal aihilator i V, ad the correspodece betwee -dimesioal subspaces of V ad ( )-dimesioal subspaces of V is bijective From this we ca deduce aother recurrece relatio [ ] [ ] [ ] [ ] [ ] 1 1 Propositio 67 = = 1, = 0 1 + for 0 < < 5

Proof = = = [ ] [ ] 1 1 + 1 [ ] [ ] 1 1 + 1 We come ow to the -aalogue of the biomial theorem, which states the followig Theorem 68 For a positive iteger, a real umber 1, ad a idetermiate x, we have (1 + i 1 x) = i=1 =0 ( 1)/ x Proof The proof is by iductio o ; startig the iductio at = 1 is trivial Suppose that the result is true for 1 For the iductive step, we must compute ( 1 [ ] ) 1 (1 ( 1)/ x + 1 x ) =0 The coefficiet of x i this expressio is [ ] [ ] 1 1 ( 1)/ + ( 1)( )/+ 1 1 ( [ ] 1 = ( 1)/ ] [ 1 + 1 ] ) = ( 1)/ [ by Propositio 67 6

64 Lattice paths We cosider lattice paths from the origi to the poit (m,), where m ad are o-egative ( itegers, ) ad the allowable steps are east ad orth The umber of m + paths is, sice we have to tae m + steps altogether, of which m must m be easterly ad ortherly For each such path p, there is a certai area A(p) eclosed betwee the path, the X-axis, ad the lie x = m Figure 1 shows the six paths for m = = ad the area eclosed i each case Path Area 0 1 3 4 Figure 1: Lattice paths If we tae a geeratig fuctio i the variable for these areas, that is, a path with area A cotributes A to the sum, we obtai [ ] 4 1 + + + 3 + 4 = 7

This is uite geeral: Theorem 69 Let P be the set of lattice paths from (0,0) to (m,) usig ortherly ad easterly steps oly For p P, let A(p) be the area eclosed by p, the X-axis ad the lie x = m The [ ] m + A(p) = p P Proof Call the left-had side F(m,) It is clear that F(0,) = F(m,0) = 0 Now cosider F(m,) There are two cases: If the last step o the path p is ortherly, the it is a path from (0,0) to (m, 1) followed by a ortherly step, ad the last step does t chage the area If the last step is easterly, the p is a path from (0,0) to (m 1,) followed by a easterly step, which adds to the area m So F(m,) = F(m, 1) + F(m 1,) Now a simple iductio usig Propositio 65 gives the result Exercises 61 Show that the Gaussia coefficiet ( ) is a polyomial i with degree 6 Use the iterpretatio i terms of matrices i reduced echelo form to show the recurrece relatio of Propositio 65 63 Show that the polyomial i the first problem has coefficiets which are symmetric, that is, if ( ) = a i i, the a i = a ( ) i i=0 8

64 A matrix is said to be i echelo form if it satisfies the first two of the three coditios for reduced echelo form Show that, if is a iteger greater tha, the right-had side of the - biomial theorem with x = 1 couts the umber of matrices i echelo form 65 Let x ad y be elemets of a algebra, which satisfy yx = xy Prove that (x + y) = x y =0 66 Let X be the set of 1-dimesioal subspaces of a -dimesioal vector space V over GF(), where 3 For ay -dimesioal subspace W of V, let B(W) be the set of 1-dimesioal subspaces cotaied i W, ad let B be the collectio of all blocs or subsets of X arisig i this way Prove that (X,B) is a (, + 1,( 1)/( 1)) Steier system (This system is ow as the ( 1)- dimesioal projective space over GF()) 9