Limits of Interlacing Eigenvalues in the Tridiagonal β-hermite Matrix Model

Size: px
Start display at page:

Download "Limits of Interlacing Eigenvalues in the Tridiagonal β-hermite Matrix Model"

Transcription

1 Limits of Interlacing Eigenvalues in the Tridiagonal β-hermite Matrix Model Gopal K. Goel and Mentor Andrew Ahn PRIMES Conference 2017 Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

2 Matrices Recall that an m n matrix with entries in R (or C) is an array of numbers with m rows and n columns. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

3 Matrices Recall that an m n matrix with entries in R (or C) is an array of numbers with m rows and n columns. Examples Here are examples of 3 2 and 4 4 matrices: e 1 π Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

4 Eigenvalues This is how we multiply a vector by a matrix a 11 a 12 a 13 v 1 a 11 v 1 + a 12 v 2 + a 13 v 3 a 21 a 22 a 23 v 2 = a 21 v 1 + a 22 v 2 + a 23 v 3 a 31 a 32 a 33 v 3 a 31 v 1 + a 32 v 2 + a 33 v 3 Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

5 Eigenvalues This is how we multiply a vector by a matrix a 11 a 12 a 13 v 1 a 11 v 1 + a 12 v 2 + a 13 v 3 a 21 a 22 a 23 v 2 = a 21 v 1 + a 22 v 2 + a 23 v 3 a 31 a 32 a 33 v 3 a 31 v 1 + a 32 v 2 + a 33 v 3 Examples ( ) ( ) = ( ) 3 34 Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

6 Eigenvalues We say that λ C is an eigenvalue of a square matrix A if Av = λv for some vector v. It turns out that there are n eigenvalues (up to multiplicity) of an n n matrix A. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

7 Eigenvalues We say that λ C is an eigenvalue of a square matrix A if Av = λv for some vector v. It turns out that there are n eigenvalues (up to multiplicity) of an n n matrix A. Examples = so 3 is an eigenvalue of the original matrix. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

8 Spectral Theorem Examples Here is a symmetric matrix: Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

9 Spectral Theorem Examples Here is a symmetric matrix: If a matrix is symmetric, then all of its eigenvalues are real. Generally, we order the eigenvalues as follows: λ 1 λ 2 λ n. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

10 Random Variables Define a probability density p(x) to be a function such that R p(x)dx = 1. p : R R 0 Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

11 Random Variables A random variable X with values in R and density p(x) is a random number in R which can be sampled such that its frequency (histogram) as the number of samples increase converge to p(x). More precisely, Pr(a X b) = b a p(x)dx. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

12 Example: Gaussian Random Variable A Gaussian Random Variable is one that has ( 1 p(x) = exp 2πσ 2 (x µ)2 2σ 2 Here is a sample of Gaussian random variables with µ = 0 and σ = 1. ). Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

13 Random Vectors Define a joint probability density p(x) to be a function such that R n p(x)dx n = 1. p : R n R 0 A random vector is a vector in R n that takes random values with joint distribution p(x). Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

14 Random Matrices A random matrix is a matrix whose entries are random variables. Note that the entries do not have to be independent. We can now consider the eigenvalues of these matrices, etc. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

15 Random Matrices A random matrix is a matrix whose entries are random variables. Note that the entries do not have to be independent. We can now consider the eigenvalues of these matrices, etc. Examples PRIMES problem set problem M2! Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

16 The Model X n = 1 2 N (0, 2) χ (n 1)β χ (n 1)β N (0, 2) χ (n 2)β χ 2β N (0, 2) χ β χ β N (0, 2) It turns out that the eigenvalues have joint distribution 1 Z n 1 i<j n (λ i λ j ) β n i=1 e λ 2 i 2.. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

17 The Model X n = 1 2 N (0, 2) χ (n 1)β χ (n 1)β N (0, 2) χ (n 2)β χ 2β N (0, 2) χ β χ β N (0, 2) It turns out that the eigenvalues have joint distribution 1 Z n 1 i<j n (λ i λ j ) β n i=1 e λ 2 i 2. Motivation. This joint distribution turns out to have an electrostatic interpretation.. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

18 Interlacing We say that two sequences {x i } n i=1, {y j} n 1 j=1 interlace if x 1 y 1 x 2 x n 1 y n 1 x n. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

19 Interlacing We say that two sequences {x i } n i=1, {y j} n 1 j=1 interlace if x 1 y 1 x 2 x n 1 y n 1 x n. Let A be a symmetric n by n square matrix, and let A be its n 1 by n 1 lower right submatrix. Examples A = A = ( ) Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

20 Interlacing We say that two sequences {x i } n i=1, {y j} n 1 j=1 interlace if x 1 y 1 x 2 x n 1 y n 1 x n. Let A be a symmetric n by n square matrix, and let A be its n 1 by n 1 lower right submatrix. Examples A = A = ( ) The eigenvalues of A and A interlace. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

21 What We Are Doing With the Model Let X n 1 be the lower n 1 by n 1 submatrix of X n. We saw that the eigenvalues of X n and X n 1 interlace: Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

22 What We are Doing With the Model (continued) As n, these diagrams converge to some curve: We are interested in what this limiting shape is. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

23 Method of Traces It turns out that the study of these diagrams is equivalent to considering what happens to trx k n trx k n 1 as n. We can work with the trace combinatorially: where trx k n trx k n 1 = i Bk k X n (i j, i j+1 ) j=1 B k = {(i 1,..., i k ) [n] k : i j i j+1 1 and i j = 1}. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

24 Current Results Main Theorem In the β-hermite case, the diagrams converge to the Logan-Shepp curve: { 2 Ω(x) = π (x arcsin( x 2 ) + 4 x 2 ), x 2 x, x 2 We have also shown that the fluctuations of the diagrams from the curve are gaussian in some sense. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

25 Future Work We also want to look at other random matrix models, such as β-laguerre and β-jacobi. For β-laguerre, we can describe the limiting shape, but we conjecture that the fluctuations of the diagrams from the curve are not gaussian. Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

26 Acknowledgements My mentor, Andrew Ahn Prof. Vadim Gorin for suggesting the problem Prof. Alan Edelman for useful discussions The MIT Math Department The MIT-PRIMES Program Prof. Pavel Etingof Dr. Slava Gerovitch Dr. Tanya Khovanova My Parents for supporting me throughout Gopal K. Goel and Mentor Andrew Ahn About Beamer May 20, / 18

Cylindric Young Tableaux and their Properties

Cylindric Young Tableaux and their Properties Cylindric Young Tableaux and their Properties Eric Neyman (Montgomery Blair High School) Mentor: Darij Grinberg (MIT) Fourth Annual MIT PRIMES Conference May 17, 2014 1 / 17 Introduction Young tableaux

More information

Maximal D-avoiding subsets of Z

Maximal D-avoiding subsets of Z Maximal D-avoiding subsets of Z Nathan Ramesh Mentor: Christian Gaetz PRIMES Conference May 19, 2018 Introduction D is a finite set of positive integers S N called D-avoiding if there do not exist x, y

More information

1 Tridiagonal matrices

1 Tridiagonal matrices Lecture Notes: β-ensembles Bálint Virág Notes with Diane Holcomb 1 Tridiagonal matrices Definition 1. Suppose you have a symmetric matrix A, we can define its spectral measure (at the first coordinate

More information

Counting Points on Curves of the Form y m 1 = c 1x n 1 + c 2x n 2 y m 2

Counting Points on Curves of the Form y m 1 = c 1x n 1 + c 2x n 2 y m 2 Counting Points on Curves of the Form y m 1 = c 1x n 1 + c 2x n 2 y m 2 Matthew Hase-Liu Mentor: Nicholas Triantafillou Sixth Annual Primes Conference 21 May 2016 Curves Definition A plane algebraic curve

More information

Exponential tail inequalities for eigenvalues of random matrices

Exponential tail inequalities for eigenvalues of random matrices Exponential tail inequalities for eigenvalues of random matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify

More information

Representations of Cherednik Algebras

Representations of Cherednik Algebras Representations of Matthew Lipman Mentor: Gus Lonergan Sixth Annual MIT-PRIMES Conference May 21, 2016 One nice set of operators are those d which can be written in terms of differentiation and multiplication

More information

Progress on Parallel Chip-Firing

Progress on Parallel Chip-Firing Progress on Parallel Chip-Firing Ziv Scully MIT PRIMES May 2, 2 Ziv Scully (MIT PRIMES) Progress on Parallel Chip-Firing May 2, 2 / 8 Motivation Simple rules Obvious patterns which are difficult to prove,

More information

Folding, Jamming, and Random Walks

Folding, Jamming, and Random Walks Folding, Jamming, and Random Walks August Chen Mentor: Prof. Jayadev Athreya, University of Washington Seventh Annual MIT Primes Conference May 20, 2017 Motivation and Background Jammed circular billiard

More information

The Hilbert Polynomial of the Irreducible Representation of the Rational Cherednik Algebra of Type A n in Characteristic p n

The Hilbert Polynomial of the Irreducible Representation of the Rational Cherednik Algebra of Type A n in Characteristic p n The Hilbert Polynomial of the Irreducible Representation of the Rational Cherednik Algebra of Type A n in Characteristic p n Merrick Cai Mentor: Daniil Kalinov, MIT Kings Park High School May 19-20, 2018

More information

Ma/CS 6b Class 20: Spectral Graph Theory

Ma/CS 6b Class 20: Spectral Graph Theory Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x

More information

Matrices and Linear Algebra

Matrices and Linear Algebra Contents Quantitative methods for Economics and Business University of Ferrara Academic year 2017-2018 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2

More information

Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1)

Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1) Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1) Travis Schedler Tue, Oct 18, 2011 (version: Tue, Oct 18, 6:00 PM) Goals (2) Solving systems of equations

More information

Relationships Between Planes

Relationships Between Planes Relationships Between Planes Definition: consistent (system of equations) A system of equations is consistent if there exists one (or more than one) solution that satisfies the system. System 1: {, System

More information

3.2 Gaussian Elimination (and triangular matrices)

3.2 Gaussian Elimination (and triangular matrices) (1/19) Solving Linear Systems 3.2 Gaussian Elimination (and triangular matrices) MA385/MA530 Numerical Analysis 1 November 2018 Gaussian Elimination (2/19) Gaussian Elimination is an exact method for solving

More information

[POLS 8500] Review of Linear Algebra, Probability and Information Theory

[POLS 8500] Review of Linear Algebra, Probability and Information Theory [POLS 8500] Review of Linear Algebra, Probability and Information Theory Professor Jason Anastasopoulos ljanastas@uga.edu January 12, 2017 For today... Basic linear algebra. Basic probability. Programming

More information

Tiling-Harmonic Functions

Tiling-Harmonic Functions Tiling-Harmonic Functions Jacob Klegar mentored by Prof. Sergiy Merenkov, CCNY-CUNY Fifth Annual PRIMES Conference May 16, 2015 Background We are studying functions on the vertices of square tilings. A

More information

1 Last time: least-squares problems

1 Last time: least-squares problems MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that

More information

Matrices: 2.1 Operations with Matrices

Matrices: 2.1 Operations with Matrices Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,

More information

Chapter 5. Eigenvalues and Eigenvectors

Chapter 5. Eigenvalues and Eigenvectors Chapter 5 Eigenvalues and Eigenvectors Section 5. Eigenvectors and Eigenvalues Motivation: Difference equations A Biology Question How to predict a population of rabbits with given dynamics:. half of the

More information

Math 3191 Applied Linear Algebra

Math 3191 Applied Linear Algebra Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful

More information

1 Last time: linear systems and row operations

1 Last time: linear systems and row operations 1 Last time: linear systems and row operations Here s what we did last time: a system of linear equations or linear system is a list of equations a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22

More information

Degrees of Regularity of Colorings of the Integers

Degrees of Regularity of Colorings of the Integers Degrees of Regularity of Colorings of the Integers Alan Zhou MIT PRIMES May 19, 2012 Alan Zhou (MIT PRIMES) Degree of Regularity May 19, 2012 1 / 15 Background Original problem: For a given homogeneous

More information

Ma/CS 6b Class 20: Spectral Graph Theory

Ma/CS 6b Class 20: Spectral Graph Theory Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an

More information

Linear Algebra Practice Problems

Linear Algebra Practice Problems Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a

More information

Sections 6.1 and 6.2: Systems of Linear Equations

Sections 6.1 and 6.2: Systems of Linear Equations What is a linear equation? Sections 6.1 and 6.2: Systems of Linear Equations We are now going to discuss solving systems of two or more linear equations with two variables. Recall that solving an equation

More information

Orthogonal Polynomial Ensembles

Orthogonal Polynomial Ensembles Chater 11 Orthogonal Polynomial Ensembles 11.1 Orthogonal Polynomials of Scalar rgument Let wx) be a weight function on a real interval, or the unit circle, or generally on some curve in the comlex lane.

More information

Markov operators, classical orthogonal polynomial ensembles, and random matrices

Markov operators, classical orthogonal polynomial ensembles, and random matrices Markov operators, classical orthogonal polynomial ensembles, and random matrices M. Ledoux, Institut de Mathématiques de Toulouse, France 5ecm Amsterdam, July 2008 recent study of random matrix and random

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing

More information

ORTHOGONAL POLYNOMIALS

ORTHOGONAL POLYNOMIALS ORTHOGONAL POLYNOMIALS 1. PRELUDE: THE VAN DER MONDE DETERMINANT The link between random matrix theory and the classical theory of orthogonal polynomials is van der Monde s determinant: 1 1 1 (1) n :=

More information

RANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS

RANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS RANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS David García-García May 13, 2016 Faculdade de Ciências da Universidade de Lisboa OVERVIEW Random Matrix Theory Introduction Matrix ensembles A sample computation:

More information

Matrix Arithmetic. a 11 a. A + B = + a m1 a mn. + b. a 11 + b 11 a 1n + b 1n = a m1. b m1 b mn. and scalar multiplication for matrices via.

Matrix Arithmetic. a 11 a. A + B = + a m1 a mn. + b. a 11 + b 11 a 1n + b 1n = a m1. b m1 b mn. and scalar multiplication for matrices via. Matrix Arithmetic There is an arithmetic for matrices that can be viewed as extending the arithmetic we have developed for vectors to the more general setting of rectangular arrays: if A and B are m n

More information

632 CHAP. 11 EIGENVALUES AND EIGENVECTORS. QR Method

632 CHAP. 11 EIGENVALUES AND EIGENVECTORS. QR Method 632 CHAP 11 EIGENVALUES AND EIGENVECTORS QR Method Suppose that A is a real symmetric matrix In the preceding section we saw how Householder s method is used to construct a similar tridiagonal matrix The

More information

Numerical Analysis: Solutions of System of. Linear Equation. Natasha S. Sharma, PhD

Numerical Analysis: Solutions of System of. Linear Equation. Natasha S. Sharma, PhD Mathematical Question we are interested in answering numerically How to solve the following linear system for x Ax = b? where A is an n n invertible matrix and b is vector of length n. Notation: x denote

More information

Distribution of Eigenvalues of Weighted, Structured Matrix Ensembles

Distribution of Eigenvalues of Weighted, Structured Matrix Ensembles Distribution of Eigenvalues of Weighted, Structured Matrix Ensembles Olivia Beckwith 1, Steven J. Miller 2, and Karen Shen 3 1 Harvey Mudd College 2 Williams College 3 Stanford University Joint Meetings

More information

Math 1314 Week #14 Notes

Math 1314 Week #14 Notes Math 3 Week # Notes Section 5.: A system of equations consists of two or more equations. A solution to a system of equations is a point that satisfies all the equations in the system. In this chapter,

More information

1 Data Arrays and Decompositions

1 Data Arrays and Decompositions 1 Data Arrays and Decompositions 1.1 Variance Matrices and Eigenstructure Consider a p p positive definite and symmetric matrix V - a model parameter or a sample variance matrix. The eigenstructure is

More information

Limitations in Approximating RIP

Limitations in Approximating RIP Alok Puranik Mentor: Adrian Vladu Fifth Annual PRIMES Conference, 2015 Outline 1 Background The Problem Motivation Construction Certification 2 Planted model Planting eigenvalues Analysis Distinguishing

More information

9.1 - Systems of Linear Equations: Two Variables

9.1 - Systems of Linear Equations: Two Variables 9.1 - Systems of Linear Equations: Two Variables Recall that a system of equations consists of two or more equations each with two or more variables. A solution to a system in two variables is an ordered

More information

Section 1.1: Systems of Linear Equations

Section 1.1: Systems of Linear Equations Section 1.1: Systems of Linear Equations Two Linear Equations in Two Unknowns Recall that the equation of a line in 2D can be written in standard form: a 1 x 1 + a 2 x 2 = b. Definition. A 2 2 system of

More information

Review of Linear Algebra

Review of Linear Algebra Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=

More information

The Lusztig-Vogan Bijection in the Case of the Trivial Representation

The Lusztig-Vogan Bijection in the Case of the Trivial Representation The Lusztig-Vogan Bijection in the Case of the Trivial Representation Alan Peng under the direction of Guangyi Yue Department of Mathematics Massachusetts Institute of Technology Research Science Institute

More information

arxiv: v1 [math.co] 21 Sep 2015

arxiv: v1 [math.co] 21 Sep 2015 Chocolate Numbers arxiv:1509.06093v1 [math.co] 21 Sep 2015 Caleb Ji, Tanya Khovanova, Robin Park, Angela Song September 22, 2015 Abstract In this paper, we consider a game played on a rectangular m n gridded

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing

More information

Common-Knowledge / Cheat Sheet

Common-Knowledge / Cheat Sheet CSE 521: Design and Analysis of Algorithms I Fall 2018 Common-Knowledge / Cheat Sheet 1 Randomized Algorithm Expectation: For a random variable X with domain, the discrete set S, E [X] = s S P [X = s]

More information

The Probabilistic Method

The Probabilistic Method The Probabilistic Method Janabel Xia and Tejas Gopalakrishna MIT PRIMES Reading Group, mentors Gwen McKinley and Jake Wellens December 7th, 2018 Janabel Xia and Tejas Gopalakrishna Probabilistic Method

More information

Finite Math - J-term Section Systems of Linear Equations in Two Variables Example 1. Solve the system

Finite Math - J-term Section Systems of Linear Equations in Two Variables Example 1. Solve the system Finite Math - J-term 07 Lecture Notes - //07 Homework Section 4. - 9, 0, 5, 6, 9, 0,, 4, 6, 0, 50, 5, 54, 55, 56, 6, 65 Section 4. - Systems of Linear Equations in Two Variables Example. Solve the system

More information

Eigenvalues, Eigenvectors, and Diagonalization

Eigenvalues, Eigenvectors, and Diagonalization Math 240 TA: Shuyi Weng Winter 207 February 23, 207 Eigenvalues, Eigenvectors, and Diagonalization The concepts of eigenvalues, eigenvectors, and diagonalization are best studied with examples. We will

More information

Matrices and RRE Form

Matrices and RRE Form Matrices and RRE Form Notation R is the real numbers, C is the complex numbers (we will only consider complex numbers towards the end of the course) is read as an element of For instance, x R means that

More information

Evaluating Determinants by Row Reduction

Evaluating Determinants by Row Reduction Evaluating Determinants by Row Reduction MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Objectives Reduce a matrix to row echelon form and evaluate its determinant.

More information

arxiv: v1 [cs.sc] 17 Apr 2013

arxiv: v1 [cs.sc] 17 Apr 2013 EFFICIENT CALCULATION OF DETERMINANTS OF SYMBOLIC MATRICES WITH MANY VARIABLES TANYA KHOVANOVA 1 AND ZIV SCULLY 2 arxiv:1304.4691v1 [cs.sc] 17 Apr 2013 Abstract. Efficient matrix determinant calculations

More information

1 Intro to RMT (Gene)

1 Intro to RMT (Gene) M705 Spring 2013 Summary for Week 2 1 Intro to RMT (Gene) (Also see the Anderson - Guionnet - Zeitouni book, pp.6-11(?) ) We start with two independent families of R.V.s, {Z i,j } 1 i

More information

Apollonian Equilateral Triangles

Apollonian Equilateral Triangles Apollonian Equilateral Triangles Christina Chen Second Annual MIT PRIMES Conference May 19, 2012 Geometric Motivation: Apollonian Circles a d c b Geometric Motivation: Apollonian Circles a d c b Figure

More information

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018 Homework #1 Assigned: August 20, 2018 Review the following subjects involving systems of equations and matrices from Calculus II. Linear systems of equations Converting systems to matrix form Pivot entry

More information

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted

More information

1 - Systems of Linear Equations

1 - Systems of Linear Equations 1 - Systems of Linear Equations 1.1 Introduction to Systems of Linear Equations Almost every problem in linear algebra will involve solving a system of equations. ü LINEAR EQUATIONS IN n VARIABLES We are

More information

The Multivariate Gaussian Distribution [DRAFT]

The Multivariate Gaussian Distribution [DRAFT] The Multivariate Gaussian Distribution DRAFT David S. Rosenberg Abstract This is a collection of a few key and standard results about multivariate Gaussian distributions. I have not included many proofs,

More information

4. Linear transformations as a vector space 17

4. Linear transformations as a vector space 17 4 Linear transformations as a vector space 17 d) 1 2 0 0 1 2 0 0 1 0 0 0 1 2 3 4 32 Let a linear transformation in R 2 be the reflection in the line = x 2 Find its matrix 33 For each linear transformation

More information

Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets

Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Navid Nasr Esfahani, Ian Goldberg and Douglas R. Stinson David R. Cheriton School of Computer Science University of

More information

Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Numerical Analysis Lecture Notes Peter J Olver 8 Numerical Computation of Eigenvalues In this part, we discuss some practical methods for computing eigenvalues and eigenvectors of matrices Needless to

More information

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that

More information

3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions

3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence

More information

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i ) Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical

More information

Lecture 7: Introduction to linear systems

Lecture 7: Introduction to linear systems Lecture 7: Introduction to linear systems Two pictures of linear systems Consider the following system of linear algebraic equations { x 2y =, 2x+y = 7. (.) Note that it is a linear system with two unknowns

More information

Progress in the method of Ghosts and Shadows for Beta Ensembles

Progress in the method of Ghosts and Shadows for Beta Ensembles Progress in the method of Ghosts and Shadows for Beta Ensembles Alan Edelman (MIT) Alex Dubbs (MIT) and Plamen Koev (SJS) Oct 8, 2012 1/47 Wishart Matrices (arbitrary covariance) G=mxn matrix of Gaussians

More information

Linear Systems. Math A Bianca Santoro. September 23, 2016

Linear Systems. Math A Bianca Santoro. September 23, 2016 Linear Systems Math A4600 - Bianca Santoro September 3, 06 Goal: Understand how to solve Ax = b. Toy Model: Let s study the following system There are two nice ways of thinking about this system: x + y

More information

Introduction to Iterative Solvers of Linear Systems

Introduction to Iterative Solvers of Linear Systems Introduction to Iterative Solvers of Linear Systems SFB Training Event January 2012 Prof. Dr. Andreas Frommer Typeset by Lukas Krämer, Simon-Wolfgang Mages and Rudolf Rödl 1 Classes of Matrices and their

More information

Math Final December 2006 C. Robinson

Math Final December 2006 C. Robinson Math 285-1 Final December 2006 C. Robinson 2 5 8 5 1 2 0-1 0 1. (21 Points) The matrix A = 1 2 2 3 1 8 3 2 6 has the reduced echelon form U = 0 0 1 2 0 0 0 0 0 1. 2 6 1 0 0 0 0 0 a. Find a basis for the

More information

INTRODUCTION THEOREMS ACKNOWLEDGEMENTS. Radical Denesting. Kaan Dokmeci Mentor: Yongyi Chen MIT PRIMES Conference. May 20, 2017

INTRODUCTION THEOREMS ACKNOWLEDGEMENTS. Radical Denesting. Kaan Dokmeci Mentor: Yongyi Chen MIT PRIMES Conference. May 20, 2017 Kaan Dokmeci Mentor: Yongyi Chen MIT PRIMES Conference May 20, 2017 INTRODUCTION TO DENESTING The goal of this project is to find ways to efficiently denest given radicals. INTRODUCTION TO DENESTING The

More information

a 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12

a 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12 24 8 Matrices Determinant of 2 2 matrix Given a 2 2 matrix [ ] a a A = 2 a 2 a 22 the real number a a 22 a 2 a 2 is determinant and denoted by det(a) = a a 2 a 2 a 22 Example 8 Find determinant of 2 2

More information

Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems. Matrix Factorization Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

More information

Matrix Basic Concepts

Matrix Basic Concepts Matrix Basic Concepts Topics: What is a matrix? Matrix terminology Elements or entries Diagonal entries Address/location of entries Rows and columns Size of a matrix A column matrix; vectors Special types

More information

MATRICES. a m,1 a m,n A =

MATRICES. a m,1 a m,n A = MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of

More information

Vectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1. x 2. x =

Vectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1. x 2. x = Linear Algebra Review Vectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1 x x = 2. x n Vectors of up to three dimensions are easy to diagram.

More information

Pre-Calculus I. For example, the system. x y 2 z. may be represented by the augmented matrix

Pre-Calculus I. For example, the system. x y 2 z. may be represented by the augmented matrix Pre-Calculus I 8.1 Matrix Solutions to Linear Systems A matrix is a rectangular array of elements. o An array is a systematic arrangement of numbers or symbols in rows and columns. Matrices (the plural

More information

JACOBI S ITERATION METHOD

JACOBI S ITERATION METHOD ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes

More information

ACM106a - Homework 2 Solutions

ACM106a - Homework 2 Solutions ACM06a - Homework 2 Solutions prepared by Svitlana Vyetrenko October 7, 2006. Chapter 2, problem 2.2 (solution adapted from Golub, Van Loan, pp.52-54): For the proof we will use the fact that if A C m

More information

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2

More information

Fluctuations from the Semicircle Law Lecture 4

Fluctuations from the Semicircle Law Lecture 4 Fluctuations from the Semicircle Law Lecture 4 Ioana Dumitriu University of Washington Women and Math, IAS 2014 May 23, 2014 Ioana Dumitriu (UW) Fluctuations from the Semicircle Law Lecture 4 May 23, 2014

More information

Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007

Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007 Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007 You have 1 hour and 20 minutes. No notes, books, or other references. You are permitted to use Maple during this exam, but you must start with a blank

More information

MATH 225 Summer 2005 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 2005

MATH 225 Summer 2005 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 2005 MATH 225 Summer 25 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 25 Department of Mathematical and Statistical Sciences University of Alberta Question 1. [p 224. #2] The set of all

More information

A Sudoku Submatrix Study

A Sudoku Submatrix Study A Sudoku Submatrix Study Merciadri Luca LucaMerciadri@studentulgacbe Abstract In our last article ([1]), we gave some properties of Sudoku matrices We here investigate some properties of the Sudoku submatrices

More information

Bulk scaling limits, open questions

Bulk scaling limits, open questions Bulk scaling limits, open questions Based on: Continuum limits of random matrices and the Brownian carousel B. Valkó, B. Virág. Inventiones (2009). Eigenvalue statistics for CMV matrices: from Poisson

More information

18.600: Lecture 32 Markov Chains

18.600: Lecture 32 Markov Chains 18.600: Lecture 32 Markov Chains Scott Sheffield MIT Outline Markov chains Examples Ergodicity and stationarity Outline Markov chains Examples Ergodicity and stationarity Markov chains Consider a sequence

More information

MTH50 Spring 07 HW Assignment 7 {From [FIS0]}: Sec 44 #4a h 6; Sec 5 #ad ac 4ae 4 7 The due date for this assignment is 04/05/7 Sec 44 #4a h Evaluate the erminant of the following matrices by any legitimate

More information

L3: Review of linear algebra and MATLAB

L3: Review of linear algebra and MATLAB L3: Review of linear algebra and MATLAB Vector and matrix notation Vectors Matrices Vector spaces Linear transformations Eigenvalues and eigenvectors MATLAB primer CSCE 666 Pattern Analysis Ricardo Gutierrez-Osuna

More information

Linear Algebra I Lecture 8

Linear Algebra I Lecture 8 Linear Algebra I Lecture 8 Xi Chen 1 1 University of Alberta January 25, 2019 Outline 1 2 Gauss-Jordan Elimination Given a system of linear equations f 1 (x 1, x 2,..., x n ) = 0 f 2 (x 1, x 2,..., x n

More information

Math 240 Calculus III

Math 240 Calculus III Generalized Calculus III Summer 2015, Session II Thursday, July 23, 2015 Agenda 1. 2. 3. 4. Motivation Defective matrices cannot be diagonalized because they do not possess enough eigenvectors to make

More information

Eigenvalues and Singular Values of Random Matrices: A Tutorial Introduction

Eigenvalues and Singular Values of Random Matrices: A Tutorial Introduction Random Matrix Theory and its applications to Statistics and Wireless Communications Eigenvalues and Singular Values of Random Matrices: A Tutorial Introduction Sergio Verdú Princeton University National

More information

Today s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn

Today s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn Today s class Linear Algebraic Equations LU Decomposition 1 Linear Algebraic Equations Gaussian Elimination works well for solving linear systems of the form: AX = B What if you have to solve the linear

More information

Solving Systems of Linear Equations Using Matrices

Solving Systems of Linear Equations Using Matrices Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.

More information

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion Chapter 2:Determinants Section 2.1: Determinants by cofactor expansion [ ] a b Recall: The 2 2 matrix is invertible if ad bc 0. The c d ([ ]) a b function f = ad bc is called the determinant and it associates

More information

a. Define your variables. b. Construct and fill in a table. c. State the Linear Programming Problem. Do Not Solve.

a. Define your variables. b. Construct and fill in a table. c. State the Linear Programming Problem. Do Not Solve. Math Section. Example : The officers of a high school senior class are planning to rent buses and vans for a class trip. Each bus can transport 4 students, requires chaperones, and costs $, to rent. Each

More information

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. MATH 311-504 Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij

More information

Math/Phys/Engr 428, Math 529/Phys 528 Numerical Methods - Summer Homework 3 Due: Tuesday, July 3, 2018

Math/Phys/Engr 428, Math 529/Phys 528 Numerical Methods - Summer Homework 3 Due: Tuesday, July 3, 2018 Math/Phys/Engr 428, Math 529/Phys 528 Numerical Methods - Summer 28. (Vector and Matrix Norms) Homework 3 Due: Tuesday, July 3, 28 Show that the l vector norm satisfies the three properties (a) x for x

More information

Linear algebra and differential equations (Math 54): Lecture 13

Linear algebra and differential equations (Math 54): Lecture 13 Linear algebra and differential equations (Math 54): Lecture 13 Vivek Shende March 3, 016 Hello and welcome to class! Last time We discussed change of basis. This time We will introduce the notions of

More information

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any

More information

Determinants Chapter 3 of Lay

Determinants Chapter 3 of Lay Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j

More information

Math 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler.

Math 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler. Math 453 Exam 3 Review The syllabus for Exam 3 is Chapter 6 (pages -2), Chapter 7 through page 37, and Chapter 8 through page 82 in Axler.. You should be sure to know precise definition of the terms we

More information

Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur

Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur Lecture No. #07 Jordan Canonical Form Cayley Hamilton Theorem (Refer Slide Time:

More information

Universal Fluctuation Formulae for one-cut β-ensembles

Universal Fluctuation Formulae for one-cut β-ensembles Universal Fluctuation Formulae for one-cut β-ensembles with a combinatorial touch Pierpaolo Vivo with F. D. Cunden Phys. Rev. Lett. 113, 070202 (2014) with F.D. Cunden and F. Mezzadri J. Phys. A 48, 315204

More information