From alternating sign matrices to Painlevé VI

Size: px
Start display at page:

Download "From alternating sign matrices to Painlevé VI"

Transcription

1 From alternating sign matrices to Painlevé VI Hjalmar Rosengren Chalmers University of Technology and University of Gothenburg Nagoya, July 31, 2012 Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

2 Outline 1 Three-coloured chessboards 2 Combinatorial results 3 Symmetric polynomials 4 Painlevé VI 5 Future problems Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

3 Outline 1 Three-coloured chessboards 2 Combinatorial results 3 Symmetric polynomials 4 Painlevé VI 5 Future problems Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

4 Three-coloured chessboards n n Chessboard of size (n + 1) (n + 1). Paint squares with three colours 0, 1, 2 mod 3. Adjacent squares have distinct colour. Domain wall boundary conditions (DWBC). Read entries mod 3. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

5 Three-coloured chessboards n n Chessboard of size (n + 1) (n + 1). Paint squares with three colours 0, 1, 2 mod 3. Adjacent squares have distinct colour. Domain wall boundary conditions (DWBC). Read entries mod 3. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

6 Example When n = 3 there are seven chessboards. 0 = black, 1 = red, 2 = yellow. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

7 Other descriptions Chessboard Alternating sign matrix Ice graph Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

8 Bijection to alternating sign matrices Represent colours (residue classes mod 3) by integers so that neighbours differ by Contract each block [ a c d b ] to (b + c a d)/2 { 1, 0, 1} Gives bijection to n n alternating sign matrices. Non-zero entries in each row and column alternate in sign and add up to 1. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

9 Bijection to alternating sign matrices Represent colours (residue classes mod 3) by integers so that neighbours differ by Contract each block [ a c d b ] to (b + c a d)/2 { 1, 0, 1} Gives bijection to n n alternating sign matrices. Non-zero entries in each row and column alternate in sign and add up to 1. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

10 Bijection to alternating sign matrices Represent colours (residue classes mod 3) by integers so that neighbours differ by Contract each block [ a c d b ] to (b + c a d)/2 { 1, 0, 1} Gives bijection to n n alternating sign matrices. Non-zero entries in each row and column alternate in sign and add up to 1. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

11 Bijection to ice graphs (states of six-vertex model) Put arrows between adjacent squares. Larger entry to the right, 0 < 1 < 2 < Each vertex has two incoming and two outgoing edges. Domain wall boundary conditions. Vertex = Oxygen, Incoming arrow = Hydrogen bond. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

12 Bijection to ice graphs (states of six-vertex model) Put arrows between adjacent squares. Larger entry to the right, 0 < 1 < 2 < Each vertex has two incoming and two outgoing edges. Domain wall boundary conditions. Vertex = Oxygen, Incoming arrow = Hydrogen bond. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

13 Bijection to ice graphs (states of six-vertex model) Put arrows between adjacent squares. Larger entry to the right, 0 < 1 < 2 < 0. Each vertex has two incoming and two outgoing edges. Domain wall boundary conditions. Vertex = Oxygen, Incoming arrow = Hydrogen bond. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

14 Bijection to ice graphs (states of six-vertex model) Put arrows between adjacent squares. Larger entry to the right, 0 < 1 < 2 < 0. Each vertex has two incoming and two outgoing edges. Domain wall boundary conditions. Vertex = Oxygen, Incoming arrow = Hydrogen bond. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

15 Bijection to ice graphs (states of six-vertex model) Put arrows between adjacent squares. Larger entry to the right, 0 < 1 < 2 < 0. Each vertex has two incoming and two outgoing edges. Domain wall boundary conditions. Vertex = Oxygen, Incoming arrow = Hydrogen bond. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

16 Bijection to ice graphs (states of six-vertex model) Put arrows between adjacent squares. Larger entry to the right, 0 < 1 < 2 < 0. Each vertex has two incoming and two outgoing edges. Domain wall boundary conditions. Vertex = Oxygen, Incoming arrow = Hydrogen bond. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

17 Outline 1 Three-coloured chessboards 2 Combinatorial results 3 Symmetric polynomials 4 Painlevé VI 5 Future problems Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

18 Example For n = 5, the number of chessboards with exactly k squares of colour 0 and l squares of colour 2 are as follows. k= l= = Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

19 Example For n = 5, the number of chessboards with exactly k squares of colour 0 and l squares of colour 2 are as follows. k= l= = Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

20 Example For n = 5, the number of chessboards with exactly k squares of colour 0 and l squares of colour 2 are as follows. k= l= = ( 6 k ) Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

21 Example For n = 5, the number of chessboards with exactly k squares of colour 0 and l squares of colour 2 are as follows. k= l= = ( 6 k = ) Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

22 Example For n = 5, the number of chessboards with exactly k squares of colour 0 and l squares of colour 2 are as follows. k= l= = ( ) 6 k = ( ) ( 4 k + 4 ) k 2 Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

23 Example For n = 5, the number of chessboards with exactly k squares of colour 0 and l squares of colour 2 are as follows. k= l= = ( ) 6 k = ( ) ( 4 k + 4 k 2 ) = Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

24 Generating function (partition function) Z n (t 0, t 1, t 2 ) = chessboards of size (n+1) (n+1) # squares coloured 0 # squares coloured 1 # squares coloured 2 t 0 t 1 t 2 Z 5 (t 0, t 1, t 2 ) = t 14 0 t 14 1 t t 13 0 t 14 1 t Partition function for three-colour model with DWBC. Studied by Baxter (1970) for periodic boundary conditions. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

25 Generating function (partition function) Z n (t 0, t 1, t 2 ) = chessboards of size (n+1) (n+1) # squares coloured 0 # squares coloured 1 # squares coloured 2 t 0 t 1 t 2 Z 5 (t 0, t 1, t 2 ) = t 14 0 t 14 1 t t 13 0 t 14 1 t Partition function for three-colour model with DWBC. Studied by Baxter (1970) for periodic boundary conditions. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

26 Generating function (partition function) Z n (t 0, t 1, t 2 ) = chessboards of size (n+1) (n+1) # squares coloured 0 # squares coloured 1 # squares coloured 2 t 0 t 1 t 2 Z 5 (t 0, t 1, t 2 ) = t 14 0 t 14 1 t t 13 0 t 14 1 t Partition function for three-colour model with DWBC. Studied by Baxter (1970) for periodic boundary conditions. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

27 Three questions How many states are there (for fixed n)? What is Z n (1, 1, 1)? How common are the various colors? What is Z n t j (1, 1, 1) = chessboards #squares of colour j? What is the joint distribution of the three colours? What is Z n (t 0, t 1, t 2 )? Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

28 Three questions How many states are there (for fixed n)? What is Z n (1, 1, 1)? How common are the various colors? What is Z n t j (1, 1, 1) = chessboards #squares of colour j? What is the joint distribution of the three colours? What is Z n (t 0, t 1, t 2 )? Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

29 Three questions How many states are there (for fixed n)? What is Z n (1, 1, 1)? How common are the various colors? What is Z n t j (1, 1, 1) = chessboards #squares of colour j? What is the joint distribution of the three colours? What is Z n (t 0, t 1, t 2 )? Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

30 Question 1: Enumeration Alternating sign matrix theorem: #chessboards = 1! 4! 7! (3n 2)! n!(n + 1)!(n + 2)! (2n 1)!. Conjectured by Mills Robbins Rumsey (1983). Proved by Zeilberger (1996). Much simpler proof by Kuperberg (1996), using six-vertex model. We generalize Kuperberg s work using eight-vertex-solid-on-solid (8VSOS) model. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

31 Question 1: Enumeration Alternating sign matrix theorem: #chessboards = 1! 4! 7! (3n 2)! n!(n + 1)!(n + 2)! (2n 1)!. Conjectured by Mills Robbins Rumsey (1983). Proved by Zeilberger (1996). Much simpler proof by Kuperberg (1996), using six-vertex model. We generalize Kuperberg s work using eight-vertex-solid-on-solid (8VSOS) model. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

32 Question 1: Enumeration Alternating sign matrix theorem: #chessboards = 1! 4! 7! (3n 2)! n!(n + 1)!(n + 2)! (2n 1)!. Conjectured by Mills Robbins Rumsey (1983). Proved by Zeilberger (1996). Much simpler proof by Kuperberg (1996), using six-vertex model. We generalize Kuperberg s work using eight-vertex-solid-on-solid (8VSOS) model. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

33 8VSOS model (no details) Introduced by Baxter Generalizes both three-colour model and six-vertex model. Same states, but more general weight function. It gives a nice way to put 2n extra parameters into three-colour model (or 2 extra parameters into six-vertex model). The Yang Baxter equation implies non-trivial and useful symmetries in these extra parameters. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

34 8VSOS model (no details) Introduced by Baxter Generalizes both three-colour model and six-vertex model. Same states, but more general weight function. It gives a nice way to put 2n extra parameters into three-colour model (or 2 extra parameters into six-vertex model). The Yang Baxter equation implies non-trivial and useful symmetries in these extra parameters. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

35 8VSOS model (no details) Introduced by Baxter Generalizes both three-colour model and six-vertex model. Same states, but more general weight function. It gives a nice way to put 2n extra parameters into three-colour model (or 2 extra parameters into six-vertex model). The Yang Baxter equation implies non-trivial and useful symmetries in these extra parameters. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

36 Trigonometric case The 8VSOS model involves elliptic functions. Using the trigonometric limit case, we can prove that, with ω = e 2πi/3, ( ) 1 Z n (1 λ), 1 3 (1 λω), 1 3 (1 λω 2 ) 3 = (1 λω2 ) 2 (1 λω n+1 ) 2 (A n (1 + ω n λ 2 ) + ( 1) n C n ω 2n λ), (1 λ 3 ) n2 +2n+3 where A n are alternating sign matrix numbers and C n = n j=1 (3j 1)(3j 3)! (n + j 1)! count cyclically symmetric plane partitions. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

37 Consequence The case λ = 0 is the ASM Theorem: Z n (1, 1, 1) = A n. Applying / λ gives expressions for the first moments λ=0 #squares of colour j, chessboards which answers Question 2. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

38 Consequence The case λ = 0 is the ASM Theorem: Z n (1, 1, 1) = A n. Applying / λ gives expressions for the first moments λ=0 #squares of colour j, chessboards which answers Question 2. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

39 Answer to Question 2: How common are the colours? Suppose n 0 mod 6 and consider the colour 0 (all other cases are similar). Probability that random square from random chess-board (chosen uniformly) has colour 0 is (3n 1) 9(n + 1) (3n 2) + 4 9(n + 1) 2 = Γ(1/3) 9 Γ(2/3) n 5/ n 2 + O(n 3 ), n. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

40 Answer to Question 2: How common are the colours? Suppose n 0 mod 6 and consider the colour 0 (all other cases are similar). Probability that random square from random chess-board (chosen uniformly) has colour 0 is (3n 1) 9(n + 1) (3n 2) + 4 9(n + 1) 2 = Γ(1/3) 9 Γ(2/3) n 5/ n 2 + O(n 3 ), n. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

41 Answer to Question 2: How common are the colours? Suppose n 0 mod 6 and consider the colour 0 (all other cases are similar). Probability that random square from random chess-board (chosen uniformly) has colour 0 is (3n 1) 9(n + 1) (3n 2) + 4 9(n + 1) 2 = Γ(1/3) 9 Γ(2/3) n 5/ n 2 + O(n 3 ), n. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

42 Question 3: What is Z n in general? Z n can be split as a sum of two parts. Each part is a specialized affine Lie algebra character, and a tau function of Painlevé VI. Moreover, each part satisfies a Toda-type recursion. Before giving some details, we mention one more thing. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

43 Question 3: What is Z n in general? Z n can be split as a sum of two parts. Each part is a specialized affine Lie algebra character, and a tau function of Painlevé VI. Moreover, each part satisfies a Toda-type recursion. Before giving some details, we mention one more thing. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

44 Question 3: What is Z n in general? Z n can be split as a sum of two parts. Each part is a specialized affine Lie algebra character, and a tau function of Painlevé VI. Moreover, each part satisfies a Toda-type recursion. Before giving some details, we mention one more thing. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

45 Free energy Supppose t 0, t 1, t 2 are positive. Conjecture: log Z n (t 0, t 1, t 2 ) lim n n 2 where ζ is determined by = 1 3 log(t 0t 1 t 2 ) + log ( (ζ + 2) 3 4 (2ζ + 1) ζ 1 12 (ζ + 1) 4 3 (t 0 t 1 + t 0 t 2 + t 1 t 2 ) 3 (t 0 t 1 t 2 ) 2 = 2(ζ2 + 4ζ + 1) 3 ζ(ζ + 1) 4, ζ 1. Compare Baxter s formula for periodic boundary conditions: ( ) 1 3 log(t ζ 1 3 (ζ + 1) 4 3 0t 1 t 2 ) + log. (2ζ + 1) 3 2 ), Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

46 Free energy Supppose t 0, t 1, t 2 are positive. Conjecture: log Z n (t 0, t 1, t 2 ) lim n n 2 where ζ is determined by = 1 3 log(t 0t 1 t 2 ) + log ( (ζ + 2) 3 4 (2ζ + 1) ζ 1 12 (ζ + 1) 4 3 (t 0 t 1 + t 0 t 2 + t 1 t 2 ) 3 (t 0 t 1 t 2 ) 2 = 2(ζ2 + 4ζ + 1) 3 ζ(ζ + 1) 4, ζ 1. Compare Baxter s formula for periodic boundary conditions: ( ) 1 3 log(t ζ 1 3 (ζ + 1) 4 3 0t 1 t 2 ) + log. (2ζ + 1) 3 2 ), Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

47 Outline 1 Three-coloured chessboards 2 Combinatorial results 3 Symmetric polynomials 4 Painlevé VI 5 Future problems Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

48 Symmetric polynomials Let S n (x 1,..., x n, y 1,..., y n, z) n i,j=1 = G(x i, y j ) 1 i<j n (x j x i )(y j y i ) det 1 i,j n ( ) F(xi, y j, z), G(x i, y j ) F(x, y, z) = (ζ + 2)xyz ζ(xy + yz + xz + x + y + z) + ζ(2ζ + 1), G(x, y) = (ζ + 2)xy(x + y) ζ(x 2 + y 2 ) 2(ζ 2 + 3ζ + 1)xy + ζ(2ζ + 1)(x + y). This is a symmetric (!) polynomial in all 2n + 1 variables, depending on parameter ζ. It can be identified with a character of A (2) 4n 3 affine Lie algebra. Cauchy-type : all minors have the same form. Very useful! Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

49 Symmetric polynomials Let S n (x 1,..., x n, y 1,..., y n, z) n i,j=1 = G(x i, y j ) 1 i<j n (x j x i )(y j y i ) det 1 i,j n ( ) F(xi, y j, z), G(x i, y j ) F(x, y, z) = (ζ + 2)xyz ζ(xy + yz + xz + x + y + z) + ζ(2ζ + 1), G(x, y) = (ζ + 2)xy(x + y) ζ(x 2 + y 2 ) 2(ζ 2 + 3ζ + 1)xy + ζ(2ζ + 1)(x + y). This is a symmetric (!) polynomial in all 2n + 1 variables, depending on parameter ζ. It can be identified with a character of A (2) 4n 3 affine Lie algebra. Cauchy-type : all minors have the same form. Very useful! Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

50 Symmetric polynomials Let S n (x 1,..., x n, y 1,..., y n, z) n i,j=1 = G(x i, y j ) 1 i<j n (x j x i )(y j y i ) det 1 i,j n ( ) F(xi, y j, z), G(x i, y j ) F(x, y, z) = (ζ + 2)xyz ζ(xy + yz + xz + x + y + z) + ζ(2ζ + 1), G(x, y) = (ζ + 2)xy(x + y) ζ(x 2 + y 2 ) 2(ζ 2 + 3ζ + 1)xy + ζ(2ζ + 1)(x + y). This is a symmetric (!) polynomial in all 2n + 1 variables, depending on parameter ζ. It can be identified with a character of A (2) 4n 3 affine Lie algebra. Cauchy-type : all minors have the same form. Very useful! Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

51 Symmetric polynomials Let S n (x 1,..., x n, y 1,..., y n, z) n i,j=1 = G(x i, y j ) 1 i<j n (x j x i )(y j y i ) det 1 i,j n ( ) F(xi, y j, z), G(x i, y j ) F(x, y, z) = (ζ + 2)xyz ζ(xy + yz + xz + x + y + z) + ζ(2ζ + 1), G(x, y) = (ζ + 2)xy(x + y) ζ(x 2 + y 2 ) 2(ζ 2 + 3ζ + 1)xy + ζ(2ζ + 1)(x + y). This is a symmetric (!) polynomial in all 2n + 1 variables, depending on parameter ζ. It can be identified with a character of A (2) 4n 3 affine Lie algebra. Cauchy-type : all minors have the same form. Very useful! Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

52 Symmetric polynomials Let S n (x 1,..., x n, y 1,..., y n, z) n i,j=1 = G(x i, y j ) 1 i<j n (x j x i )(y j y i ) det 1 i,j n ( ) F(xi, y j, z), G(x i, y j ) F(x, y, z) = (ζ + 2)xyz ζ(xy + yz + xz + x + y + z) + ζ(2ζ + 1), G(x, y) = (ζ + 2)xy(x + y) ζ(x 2 + y 2 ) 2(ζ 2 + 3ζ + 1)xy + ζ(2ζ + 1)(x + y). This is a symmetric (!) polynomial in all 2n + 1 variables, depending on parameter ζ. It can be identified with a character of A (2) 4n 3 affine Lie algebra. Cauchy-type : all minors have the same form. Very useful! Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

53 Relation to three-colour model Let p n (ζ) = elementary factor ( ζ S n 2ζ + 1,..., 2ζ + 1, }{{} ζ + 2,..., n+1 This is a polynomial in ζ of degree n(n + 1)/2. ζ ζ + 2 } {{ } n Result: Z n (t 0, t 1, t 2 ) is a linear combination (with elementary coefficients) of p n 1 (ζ) and p n 1 (1/ζ), where (t 0 t 1 + t 0 t 2 + t 1 t 2 ) 3 (t 0 t 1 t 2 ) 2 = 2(ζ2 + 4ζ + 1) 3 ζ(ζ + 1) 4. ). Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

54 Relation to three-colour model Let p n (ζ) = elementary factor ( ζ S n 2ζ + 1,..., 2ζ + 1, }{{} ζ + 2,..., n+1 This is a polynomial in ζ of degree n(n + 1)/2. ζ ζ + 2 } {{ } n Result: Z n (t 0, t 1, t 2 ) is a linear combination (with elementary coefficients) of p n 1 (ζ) and p n 1 (1/ζ), where (t 0 t 1 + t 0 t 2 + t 1 t 2 ) 3 (t 0 t 1 t 2 ) 2 = 2(ζ2 + 4ζ + 1) 3 ζ(ζ + 1) 4. ). Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

55 More precisely... Suppose n 0 mod 6 and (t 0 t 1 + t 0 t 2 + t 1 t 2 ) 3 (t 0 t 1 t 2 ) 2 = 2(ζ2 + 4ζ + 1) 3 ζ(ζ + 1) 4. Z n (t 0, t 1, t 2 ) = (t 0 t 1 t 2 ) n(n+2) 3 ) n 2 12 ( 2 ζ(ζ + 1) 4 p n 1 (ζ) ζ (t n p n 1 (1/ζ) 0 1 ζ t 0t 1 t 2 (ζ 2 + 4ζ + 1) t 0 t 1 + t 0 t 2 + t 1 t 2 Note that only asymmetry comes from t 0. ) n p n 1 (ζ) ζ 2 2 p n 1 (1/ζ) 1 ζ 2 Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

56 More precisely... Suppose n 0 mod 6 and (t 0 t 1 + t 0 t 2 + t 1 t 2 ) 3 (t 0 t 1 t 2 ) 2 = 2(ζ2 + 4ζ + 1) 3 ζ(ζ + 1) 4. Z n (t 0, t 1, t 2 ) = (t 0 t 1 t 2 ) n(n+2) 3 ) n 2 12 ( 2 ζ(ζ + 1) 4 p n 1 (ζ) ζ (t n p n 1 (1/ζ) 0 1 ζ t 0t 1 t 2 (ζ 2 + 4ζ + 1) t 0 t 1 + t 0 t 2 + t 1 t 2 Note that only asymmetry comes from t 0. ) n p n 1 (ζ) ζ 2 2 p n 1 (1/ζ) 1 ζ 2 Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

57 Table of p n n p n (ζ) ζ ζ ζ 2 + 7ζ (35ζ ζ ζ ζ ζ ζ + 2) (63ζ ζ ζ ζ ζ ζ ζ ζ ζ ζ + 2) Conjecture: The polynomials p n have positive coefficients. Conjecture: The polynomials p n are unimodal. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

58 Table of p n n p n (ζ) ζ ζ ζ 2 + 7ζ (35ζ ζ ζ ζ ζ ζ + 2) (63ζ ζ ζ ζ ζ ζ ζ ζ ζ ζ + 2) Conjecture: The polynomials p n have positive coefficients. Conjecture: The polynomials p n are unimodal. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

59 Plot of the 105 complex zeroes of p 14. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

60 Outline 1 Three-coloured chessboards 2 Combinatorial results 3 Symmetric polynomials 4 Painlevé VI 5 Future problems Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

61 Painlevé VI PVI is the nonlinear ODE (Painlevé, Fuchs, Gambier ) d 2 y dt = 1 ( y + 1 y ( 1 + y t t + 1 t y t y(y 1)(y t) 2t 2 (t 1) 2 ) ( dy dt ) dy dt ) 2 ( α + β t y + γ t 1 t(t 1) + δ 2 (y 1) 2 (y t) 2 Most general second order ODE such that all movable singularities are poles. Special functions of the 21st Century? ). Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

62 Painlevé VI PVI is the nonlinear ODE (Painlevé, Fuchs, Gambier ) d 2 y dt = 1 ( y + 1 y ( 1 + y t t + 1 t y t y(y 1)(y t) 2t 2 (t 1) 2 ) ( dy dt ) dy dt ) 2 ( α + β t y + γ t 1 t(t 1) + δ 2 (y 1) 2 (y t) 2 Most general second order ODE such that all movable singularities are poles. Special functions of the 21st Century? ). Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

63 Bäcklund transformations If y = y(t) solves PVI, then so does t/y, with parameters α β, γ 1 2 δ. Such Bäcklund transformations y F(t, y, y ) generate group (extended affine Weyl group) containing Z 4. Given a seed solution y = y 0000, acting with Z 4 gives new solutions y k1 k 2 k 3 k 4. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

64 Bäcklund transformations If y = y(t) solves PVI, then so does t/y, with parameters α β, γ 1 2 δ. Such Bäcklund transformations y F(t, y, y ) generate group (extended affine Weyl group) containing Z 4. Given a seed solution y = y 0000, acting with Z 4 gives new solutions y k1 k 2 k 3 k 4. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

65 Bäcklund transformations If y = y(t) solves PVI, then so does t/y, with parameters α β, γ 1 2 δ. Such Bäcklund transformations y F(t, y, y ) generate group (extended affine Weyl group) containing Z 4. Given a seed solution y = y 0000, acting with Z 4 gives new solutions y k1 k 2 k 3 k 4. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

66 Picard s seed solution When α = β = γ = 0, δ = 1/2, PVI can be solved in terms of elliptic functions (Picard, 1889). Picard s solutions include the algebraic solution which is parametrized by y 4 4ty 3 + 6ty 2 4ty + t 2 = 0, y = ζ(ζ + 2) ζ(ζ + 2)3, t = 2ζ + 1 (2ζ + 1). 3 If we choose y 0000 = y, what is y k1 k 2 k 3 k 4? Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

67 Picard s seed solution When α = β = γ = 0, δ = 1/2, PVI can be solved in terms of elliptic functions (Picard, 1889). Picard s solutions include the algebraic solution which is parametrized by y 4 4ty 3 + 6ty 2 4ty + t 2 = 0, y = ζ(ζ + 2) ζ(ζ + 2)3, t = 2ζ + 1 (2ζ + 1). 3 If we choose y 0000 = y, what is y k1 k 2 k 3 k 4? Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

68 Picard s seed solution When α = β = γ = 0, δ = 1/2, PVI can be solved in terms of elliptic functions (Picard, 1889). Picard s solutions include the algebraic solution which is parametrized by y 4 4ty 3 + 6ty 2 4ty + t 2 = 0, y = ζ(ζ + 2) ζ(ζ + 2)3, t = 2ζ + 1 (2ζ + 1). 3 If we choose y 0000 = y, what is y k1 k 2 k 3 k 4? Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

69 Example y 1,2, 3,1 = ζ(ζ + 2)(ζ3 + 3ζ 2 + 3ζ + 5)(5ζ ζ 2 + 7ζ + 1) (2ζ + 1)(ζ 3 + 7ζ ζ + 5)(5ζ 3 + 3ζ 2 + 3ζ + 1) The non-trivial factors are called tau functions. Note that 5ζ ζ 2 + 7ζ + 1 = p 2 (ζ). Result: There is a 4-dim cone in Z 4 where tau functions are given by specializations of S n. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

70 Example y 1,2, 3,1 = ζ(ζ + 2)(ζ3 + 3ζ 2 + 3ζ + 5)(5ζ ζ 2 + 7ζ + 1) (2ζ + 1)(ζ 3 + 7ζ ζ + 5)(5ζ 3 + 3ζ 2 + 3ζ + 1) The non-trivial factors are called tau functions. Note that 5ζ ζ 2 + 7ζ + 1 = p 2 (ζ). Result: There is a 4-dim cone in Z 4 where tau functions are given by specializations of S n. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

71 Example y 1,2, 3,1 = ζ(ζ + 2)(ζ3 + 3ζ 2 + 3ζ + 5)(5ζ ζ 2 + 7ζ + 1) (2ζ + 1)(ζ 3 + 7ζ ζ + 5)(5ζ 3 + 3ζ 2 + 3ζ + 1) The non-trivial factors are called tau functions. Note that 5ζ ζ 2 + 7ζ + 1 = p 2 (ζ). Result: There is a 4-dim cone in Z 4 where tau functions are given by specializations of S n. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

72 Tau functions in a cone Let S (k 0,k 1,k 2,k 3 ) ( n (ζ) = S n 2ζ + 1 }{{} k 0, ζ, ζ + 2 }{{} k 1 Then, if k i are non-negative integers with k 0 + k 1 + k 2 + k 3 = 2n 1, ζ(2ζ + 1) ζ + 2 } {{ } k 2, 1 }{{} k 3 ). y k0 +k 2 n+1,k 1 +1,n k 0 k 1 1,n k 1 k 2 1 = elementary factor S(k 0+1,k 1,k 2,k 3 +1) n (ζ)s (k 0,k 1 +1,k 2 +1,k 3 ) n (ζ) S (k 0+1,k 1,k 2 +1,k 3 ) n (ζ)s (k 0,k 1 +1,k 2,k 3 +1) n (ζ), where as before y = y(t), t = ζ(ζ + 2)3 (2ζ + 1) 3. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

73 Tau functions in a cone Let S (k 0,k 1,k 2,k 3 ) ( n (ζ) = S n 2ζ + 1 }{{} k 0, ζ, ζ + 2 }{{} k 1 Then, if k i are non-negative integers with k 0 + k 1 + k 2 + k 3 = 2n 1, ζ(2ζ + 1) ζ + 2 } {{ } k 2, 1 }{{} k 3 ). y k0 +k 2 n+1,k 1 +1,n k 0 k 1 1,n k 1 k 2 1 = elementary factor S(k 0+1,k 1,k 2,k 3 +1) n (ζ)s (k 0,k 1 +1,k 2 +1,k 3 ) n (ζ) S (k 0+1,k 1,k 2 +1,k 3 ) n (ζ)s (k 0,k 1 +1,k 2,k 3 +1) n (ζ), where as before y = y(t), t = ζ(ζ + 2)3 (2ζ + 1) 3. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

74 Consequence: Recursions Tau functions satisfy bilinear recursions. For instance, it follows that p n+1 (ζ)p n 1 (ζ) = A n (ζ)p n (ζ) 2 + B n (ζ)p n (ζ)p n(ζ) with explicit coefficients. + C n (ζ)p n(ζ) 2 + D n (ζ)p n (ζ)p n(ζ). Conjectured by Bazhanov and Mangazeev Gives fast way of computing Z n. Possibly, it can be used to prove our conjectured expression for the free energy. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

75 Consequence: Recursions Tau functions satisfy bilinear recursions. For instance, it follows that p n+1 (ζ)p n 1 (ζ) = A n (ζ)p n (ζ) 2 + B n (ζ)p n (ζ)p n(ζ) with explicit coefficients. + C n (ζ)p n(ζ) 2 + D n (ζ)p n (ζ)p n(ζ). Conjectured by Bazhanov and Mangazeev Gives fast way of computing Z n. Possibly, it can be used to prove our conjectured expression for the free energy. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

76 Consequence: Recursions Tau functions satisfy bilinear recursions. For instance, it follows that p n+1 (ζ)p n 1 (ζ) = A n (ζ)p n (ζ) 2 + B n (ζ)p n (ζ)p n(ζ) with explicit coefficients. + C n (ζ)p n(ζ) 2 + D n (ζ)p n (ζ)p n(ζ). Conjectured by Bazhanov and Mangazeev Gives fast way of computing Z n. Possibly, it can be used to prove our conjectured expression for the free energy. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

77 Outline 1 Three-coloured chessboards 2 Combinatorial results 3 Symmetric polynomials 4 Painlevé VI 5 Future problems Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

78 Questions Symmetry classes of three-coloured chessboards. For the six-vertex model, various classical Lie algebra characters appear (Kuperberg, Okada,... ). For the three-colour model, we expect various affine Lie algebras. Macroscopic boundary effects. Arctic curves. New phenomenon: Some tau functions for Painlevé VI are specialized affine Lie algebra characters, given by Cauchy-type determinant formulas. Does this happen for other solutions to Painlevé equations? Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

79 Questions Symmetry classes of three-coloured chessboards. For the six-vertex model, various classical Lie algebra characters appear (Kuperberg, Okada,... ). For the three-colour model, we expect various affine Lie algebras. Macroscopic boundary effects. Arctic curves. New phenomenon: Some tau functions for Painlevé VI are specialized affine Lie algebra characters, given by Cauchy-type determinant formulas. Does this happen for other solutions to Painlevé equations? Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

80 Questions Symmetry classes of three-coloured chessboards. For the six-vertex model, various classical Lie algebra characters appear (Kuperberg, Okada,... ). For the three-colour model, we expect various affine Lie algebras. Macroscopic boundary effects. Arctic curves. New phenomenon: Some tau functions for Painlevé VI are specialized affine Lie algebra characters, given by Cauchy-type determinant formulas. Does this happen for other solutions to Painlevé equations? Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

81 Specializations of the symmetric polynomials S n recently appeared (implicitly) in three contexts: Partition function for three-colour model with DWBC (R. 2011). Ground state eigenvalue for the Q-operator of eight-vertex model (Bazhanov and Mangazeev 2005, 2006). Eigenvectors of XYZ Hamiltonian (Razumov and Stroganov 2010, Bazhanov and Mangazeev 2010, Zinn-Justin 2012). Why do the same functions appear in three contexts? Although the physical models are closely related, this is far from clear. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

82 Specializations of the symmetric polynomials S n recently appeared (implicitly) in three contexts: Partition function for three-colour model with DWBC (R. 2011). Ground state eigenvalue for the Q-operator of eight-vertex model (Bazhanov and Mangazeev 2005, 2006). Eigenvectors of XYZ Hamiltonian (Razumov and Stroganov 2010, Bazhanov and Mangazeev 2010, Zinn-Justin 2012). Why do the same functions appear in three contexts? Although the physical models are closely related, this is far from clear. Hjalmar Rosengren (Chalmers University) Nagoya, July 31, / 35

Refined Cauchy/Littlewood identities and partition functions of the six-vertex model

Refined Cauchy/Littlewood identities and partition functions of the six-vertex model Refined Cauchy/Littlewood identities and partition functions of the six-vertex model LPTHE (UPMC Paris 6), CNRS (Collaboration with Dan Betea and Paul Zinn-Justin) 6 June, 4 Disclaimer: the word Baxterize

More information

Six-vertex model partition functions and symmetric polynomials of type BC

Six-vertex model partition functions and symmetric polynomials of type BC Six-vertex model partition functions and symmetric polynomials of type BC Dan Betea LPMA (UPMC Paris 6), CNRS (Collaboration with Michael Wheeler, Paul Zinn-Justin) Iunius XXVI, MMXIV This message is proudly

More information

Izergin-Korepin determinant reloaded

Izergin-Korepin determinant reloaded Izergin-Korepin determinant reloaded arxiv:math-ph/0409072v1 27 Sep 2004 Yu. G. Stroganov Institute for High Energy Physics 142284 Protvino, Moscow region, Russia Abstract We consider the Izergin-Korepin

More information

Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order

Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order Arvind Ayyer (Bangalore) Roger E. Behrend (Cardiff) Ilse Fischer (Vienna) 1 Outline Introduction: ASMs and DASASMs

More information

New enumeration formulas for alternating sign matrices and square ice partition functions

New enumeration formulas for alternating sign matrices and square ice partition functions New enumeration formulas for alternating sign matrices and square ice partition functions Arvind Ayyer Dan Romik October 8, 01 Abstract The refined enumeration of alternating sign matrices (ASMs of given

More information

arxiv:math/ v1 [math.co] 13 Jul 2005

arxiv:math/ v1 [math.co] 13 Jul 2005 A NEW PROOF OF THE REFINED ALTERNATING SIGN MATRIX THEOREM arxiv:math/0507270v1 [math.co] 13 Jul 2005 Ilse Fischer Fakultät für Mathematik, Universität Wien Nordbergstrasse 15, A-1090 Wien, Austria E-mail:

More information

Fully Packed Loops Model: Integrability and Combinatorics. Plan

Fully Packed Loops Model: Integrability and Combinatorics. Plan ully Packed Loops Model 1 Fully Packed Loops Model: Integrability and Combinatorics Moscow 05/04 P. Di Francesco, P. Zinn-Justin, Jean-Bernard Zuber, math.co/0311220 J. Jacobsen, P. Zinn-Justin, math-ph/0402008

More information

Higher Spin Alternating Sign Matrices

Higher Spin Alternating Sign Matrices Higher Spin Alternating Sign Matrices Roger E. Behrend and Vincent A. Knight School of Mathematics, Cardiff University, Cardiff, CF24 4AG, UK behrendr@cardiff.ac.uk, knightva@cardiff.ac.uk Submitted: Aug

More information

Towards Enumerations of C-alt and D Matrices

Towards Enumerations of C-alt and D Matrices Wellesley College Wellesley College Digital Scholarship and Archive Honors Thesis Collection 2013 Towards Enumerations of C-alt and D Matrices Ran Ji rji@wellesleyedu Follow this and additional works at:

More information

On the singularities of non-linear ODEs

On the singularities of non-linear ODEs On the singularities of non-linear ODEs Galina Filipuk Institute of Mathematics University of Warsaw G.Filipuk@mimuw.edu.pl Collaborators: R. Halburd (London), R. Vidunas (Tokyo), R. Kycia (Kraków) 1 Plan

More information

Proofs & Confirmations The story of the alternating sign matrix conjecture

Proofs & Confirmations The story of the alternating sign matrix conjecture Proofs & Confirmations The story of the alternating sign matrix conjecture David M. Bressoud Macalester College University of Nebraska Omaha, NE These slides are available at www.macalester.edu/~bressoud/talks

More information

arxiv: v1 [math.co] 11 Nov 2016

arxiv: v1 [math.co] 11 Nov 2016 EXTREME DIAGONALLY AND ANTIDIAGONALLY SYMMETRIC ALTERNATING SIGN MATRICES OF ODD ORDER ARVIND AYYER, ROGER E. BEHREND, AND ILSE FISCHER arxiv:6.03823v [math.co] Nov 206 Abstract. For each α {0,, }, we

More information

Math 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations:

Math 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations: Homework Exercises 1 1 Find the complete solutions (if any!) to each of the following systems of simultaneous equations: (i) x 4y + 3z = 2 3x 11y + 13z = 3 2x 9y + 2z = 7 x 2y + 6z = 2 (ii) x 4y + 3z =

More information

Primes, partitions and permutations. Paul-Olivier Dehaye ETH Zürich, October 31 st

Primes, partitions and permutations. Paul-Olivier Dehaye ETH Zürich, October 31 st Primes, Paul-Olivier Dehaye pdehaye@math.ethz.ch ETH Zürich, October 31 st Outline Review of Bump & Gamburd s method A theorem of Moments of derivatives of characteristic polynomials Hypergeometric functions

More information

5 Quiver Representations

5 Quiver Representations 5 Quiver Representations 5. Problems Problem 5.. Field embeddings. Recall that k(y,..., y m ) denotes the field of rational functions of y,..., y m over a field k. Let f : k[x,..., x n ] k(y,..., y m )

More information

Notes on the Matrix-Tree theorem and Cayley s tree enumerator

Notes on the Matrix-Tree theorem and Cayley s tree enumerator Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will

More information

Ph.D. Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2) EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified.

Ph.D. Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2) EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified. PhD Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2 EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified Problem 1 [ points]: For which parameters λ R does the following system

More information

arxiv: v1 [math.co] 18 Oct 2018

arxiv: v1 [math.co] 18 Oct 2018 A NEW DETERMINANT FOR THE Q-ENUMERATION OF ALTERNATING SIGN MATRICES FLORIAN AIGNER arxiv:80.080v [math.co] 8 Oct 08 Abstract. Fischer provided a new type of binomial erminant for the number of alternating

More information

Math Ordinary Differential Equations

Math Ordinary Differential Equations Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x

More information

BMO Round 1 Problem 1 Generalisation

BMO Round 1 Problem 1 Generalisation BMO 008 009 Round 1 Problem 1 Generalisation Joseph Myers December 008 1 Introduction Problem 1 is: 1. Consider a standard 8 8 chessboard consisting of 64 small squares coloured in the usual pattern, so

More information

Existence and uniqueness: Picard s theorem

Existence and uniqueness: Picard s theorem Existence and uniqueness: Picard s theorem First-order equations Consider the equation y = f(x, y) (not necessarily linear). The equation dictates a value of y at each point (x, y), so one would expect

More information

Problem Set 2 Due Tuesday, September 27, ; p : 0. (b) Construct a representation using five d orbitals that sit on the origin as a basis: 1

Problem Set 2 Due Tuesday, September 27, ; p : 0. (b) Construct a representation using five d orbitals that sit on the origin as a basis: 1 Problem Set 2 Due Tuesday, September 27, 211 Problems from Carter: Chapter 2: 2a-d,g,h,j 2.6, 2.9; Chapter 3: 1a-d,f,g 3.3, 3.6, 3.7 Additional problems: (1) Consider the D 4 point group and use a coordinate

More information

x 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7

x 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7 Linear Algebra and its Applications-Lab 1 1) Use Gaussian elimination to solve the following systems x 1 + x 2 2x 3 + 4x 4 = 5 1.1) 2x 1 + 2x 2 3x 3 + x 4 = 3 3x 1 + 3x 2 4x 3 2x 4 = 1 x + y + 2z = 4 1.4)

More information

Matrix compositions. Emanuele Munarini. Dipartimento di Matematica Politecnico di Milano

Matrix compositions. Emanuele Munarini. Dipartimento di Matematica Politecnico di Milano Matrix compositions Emanuele Munarini Dipartimento di Matematica Politecnico di Milano emanuelemunarini@polimiit Joint work with Maddalena Poneti and Simone Rinaldi FPSAC 26 San Diego Motivation: L-convex

More information

Lecture 13 - Wednesday April 29th

Lecture 13 - Wednesday April 29th Lecture 13 - Wednesday April 29th jacques@ucsdedu Key words: Systems of equations, Implicit differentiation Know how to do implicit differentiation, how to use implicit and inverse function theorems 131

More information

arxiv: v2 [math-ph] 13 Feb 2013

arxiv: v2 [math-ph] 13 Feb 2013 FACTORIZATIONS OF RATIONAL MATRIX FUNCTIONS WITH APPLICATION TO DISCRETE ISOMONODROMIC TRANSFORMATIONS AND DIFFERENCE PAINLEVÉ EQUATIONS ANTON DZHAMAY SCHOOL OF MATHEMATICAL SCIENCES UNIVERSITY OF NORTHERN

More information

On elliptic quantum integrability

On elliptic quantum integrability On elliptic quantum integrability vertex models, solid-on-solid models and spin chains 1405.4281 with Galleas 1505.06870 with Galleas thesis Ch I and II 1510.00342 thesis Ch I and III in progress with

More information

Feynman Integrals, Regulators and Elliptic Polylogarithms

Feynman Integrals, Regulators and Elliptic Polylogarithms Feynman Integrals, Regulators and Elliptic Polylogarithms Pierre Vanhove Automorphic Forms, Lie Algebras and String Theory March 5, 2014 based on [arxiv:1309.5865] and work in progress Spencer Bloch, Matt

More information

Linear and nonlinear ODEs and middle convolution

Linear and nonlinear ODEs and middle convolution Linear and nonlinear ODEs and middle convolution Galina Filipuk Institute of Mathematics University of Warsaw G.Filipuk@mimuw.edu.pl Collaborator: Y. Haraoka (Kumamoto University) 1 Plan of the Talk: Linear

More information

Fully packed loop configurations: polynomiality and nested arches

Fully packed loop configurations: polynomiality and nested arches Fully packed loop configurations: polynomiality and nested arches Florian Aigner Universität Wien, Fakultät für Mathematik Oskar-Morgenstern-Platz 1, 1090 Wien, Austria florian.aigner@univie.ac.at Submitted:

More information

Mahler measure as special values of L-functions

Mahler measure as special values of L-functions Mahler measure as special values of L-functions Matilde N. Laĺın Université de Montréal mlalin@dms.umontreal.ca http://www.dms.umontreal.ca/~mlalin CRM-ISM Colloquium February 4, 2011 Diophantine equations

More information

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator

More information

arxiv: v1 [math.co] 3 Nov 2014

arxiv: v1 [math.co] 3 Nov 2014 SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed

More information

Linear Algebra. Session 12

Linear Algebra. Session 12 Linear Algebra. Session 12 Dr. Marco A Roque Sol 08/01/2017 Example 12.1 Find the constant function that is the least squares fit to the following data x 0 1 2 3 f(x) 1 0 1 2 Solution c = 1 c = 0 f (x)

More information

Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule

Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule SPhT-T04/33 Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule P. Di Francesco # and P. Zinn-Justin We prove that the sum of entries of the suitably normalized groundstate vector

More information

David M. Bressoud Macalester College, St. Paul, MN Talk given MAA KY section March 28, 2008

David M. Bressoud Macalester College, St. Paul, MN Talk given MAA KY section March 28, 2008 David M. Bressoud Macalester College, St. Paul, MN Talk given MAA KY section March 28, 2008 We mathematicians often delude ourselves into thinking that we create proofs in order to establish truth. In

More information

Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule

Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule SPhT-T04/33 Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule arxiv:math-ph/04006v4 7 Mar 2006 P. Di Francesco Service de Physique Théorique de Saclay, CEA/DSM/SPhT, URA 2306

More information

TEST CODE: PMB SYLLABUS

TEST CODE: PMB SYLLABUS TEST CODE: PMB SYLLABUS Convergence and divergence of sequence and series; Cauchy sequence and completeness; Bolzano-Weierstrass theorem; continuity, uniform continuity, differentiability; directional

More information

CPSC 536N: Randomized Algorithms Term 2. Lecture 9

CPSC 536N: Randomized Algorithms Term 2. Lecture 9 CPSC 536N: Randomized Algorithms 2011-12 Term 2 Prof. Nick Harvey Lecture 9 University of British Columbia 1 Polynomial Identity Testing In the first lecture we discussed the problem of testing equality

More information

Latin square determinants and permanents Ken Johnson Penn State Abington College (Joint work with D. Donovan and I. Wanless)

Latin square determinants and permanents Ken Johnson Penn State Abington College (Joint work with D. Donovan and I. Wanless) Latin square determinants and permanents Ken Johnson Penn State Abington College (Joint work with D. Donovan and I. Wanless) Outline 1)The basic idea 2) Motivation 3) Summary of the group case 4) Results

More information

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on

More information

A class of trees and its Wiener index.

A class of trees and its Wiener index. A class of trees and its Wiener index. Stephan G. Wagner Department of Mathematics Graz University of Technology Steyrergasse 3, A-81 Graz, Austria wagner@finanz.math.tu-graz.ac.at Abstract In this paper,

More information

Ma/CS 6b Class 23: Eigenvalues in Regular Graphs

Ma/CS 6b Class 23: Eigenvalues in Regular Graphs Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues

More information

LB 220 Homework 4 Solutions

LB 220 Homework 4 Solutions LB 220 Homework 4 Solutions Section 11.4, # 40: This problem was solved in class on Feb. 03. Section 11.4, # 42: This problem was also solved in class on Feb. 03. Section 11.4, # 43: Also solved in class

More information

q xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.

q xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation. Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both

More information

18.S34 linear algebra problems (2007)

18.S34 linear algebra problems (2007) 18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction

More information

4. Determinants.

4. Determinants. 4. Determinants 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 2 2 determinant 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 3 3 determinant 4.1.

More information

Problem Set 2 Due Thursday, October 1, & & & & # % (b) Construct a representation using five d orbitals that sit on the origin as a basis:

Problem Set 2 Due Thursday, October 1, & & & & # % (b) Construct a representation using five d orbitals that sit on the origin as a basis: Problem Set 2 Due Thursday, October 1, 29 Problems from Cotton: Chapter 4: 4.6, 4.7; Chapter 6: 6.2, 6.4, 6.5 Additional problems: (1) Consider the D 3h point group and use a coordinate system wherein

More information

The Interlace Polynomial of Graphs at 1

The Interlace Polynomial of Graphs at 1 The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we

More information

Hamiltonian partial differential equations and Painlevé transcendents

Hamiltonian partial differential equations and Painlevé transcendents The 6th TIMS-OCAMI-WASEDA Joint International Workshop on Integrable Systems and Mathematical Physics March 22-26, 2014 Hamiltonian partial differential equations and Painlevé transcendents Boris DUBROVIN

More information

EXERCISES IN MODULAR FORMS I (MATH 726) (2) Prove that a lattice L is integral if and only if its Gram matrix has integer coefficients.

EXERCISES IN MODULAR FORMS I (MATH 726) (2) Prove that a lattice L is integral if and only if its Gram matrix has integer coefficients. EXERCISES IN MODULAR FORMS I (MATH 726) EYAL GOREN, MCGILL UNIVERSITY, FALL 2007 (1) We define a (full) lattice L in R n to be a discrete subgroup of R n that contains a basis for R n. Prove that L is

More information

arxiv:hep-th/ v1 13 Feb 2006

arxiv:hep-th/ v1 13 Feb 2006 The eight-vertex model and Painlevé VI V V Bazhanov, V V Mangazeev Department of Theoretical Physics, Research School of Physical Sciences and Engineering, Australian National University, Canberra, ACT

More information

Latin squares: Equivalents and equivalence

Latin squares: Equivalents and equivalence Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to

More information

18.312: Algebraic Combinatorics Lionel Levine. Lecture 19

18.312: Algebraic Combinatorics Lionel Levine. Lecture 19 832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,

More information

Rambo s Math GRE Practice Test. Charles Rambo

Rambo s Math GRE Practice Test. Charles Rambo Rambo s Math GRE Practice Test Charles Rambo Preface Thank you for checking out my practice exam! This was heavily influenced by the GR1268, GR0568, and GR8767 exams. I also used Rudin s Principles of

More information

Factorial Schur functions via the six vertex model

Factorial Schur functions via the six vertex model Factorial Schur functions via the six vertex model Peter J. McNamara Department of Mathematics Massachusetts Institute of Technology, MA 02139, USA petermc@math.mit.edu October 31, 2009 Abstract For a

More information

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column

More information

STABLE CLUSTER VARIABLES

STABLE CLUSTER VARIABLES STABLE CLUSTER VARIABLES GRACE ZHANG Abstract. Eager and Franco introduced a transformation on the F-polynomials of Fomin and Zelevinsky that seems to display a surprising stabilization property in the

More information

Sydney University Mathematical Society Problems Competition Solutions.

Sydney University Mathematical Society Problems Competition Solutions. Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed

More information

TEST CODE: MMA (Objective type) 2015 SYLLABUS

TEST CODE: MMA (Objective type) 2015 SYLLABUS TEST CODE: MMA (Objective type) 2015 SYLLABUS Analytical Reasoning Algebra Arithmetic, geometric and harmonic progression. Continued fractions. Elementary combinatorics: Permutations and combinations,

More information

The Free Central Limit Theorem: A Combinatorial Approach

The Free Central Limit Theorem: A Combinatorial Approach The Free Central Limit Theorem: A Combinatorial Approach by Dennis Stauffer A project submitted to the Department of Mathematical Sciences in conformity with the requirements for Math 4301 (Honour s Seminar)

More information

Probabilistic construction of t-designs over finite fields

Probabilistic construction of t-designs over finite fields Probabilistic construction of t-designs over finite fields Shachar Lovett (UCSD) Based on joint works with Arman Fazeli (UCSD), Greg Kuperberg (UC Davis), Ron Peled (Tel Aviv) and Alex Vardy (UCSD) Gent

More information

Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule

Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule P. Di Francesco Service de Physique Théorique de Saclay, CEA/DSM/SPhT, URA 2306 du CNRS C.E.A.-Saclay, F-91191 Gif sur Yvette

More information

The Matrix-Tree Theorem

The Matrix-Tree Theorem The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries

More information

Irrationality proofs, moduli spaces, and dinner parties

Irrationality proofs, moduli spaces, and dinner parties Irrationality proofs, moduli spaces, and dinner parties Francis Brown, IHÉS-CNRS las, Members Colloquium 17th October 2014 1 / 32 Part I History 2 / 32 Zeta values and Euler s theorem Recall the Riemann

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has

More information

Several refined conjectures on TSSCPP and ASM

Several refined conjectures on TSSCPP and ASM 0-0 Several refined conjectures on TSSCPP and ASM Masao Ishikawa Tottori University, ishikawa@fed.tottori-u.ac.jp 1 Contents of this talk 1. Preliminaries (a) Partitions (b) Symmetric functions (c) Alternating

More information

Poset and Polytope Perspectives On Alternating Sign Matrices

Poset and Polytope Perspectives On Alternating Sign Matrices Poset and Polytope Perspectives On Alternating Sign Matrices A DISSERTATION SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Jessica Palencia Striker IN PARTIAL FULFILLMENT

More information

Laplacians of Graphs, Spectra and Laplacian polynomials

Laplacians of Graphs, Spectra and Laplacian polynomials Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial

More information

Trigonometric SOS model with DWBC and spin chains with non-diagonal boundaries

Trigonometric SOS model with DWBC and spin chains with non-diagonal boundaries Trigonometric SOS model with DWBC and spin chains with non-diagonal boundaries N. Kitanine IMB, Université de Bourgogne. In collaboration with: G. Filali RAQIS 21, Annecy June 15 - June 19, 21 Typeset

More information

Congruence sheaves and congruence differential equations Beyond hypergeometric functions

Congruence sheaves and congruence differential equations Beyond hypergeometric functions Congruence sheaves and congruence differential equations Beyond hypergeometric functions Vasily Golyshev Lille, March 6, 204 / 45 Plan of talk Report on joint work in progress with Anton Mellit and Duco

More information

Spanning Trees in Grid Graphs

Spanning Trees in Grid Graphs Spanning Trees in Grid Graphs Paul Raff arxiv:0809.2551v1 [math.co] 15 Sep 2008 July 25, 2008 Abstract A general method is obtained for finding recurrences involving the number of spanning trees of grid

More information

Definition: A binary relation R from a set A to a set B is a subset R A B. Example:

Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.

More information

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on

More information

25. Chain Rule. Now, f is a function of t only. Expand by multiplication:

25. Chain Rule. Now, f is a function of t only. Expand by multiplication: 25. Chain Rule The Chain Rule is present in all differentiation. If z = f(x, y) represents a two-variable function, then it is plausible to consider the cases when x and y may be functions of other variable(s).

More information

An old new class of meromorphic functions. Norbert Steinmetz. June 13, 2015

An old new class of meromorphic functions. Norbert Steinmetz. June 13, 2015 Norbert Steinmetz June 13, 2015 NEW & OLD NEW: Hamiltonian system p = H q = q 2 zp α q = H p = p 2 + zq + β with Hamiltonian H(z, p, q) = 1 3 (p3 + q 3 ) + zpq + αq + βp OLD: Almost Painlevé IV 2ww = w

More information

PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS

PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS GEORGE E. ANDREWS, MATTHIAS BECK, AND NEVILLE ROBBINS Abstract. We study the number p(n, t) of partitions of n with difference t between

More information

Φ + θ = {φ + θ : φ Φ}

Φ + θ = {φ + θ : φ Φ} 74 3.7 Cyclic designs Let Θ Z t. For Φ Θ, a translate of Φ is a set of the form Φ + θ {φ + θ : φ Φ} for some θ in Θ. Of course, Φ is a translate of itself. It is possible to have Φ + θ 1 Φ + θ 2 even when

More information

A conjecture on the alphabet size needed to produce all correlation classes of pairs of words

A conjecture on the alphabet size needed to produce all correlation classes of pairs of words A conjecture on the alphabet size needed to produce all correlation classes of pairs of words Paul Leopardi Thanks: Jörg Arndt, Michael Barnsley, Richard Brent, Sylvain Forêt, Judy-anne Osborn. Mathematical

More information

Eigenvalues, random walks and Ramanujan graphs

Eigenvalues, random walks and Ramanujan graphs Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,

More information

A Simplicial matrix-tree theorem, II. Examples

A Simplicial matrix-tree theorem, II. Examples Art Duval 1 Caroline Klivans 2 Jeremy Martin 3 1 University of Texas at El Paso 2 University of Chicago 3 University of Kansas AMS Central Section Meeting Special Session on Geometric Combinatorics DePaul

More information

Organization Team Team ID#

Organization Team Team ID# 1. [4] A random number generator will always output 7. Sam uses this random number generator once. What is the expected value of the output? 2. [4] Let A, B, C, D, E, F be 6 points on a circle in that

More information

An alternative evaluation. of the Andrews{Burge determinant. C. Krattenthaler y. Dedicated to Gian-Carlo Rota

An alternative evaluation. of the Andrews{Burge determinant. C. Krattenthaler y. Dedicated to Gian-Carlo Rota An alternative evaluation of the Andrews{Burge determinant C. Krattenthaler y Dedicated to Gian-Carlo Rota Abstract. We give a short, self-contained evaluation of the Andrews{Burge determinant (Pacic J.

More information

Mahler measure and special values of L-functions

Mahler measure and special values of L-functions Mahler measure and special values of L-functions Matilde N. Laĺın University of Alberta mlalin@math.ualberta.ca http://www.math.ualberta.ca/~mlalin October 24, 2008 Matilde N. Laĺın (U of A) Mahler measure

More information

LECTURE 5, FRIDAY

LECTURE 5, FRIDAY LECTURE 5, FRIDAY 20.02.04 FRANZ LEMMERMEYER Before we start with the arithmetic of elliptic curves, let us talk a little bit about multiplicities, tangents, and singular points. 1. Tangents How do we

More information

A = u + V. u + (0) = u

A = u + V. u + (0) = u Recall: Last time we defined an affine subset of R n to be a subset of the form A = u + V = {u + v u R n,v V } where V is a subspace of R n We said that we would use the notation A = {u,v } to indicate

More information

Problem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that

Problem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume

More information

U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018

U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 Lecture 3 In which we show how to find a planted clique in a random graph. 1 Finding a Planted Clique We will analyze

More information

Siegel s theorem, edge coloring, and a holant dichotomy

Siegel s theorem, edge coloring, and a holant dichotomy Siegel s theorem, edge coloring, and a holant dichotomy Tyson Williams (University of Wisconsin-Madison) Joint with: Jin-Yi Cai and Heng Guo (University of Wisconsin-Madison) Appeared at FOCS 2014 1 /

More information

The 3rd Olympiad of Metropolises

The 3rd Olympiad of Metropolises The 3rd Olympiad of Metropolises Day 1. Solutions Problem 1. Solve the system of equations in real numbers: (x 1)(y 1)(z 1) xyz 1, Answer: x 1, y 1, z 1. (x )(y )(z ) xyz. (Vladimir Bragin) Solution 1.

More information

Team Solutions. November 19, qr = (m + 2)(m 2)

Team Solutions. November 19, qr = (m + 2)(m 2) Team s November 19, 2017 1. Let p, q, r, and s be four distinct primes such that p + q + r + s is prime, and the numbers p 2 + qr and p 2 + qs are both perfect squares. What is the value of p + q + r +

More information

A MARKOV CHAIN ON THE SYMMETRIC GROUP WHICH IS SCHUBERT POSITIVE?

A MARKOV CHAIN ON THE SYMMETRIC GROUP WHICH IS SCHUBERT POSITIVE? A MARKOV CHAIN ON THE SYMMETRIC GROUP WHICH IS SCHUBERT POSITIVE? THOMAS LAM AND LAUREN WILLIAMS Abstract. We study a multivariate Markov chain on the symmetric group with remarkable enumerative properties.

More information

NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION

NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION 011-1 DISCRETE MATHEMATICS (EOE 038) 1. UNIT I (SET, RELATION,

More information

SYMMETRIES IN THE FOURTH PAINLEVÉ EQUATION AND OKAMOTO POLYNOMIALS

SYMMETRIES IN THE FOURTH PAINLEVÉ EQUATION AND OKAMOTO POLYNOMIALS M. Noumi and Y. Yamada Nagoya Math. J. Vol. 153 (1999), 53 86 SYMMETRIES IN THE FOURTH PAINLEVÉ EQUATION AND OKAMOTO POLYNOMIALS MASATOSHI NOUMI and YASUHIKO YAMADA Abstract. The fourth Painlevé equation

More information

Notes on Linear Algebra and Matrix Theory

Notes on Linear Algebra and Matrix Theory Massimo Franceschet featuring Enrico Bozzo Scalar product The scalar product (a.k.a. dot product or inner product) of two real vectors x = (x 1,..., x n ) and y = (y 1,..., y n ) is not a vector but a

More information

Group Actions Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying:

Group Actions Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying: Group Actions 8-26-202 Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying: (a) θ(g,θ(g 2,x)) = θ(g g 2,x) for all g,g 2 G and x X. (b) θ(,x) =

More information

Dimension. Eigenvalue and eigenvector

Dimension. Eigenvalue and eigenvector Dimension. Eigenvalue and eigenvector Math 112, week 9 Goals: Bases, dimension, rank-nullity theorem. Eigenvalue and eigenvector. Suggested Textbook Readings: Sections 4.5, 4.6, 5.1, 5.2 Week 9: Dimension,

More information

Spectra of Semidirect Products of Cyclic Groups

Spectra of Semidirect Products of Cyclic Groups Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with

More information

Qualifying Exams I, 2014 Spring

Qualifying Exams I, 2014 Spring Qualifying Exams I, 2014 Spring 1. (Algebra) Let k = F q be a finite field with q elements. Count the number of monic irreducible polynomials of degree 12 over k. 2. (Algebraic Geometry) (a) Show that

More information

Lectures 2 3 : Wigner s semicircle law

Lectures 2 3 : Wigner s semicircle law Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j= be a symmetric n n matrix with Random entries

More information