Smith Normal Form and Combinatorics
|
|
- Jeffery Shelton
- 5 years ago
- Views:
Transcription
1 Smith Normal Form and Combinatorics Richard P. Stanley June 8, 2017
2 Smith normal form A: n n matrix over commutative ring R (with 1) Suppose there exist P,Q GL(n,R) such that PAQ := B = diag(d 1,d 1 d 2,...,d 1 d 2 d n ), where d i R. We then call B a Smith normal form (SNF) of A.
3 Smith normal form A: n n matrix over commutative ring R (with 1) Suppose there exist P,Q GL(n,R) such that PAQ := B = diag(d 1,d 1 d 2,...,d 1 d 2 d n ), where d i R. We then call B a Smith normal form (SNF) of A. Note. (1) Can extend to m n. (2) unit det(a) = det(b) = d n 1 dn 1 2 d n. Thus SNF is a refinement of det.
4 Who is Smith? Henry John Stephen Smith
5 Who is Smith? Henry John Stephen Smith born 2 November 1826 in Dublin, Ireland
6 Who is Smith? Henry John Stephen Smith born 2 November 1826 in Dublin, Ireland educated at Oxford University (England)
7 Who is Smith? Henry John Stephen Smith born 2 November 1826 in Dublin, Ireland educated at Oxford University (England) remained at Oxford throughout his career
8 Who is Smith? Henry John Stephen Smith born 2 November 1826 in Dublin, Ireland educated at Oxford University (England) remained at Oxford throughout his career twice president of London Mathematical Society
9 Who is Smith? Henry John Stephen Smith born 2 November 1826 in Dublin, Ireland educated at Oxford University (England) remained at Oxford throughout his career twice president of London Mathematical Society 1861: SNF paper in Phil. Trans. R. Soc. London
10 Who is Smith? Henry John Stephen Smith born 2 November 1826 in Dublin, Ireland educated at Oxford University (England) remained at Oxford throughout his career twice president of London Mathematical Society 1861: SNF paper in Phil. Trans. R. Soc. London 1868: Steiner Prize of Royal Academy of Sciences of Berlin
11 Who is Smith? Henry John Stephen Smith born 2 November 1826 in Dublin, Ireland educated at Oxford University (England) remained at Oxford throughout his career twice president of London Mathematical Society 1861: SNF paper in Phil. Trans. R. Soc. London 1868: Steiner Prize of Royal Academy of Sciences of Berlin died 9 February 1883 (age 56)
12 Who is Smith? Henry John Stephen Smith born 2 November 1826 in Dublin, Ireland educated at Oxford University (England) remained at Oxford throughout his career twice president of London Mathematical Society 1861: SNF paper in Phil. Trans. R. Soc. London 1868: Steiner Prize of Royal Academy of Sciences of Berlin died 9 February 1883 (age 56) April 1883: shared Grand prix des sciences mathématiques with Minkowski
13
14 Row and column operations Can put a matrix into SNF by the following operations. Add a multiple of a row to another row. Add a multiple of a column to another column. Multiply a row or column by a unit in R.
15 Row and column operations Can put a matrix into SNF by the following operations. Add a multiple of a row to another row. Add a multiple of a column to another column. Multiply a row or column by a unit in R. Over a field, SNF is row reduced echelon form (with all unit entries equal to 1).
16 Existence of SNF PIR: principal ideal ring, e.g., Z, K[x], Z/mZ. Theorem (Smith, for Z). If R is a PIR then A has a unique SNF up to units.
17 Existence of SNF PIR: principal ideal ring, e.g., Z, K[x], Z/mZ. Theorem (Smith, for Z). If R is a PIR then A has a unique SNF up to units. Otherwise A typically does not have a SNF but may have one in special cases.
18 Algebraic interpretation of SNF R: a PID A: an n n matrix over R with rows v 1,...,v n R n diag(e 1,e 2,...,e n ): SNF of A
19 Algebraic interpretation of SNF R: a PID A: an n n matrix over R with rows v 1,...,v n R n diag(e 1,e 2,...,e n ): SNF of A Theorem. R n /(v 1,...,v n ) = (R/e 1 R) (R/e n R).
20 Algebraic interpretation of SNF R: a PID A: an n n matrix over R with rows v 1,...,v n R n diag(e 1,e 2,...,e n ): SNF of A Theorem. R n /(v 1,...,v n ) = (R/e 1 R) (R/e n R). R n /(v 1,...,v n ): (Kasteleyn) cokernel of A
21 An explicit formula for SNF R: a PID A: an n n matrix over R with det(a) 0 diag(e 1,e 2,...,e n ): SNF of A
22 An explicit formula for SNF R: a PID A: an n n matrix over R with det(a) 0 diag(e 1,e 2,...,e n ): SNF of A Theorem. e 1 e 2 e i is the gcd of all i i minors of A. minor: determinant of a square submatrix
23 An explicit formula for SNF R: a PID A: an n n matrix over R with det(a) 0 diag(e 1,e 2,...,e n ): SNF of A Theorem. e 1 e 2 e i is the gcd of all i i minors of A. minor: determinant of a square submatrix Special case: e 1 is the gcd of all entries of A.
24 Laplacian matrices L(G): Laplacian matrix of the graph G rows and columns indexed by vertices of G { #(edges uv), u v L(G) uv = deg(u), u = v.
25 Laplacian matrices L(G): Laplacian matrix of the graph G rows and columns indexed by vertices of G { #(edges uv), u v L(G) uv = deg(u), u = v. reduced Laplacian matrix L 0 (G): for some vertex v, remove from L(G) the row and column indexed by v
26 Matrix-tree theorem Matrix-tree theorem. detl 0 (G) = κ(g), the number of spanning trees of G.
27 Matrix-tree theorem Matrix-tree theorem. detl 0 (G) = κ(g), the number of spanning trees of G. In general, SNF of L 0 (G) not understood.
28 Matrix-tree theorem Matrix-tree theorem. detl 0 (G) = κ(g), the number of spanning trees of G. In general, SNF of L 0 (G) not understood. L 0 (G) snf diag(e 1,...,e n 1 ) L(G) snf diag(e 1,...,e n 1,0)
29 Matrix-tree theorem Matrix-tree theorem. detl 0 (G) = κ(g), the number of spanning trees of G. In general, SNF of L 0 (G) not understood. L 0 (G) snf diag(e 1,...,e n 1 ) L(G) snf diag(e 1,...,e n 1,0) Applications to sandpile models, chip firing, etc.
30 An example Reduced Laplacian matrix of K 4 : A =
31 An example Reduced Laplacian matrix of K 4 : A = Matrix-tree theorem = det(a) = 16, the number of spanning trees of K 4.
32 An example Reduced Laplacian matrix of K 4 : A = Matrix-tree theorem = det(a) = 16, the number of spanning trees of K 4. What about SNF?
33 An example (continued)
34 Reduced Laplacian matrix of K n L 0 (K n ) = ni n 1 J n 1 detl 0 (K n ) = n n 2
35 Reduced Laplacian matrix of K n L 0 (K n ) = ni n 1 J n 1 detl 0 (K n ) = n n 2 Theorem. L 0 (K n ) SNF diag(1,n,n,...,n), a refinement of Cayley s theorem that κ(k n ) = n n 2.
36 Proof that L 0 (K n ) SNF diag(1, n, n,...,n) Trick: 2 2 submatrices (up to row and column permutations): [ n n 1 ], [ n ], [ with determinants n(n 2), n, and 0. Hence e 1 e 2 = n. Since ei = n n 2 and e i e i+1, we get the SNF diag(1,n,n,...,n). ],
37 Chip firing Abelian sandpile: a finite collection σ of indistinguishable chips distributed among the vertices V of a (finite) connected graph. Equivalently, σ: V {0,1,2,...}.
38 Chip firing Abelian sandpile: a finite collection σ of indistinguishable chips distributed among the vertices V of a (finite) connected graph. Equivalently, σ: V {0,1,2,...}. toppling of a vertex v: if σ(v) deg(v), then send a chip to each neighboring vertex
39 The sandpile group Choose a vertex to be a sink, and ignore chips falling into the sink. stable configuration: no vertex can topple Theorem (easy). After finitely many topples a stable configuration will be reached, which is independent of the order of topples.
40 The monoid of stable configurations Define a commutative monoid M on the stable configurations by vertex-wise addition followed by stabilization. ideal of M: subset J M satisfying σj J for all σ M
41 The monoid of stable configurations Define a commutative monoid M on the stable configurations by vertex-wise addition followed by stabilization. ideal of M: subset J M satisfying σj J for all σ M Exercise. The (unique) minimal ideal of a finite commutative monoid is a group.
42 Sandpile group sandpile group of G: the minimal ideal K(G) of the monoid M Fact. K(G) is independent of the choice of sink up to isomorphism.
43 Sandpile group sandpile group of G: the minimal ideal K(G) of the monoid M Fact. K(G) is independent of the choice of sink up to isomorphism. Theorem. Let L 0 (G) SNF diag(e 1,...,e n 1 ). Then K(G) = Z/e 1 Z Z/e n 1 Z.
44 The n-cube C n : graph of the n-cube
45 The n-cube C n : graph of the n-cube
46 The 4-cube
47 The 4-cube
48 The 4-cube C 4
49 An open problem n κ(c n ) = 2 2n n 1 i (n i) i=1
50 An open problem κ(c n ) = 2 2n n 1 n i (n i) Easy to prove by linear algebra; combinatorial (but not bijective) proof by O. Bernardi, i=1
51 An open problem κ(c n ) = 2 2n n 1 n i (n i) Easy to prove by linear algebra; combinatorial (but not bijective) proof by O. Bernardi, p-sylow subgroup of K(C n ) known for all odd primes p (Hua Bai, 2003) i=1
52 An open problem κ(c n ) = 2 2n n 1 n i (n i) Easy to prove by linear algebra; combinatorial (but not bijective) proof by O. Bernardi, p-sylow subgroup of K(C n ) known for all odd primes p (Hua Bai, 2003) i=1 2-Sylow subgroup of K(C n ) is unknown.
53 SNF of random matrices Huge literature on random matrices, mostly connected with eigenvalues. Very little work on SNF of random matrices over a PID.
54 Is the question interesting? Mat k (n): all n n Z-matrices with entries in [ k,k] (uniform distribution) p k (n, d): probability that if M Mat k (n) and SNF(M) = (e 1,...,e n ), then e 1 = d.
55 Is the question interesting? Mat k (n): all n n Z-matrices with entries in [ k,k] (uniform distribution) p k (n, d): probability that if M Mat k (n) and SNF(M) = (e 1,...,e n ), then e 1 = d. Recall: e 1 = gcd of 1 1 minors (entries) of M
56 Is the question interesting? Mat k (n): all n n Z-matrices with entries in [ k,k] (uniform distribution) p k (n, d): probability that if M Mat k (n) and SNF(M) = (e 1,...,e n ), then e 1 = d. Recall: e 1 = gcd of 1 1 minors (entries) of M Theorem. lim k p k (n,d) = 1 d n2 ζ(n 2 )
57 Specifying some e i with Yinghui Wang
58 Specifying some e i with Yinghui Wang ( )
59 Specifying some e i with Yinghui Wang ( ) Two general results. Let α 1,...,α n 1 P, α i α i+1. µ k (n): probability that the SNF of a random A Mat k (n) satisfies e i = α i for 1 α i n 1. µ(n) = lim k µ k(n). Then µ(n) exists, and 0 < µ(n) < 1.
60 Second result Let α n P. ν k (n): probability that the SNF of a random A Mat k (n) satisfies e n = α n. Then lim ν k(n) = 0. k
61 Sample result µ k (n): probability that the SNF of a random A Mat k (n) satisfies e 1 = 2, e 2 = 6. µ(n) = lim k µ k(n).
62 Conclusion µ(n) = 2 n2 1 n(n 1) i=(n 1) 2 2 i + n 2 1 i=n(n 1) (n 1)2 (1 3 (n 1)2 )(1 3 n ) 2 n(n 1) n p i + p>3 i=(n 1) 2 i=n(n 1)+1 2 i p i.
63 Cyclic cokernel κ(n): probability that an n n Z-matrix has SNF diag(e 1,e 2,...,e n ) with e 1 = e 2 = = e n 1 = 1
64 Cyclic cokernel κ(n): probability that an n n Z-matrix has SNF diag(e 1,e 2,...,e n ) with e 1 = e 2 = = e n 1 = 1 (1+ 1p 2 + 1p p ) n Theorem. κ(n) = p ζ(2)ζ(3)
65 Cyclic cokernel κ(n): probability that an n n Z-matrix has SNF diag(e 1,e 2,...,e n ) with e 1 = e 2 = = e n 1 = 1 (1+ 1p 2 + 1p p ) n Theorem. κ(n) = p ζ(2)ζ(3) Corollary. lim κ(n) = 1 n ζ(6) j 4 ζ(j)
66 Small number of generators g: number of generators of cokernel (number of entries of SNF 1) as n previous slide: Prob(g = 1) =
67 Small number of generators g: number of generators of cokernel (number of entries of SNF 1) as n previous slide: Prob(g = 1) = Prob(g 2) =
68 Small number of generators g: number of generators of cokernel (number of entries of SNF 1) as n previous slide: Prob(g = 1) = Prob(g 2) = Prob(g 3) =
69 Small number of generators g: number of generators of cokernel (number of entries of SNF 1) as n previous slide: Prob(g = 1) = Prob(g 2) = Prob(g 3) = Theorem. Prob(g l) = 1 ( )2 (l+1)2 (1+O(2 l ))
70 Small number of generators g: number of generators of cokernel (number of entries of SNF 1) as n previous slide: Prob(g = 1) = Prob(g 2) = Prob(g 3) = Theorem. Prob(g l) = 1 ( )2 (l+1)2 (1+O(2 l ))
71 = 1 (1 12 ) j j 1
72 Example of SNF computation λ: a partition (λ 1,λ 2,...), identified with its Young diagram (3,1)
73 Example of SNF computation λ: a partition (λ 1,λ 2,...), identified with its Young diagram (3,1) λ : λ extended by a border strip along its entire boundary
74 Example of SNF computation λ: a partition (λ 1,λ 2,...), identified with its Young diagram (3,1) λ : λ extended by a border strip along its entire boundary (3,1)* = (4,4,2)
75 Initialization Insert 1 into each square of λ /λ (3,1)* = (4,4,2)
76 M t Let t λ. Let M t be the largest square of λ with t as the upper left-hand corner.
77 M t Let t λ. Let M t be the largest square of λ with t as the upper left-hand corner. t
78 M t Let t λ. Let M t be the largest square of λ with t as the upper left-hand corner. t
79 Determinantal algorithm Suppose all squares to the southeast of t have been filled. Insert into t the number n t so that detm t = 1.
80 Determinantal algorithm Suppose all squares to the southeast of t have been filled. Insert into t the number n t so that detm t =
81 Determinantal algorithm Suppose all squares to the southeast of t have been filled. Insert into t the number n t so that detm t =
82 Determinantal algorithm Suppose all squares to the southeast of t have been filled. Insert into t the number n t so that detm t =
83 Determinantal algorithm Suppose all squares to the southeast of t have been filled. Insert into t the number n t so that detm t =
84 Determinantal algorithm Suppose all squares to the southeast of t have been filled. Insert into t the number n t so that detm t =
85 Determinantal algorithm Suppose all squares to the southeast of t have been filled. Insert into t the number n t so that detm t =
86 Uniqueness Easy to see: the numbers n t are well-defined and unique.
87 Uniqueness Easy to see: the numbers n t are well-defined and unique. Why? Expand detm t by the first row. The coefficient of n t is 1 by induction.
88 λ(t) If t λ, let λ(t) consist of all squares of λ to the southeast of t.
89 λ(t) If t λ, let λ(t) consist of all squares of λ to the southeast of t. t λ = (4,4,3)
90 λ(t) If t λ, let λ(t) consist of all squares of λ to the southeast of t. t λ = (4,4,3) λ( t ) = (3,2)
91 u λ u λ = #{µ : µ λ}
92 u λ u λ = #{µ : µ λ} Example. u (2,1) = 5: φ
93 u λ u λ = #{µ : µ λ} Example. u (2,1) = 5: φ There is a determinantal formula for u λ, due essentially to MacMahon and later Kreweras (not needed here).
94 Carlitz-Scoville-Roselle theorem Berlekamp (1963) first asked for n t (mod 2) in connection with a coding theory problem. Carlitz-Roselle-Scoville (1971): combinatorial interpretation of n t (over Z).
95 Carlitz-Scoville-Roselle theorem Berlekamp (1963) first asked for n t (mod 2) in connection with a coding theory problem. Carlitz-Roselle-Scoville (1971): combinatorial interpretation of n t (over Z). Theorem. n t = u λ(t)
96 Carlitz-Scoville-Roselle theorem Berlekamp (1963) first asked for n t (mod 2) in connection with a coding theory problem. Carlitz-Roselle-Scoville (1971): combinatorial interpretation of n t (over Z). Theorem. n t = u λ(t) Proofs. 1. Induction (row and column operations). 2. Nonintersecting lattice paths.
97 An example
98 An example φ
99 A q-analogue Weight each µ λ by q λ/µ.
100 A q-analogue Weight each µ λ by q λ/µ. λ = 64431, µ = 42211, q λ/µ = q 8
101 u λ (q) u λ (q) = µ λ q λ/µ u (2,1) (q) = 1+2q +q 2 +q 3 :
102 Diagonal hooks d i (λ) = λ i +λ i 2i +1 d 1 = 9, d 2 = 4, d 3 = 1
103 Main result (with C. Bessenrodt) Theorem. M t has an SNF over Z[q]. Write d i = d i (λ t ). If M t is a (k +1) (k +1) matrix then M t has SNF diag(1,q d k,q d k 1+d k,...,q d 1+d 2 + +d k ).
104 Main result (with C. Bessenrodt) Theorem. M t has an SNF over Z[q]. Write d i = d i (λ t ). If M t is a (k +1) (k +1) matrix then M t has SNF diag(1,q d k,q d k 1+d k,...,q d 1+d 2 + +d k ). Corollary. detm t = q id i.
105 Main result (with C. Bessenrodt) Theorem. M t has an SNF over Z[q]. Write d i = d i (λ t ). If M t is a (k +1) (k +1) matrix then M t has SNF diag(1,q d k,q d k 1+d k,...,q d 1+d 2 + +d k ). Corollary. detm t = q id i. Note. There is a multivariate generalization.
106 An example t λ = 6431, d 1 = 9, d 2 = 4, d 3 = 1
107 An example t λ = 6431, d 1 = 9, d 2 = 4, d 3 = 1 SNF of M t : (1,q,q 5,q 14 )
108 A special case Let λ be the staircase δ n = (n 1,n 2,...,1).
109 A special case Let λ be the staircase δ n = (n 1,n 2,...,1). u δn 1 (q) counts Dyck paths of length 2n by (scaled) area, and is thus the well-known q-analogue C n (q) of the Catalan number C n.
110 A q-catalan example C 3 (q) = q 3 +q 2 +2q +1
111 A q-catalan example C 4 (q) C 3 (q) 1+q C 3 (q) 1+q 1 1+q 1 1 since d 1 (3,2,1) = 1, d 2 (3,2,1) = 5. C 3 (q) = q 3 +q 2 +2q +1 SNF diag(1,q,q 6 )
112 A q-catalan example C 4 (q) C 3 (q) 1+q C 3 (q) 1+q 1 1+q 1 1 since d 1 (3,2,1) = 1, d 2 (3,2,1) = 5. C 3 (q) = q 3 +q 2 +2q +1 q-catalan determinant previously known SNF is new SNF diag(1,q,q 6 )
113 Ramanujan F(q, x) := n 0 C n (q)x n = x qx 1 q2 x 1
114 Ramanujan F(q, x) := n 0 C n (q)x n = x qx 1 q2 x 1 e 2π/5 F(e 2π, e 2π ) =
115 An open problem l(w): length (number of inversions) of w = a 1 a n S n, i.e., l(w) = #{(i,j) : i < j, w i > w j }. V(n): the n! n! matrix with rows and columns indexed by w S n, and V(n) uv = q l(uv 1).
116 n = 3 det 1 q q q 2 q 2 q 3 q 1 q 2 q q 3 q 2 q q 2 1 q 3 q q 2 q 2 q q 3 1 q 2 q q 2 q 3 q q 2 1 q q 3 q 2 q 2 q q 1 = (1 q 2 ) 6 (1 q 6 )
117 n = 3 det 1 q q q 2 q 2 q 3 q 1 q 2 q q 3 q 2 q q 2 1 q 3 q q 2 q 2 q q 3 1 q 2 q q 2 q 3 q q 2 1 q q 3 q 2 q 2 q q 1 = (1 q 2 ) 6 (1 q 6 ) V(3) snf diag(1,1 q 2,1 q 2,1 q 2,(1 q 2 ) 2,(1 q 2 )(1 q 6 ))
118 n = 3 det 1 q q q 2 q 2 q 3 q 1 q 2 q q 3 q 2 q q 2 1 q 3 q q 2 q 2 q q 3 1 q 2 q q 2 q 3 q q 2 1 q q 3 q 2 q 2 q q 1 = (1 q 2 ) 6 (1 q 6 ) V(3) snf diag(1,1 q 2,1 q 2,1 q 2,(1 q 2 ) 2,(1 q 2 )(1 q 6 )) special case of q-varchenko matrix of a real hyperplane arrangment
119 Zagier s theorem Theorem (D. Zagier, 1992) n detv(n) = (1 q j(j 1)) ( n j)(j 2)!(n j+1)! j=2
120 Zagier s theorem Theorem (D. Zagier, 1992) detv(n) = n (1 q j(j 1)) ( n j)(j 2)!(n j+1)! j=2 SNF is open. Partial result: Theorem (Denham-Hanlon, 1997) Let V(n) snf diag(e 1,e 2,...,e n! ). The number of e i s exactly divisible by (q 1) j (or by (q 2 1) j ) is the number c(n,n j) of w S n with n j cycles (signless Stirling number of the first kind).
121 The last slide
122 The last slide
123 The last slide
Smith Normal Form and Combinatorics
Smith Normal Form and Combinatorics p. 1 Smith Normal Form and Combinatorics Richard P. Stanley Smith Normal Form and Combinatorics p. 2 Smith normal form A: n n matrix over commutative ring R (with 1)
More informationThe 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 informationSMITH NORMAL FORM OF A MULTIVARIATE MATRIX ASSOCIATED WITH PARTITIONS
SMITH NORMAL FORM OF A MULTIVARIATE MATRIX ASSOCIATED WITH PARTITIONS CHRISTINE BESSENRODT AND RICHARD P. STANLEY Abstract. Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville
More informationA Multivariate Determinant Associated with Partitions (preliminary version)
A Multivariate Determinant Associated with Partitions (preliminary version) Richard P. Stanley September 6, 203 Introduction. E. R. Berlekamp [][2] raised a question concerning the entries of certain matrices
More informationOn the critical group of the n-cube
Linear Algebra and its Applications 369 003 51 61 wwwelseviercom/locate/laa On the critical group of the n-cube Hua Bai School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA Received
More informationWHAT IS a sandpile? Lionel Levine and James Propp
WHAT IS a sandpile? Lionel Levine and James Propp An abelian sandpile is a collection of indistinguishable chips distributed among the vertices of a graph. More precisely, it is a function from the vertices
More informationSMITH NORMAL FORM IN COMBINATORICS
SMITH NORMAL FORM IN COMBINATORICS RICHARD P. STANLEY Abstract. This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic
More information18.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 informationTHE SMITH NORMAL FORM OF A SPECIALIZED JACOBI-TRUDI MATRIX
THE SMITH NORMAL FORM OF A SPECIALIZED JACOBI-TRUDI MATRIX RICHARD P. STANLEY Abstract. LetJT λ bethejacobi-trudimatrixcorrespondingtothepartitionλ, sodetjt λ is the Schur function s λ in the variables
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 22. Smith normal form of an integer matrix (linear algebra over Z).
18.312: Algebraic Combinatorics Lionel Levine Lecture date: May 3, 2011 Lecture 22 Notes by: Lou Odette This lecture: Smith normal form of an integer matrix (linear algebra over Z). 1 Review of Abelian
More informationNotes 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 informationThe critical group of a graph
The critical group of a graph Peter Sin Texas State U., San Marcos, March th, 4. Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs
More informationStandard Young Tableaux Old and New
Standard Young Tableaux Old and New Ron Adin and Yuval Roichman Department of Mathematics Bar-Ilan University Workshop on Group Theory in Memory of David Chillag Technion, Haifa, Oct. 14 1 2 4 3 5 7 6
More informationSandpile Groups of Cubes
Sandpile Groups of Cubes B. Anzis & R. Prasad August 1, 2016 Sandpile Groups of Cubes August 1, 2016 1 / 27 Overview Introduction Sandpile Groups of Cubes August 1, 2016 2 / 27 Overview Introduction Definitions
More informationTRIVARIATE MONOMIAL COMPLETE INTERSECTIONS AND PLANE PARTITIONS
TRIVARIATE MONOMIAL COMPLETE INTERSECTIONS AND PLANE PARTITIONS CHARLES CHEN, ALAN GUO, XIN JIN, AND GAKU LIU Abstract. We consider the homogeneous components U r of the map on R = k[x, y, z]/(x A, y B,
More informationComputing the rank of configurations on Complete Graphs
Computing the rank of configurations on Complete Graphs Robert Cori November 2016 The paper by M. Baker and S. Norine [1] in 2007 introduced a new parameter in Graph Theory it was called the rank of configurations
More informationLARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1229 1240 http://dx.doi.org/10.4134/bkms.2014.51.4.1229 LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Su Hyung An, Sen-Peng Eu, and Sangwook Kim Abstract.
More informationSmith normal form of a multivariate matrix associated with partitions
Smith normal form of a multivariate matrix associated with partitions The MIT Faculty has made this article openly available Please share how this access benefits you Your story matters Citation As Published
More informationSmith normal forms of matrices associated with the Grassmann graphs of lines in
Smith normal forms of matrices associated with the Grassmann graphs of lines in PG(n, q) Peter Sin, U. of Florida UD Discrete Math Seminar November th, 206 Smith normal forms Graphs from lines Smith normal
More informationCounting matrices over finite fields
Counting matrices over finite fields Steven Sam Massachusetts Institute of Technology September 30, 2011 1/19 Invertible matrices F q is a finite field with q = p r elements. [n] = 1 qn 1 q = qn 1 +q n
More informationSpanning Trees and a Conjecture of Kontsevich
Annals of Combinatorics 2 (1998) 351-363 Annals of Combinatorics Springer-Verlag 1998 Spanning Trees and a Conjecture of Kontsevich Richard P. Stanley Department of Mathematics, Massachusetts Institute
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationSome Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
More informationM3/4/5P12 PROBLEM SHEET 1
M3/4/5P12 PROBLEM SHEET 1 Please send any corrections or queries to jnewton@imperialacuk Exercise 1 (1) Let G C 4 C 2 s, t : s 4 t 2 e, st ts Let V C 2 with the stard basis Consider the linear transformations
More informationCounting chains in noncrossing partition lattices
Counting chains in noncrossing partition lattices Nathan Reading NC State University NCSU Algebra Seminar, November 16, 2007 1 Counting chains in noncrossing partition lattices Classical noncrossing partitions
More informationCourse : Algebraic Combinatorics
Course 18.312: Algebraic Combinatorics Lecture Notes #29-31 Addendum by Gregg Musiker April 24th - 29th, 2009 The following material can be found in several sources including Sections 14.9 14.13 of Algebraic
More informationORIE 6334 Spectral Graph Theory September 8, Lecture 6. In order to do the first proof, we need to use the following fact.
ORIE 6334 Spectral Graph Theory September 8, 2016 Lecture 6 Lecturer: David P. Williamson Scribe: Faisal Alkaabneh 1 The Matrix-Tree Theorem In this lecture, we continue to see the usefulness of the graph
More informationarxiv: v2 [math.co] 6 Oct 2016
ON THE CRITICAL GROUP OF THE MISSING MOORE GRAPH. arxiv:1509.00327v2 [math.co] 6 Oct 2016 JOSHUA E. DUCEY Abstract. We consider the critical group of a hypothetical Moore graph of diameter 2 and valency
More informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
More informationSome Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
More information1 Counting spanning trees: A determinantal formula
Math 374 Matrix Tree Theorem Counting spanning trees: A determinantal formula Recall that a spanning tree of a graph G is a subgraph T so that T is a tree and V (G) = V (T ) Question How many distinct
More informationQ N id β. 2. Let I and J be ideals in a commutative ring A. Give a simple description of
Additional Problems 1. Let A be a commutative ring and let 0 M α N β P 0 be a short exact sequence of A-modules. Let Q be an A-module. i) Show that the naturally induced sequence is exact, but that 0 Hom(P,
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More informationSmith Normal Forms of Strongly Regular graphs
Smith Normal Forms of Strongly Regular graphs Peter Sin, U. of Florida UD Discrete Math. Seminar, May 7th, 2018. Smith normal forms Smith normal form Smith normal forms associated with graphs Smith and
More information3.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 informationHomework 5 M 373K Mark Lindberg and Travis Schedler
Homework 5 M 373K Mark Lindberg and Travis Schedler 1. Artin, Chapter 3, Exercise.1. Prove that the numbers of the form a + b, where a and b are rational numbers, form a subfield of C. Let F be the numbers
More informationCounting Arithmetical Structures
Counting Arithmetical Structures Luis David García Puente Department of Mathematics and Statistics Sam Houston State University Blackwell-Tapia Conference 2018 The Institute for Computational and Experimental
More informationGROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache
GROUPS AS GRAPHS W. B. Vasantha Kandasamy Florentin Smarandache 009 GROUPS AS GRAPHS W. B. Vasantha Kandasamy e-mail: vasanthakandasamy@gmail.com web: http://mat.iitm.ac.in/~wbv www.vasantha.in Florentin
More informationStatistical Mechanics and Combinatorics : Lecture IV
Statistical Mechanics and Combinatorics : Lecture IV Dimer Model Local Statistics We ve already discussed the partition function Z for dimer coverings in a graph G which can be computed by Kasteleyn matrix
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationCombinatorial Structures
Combinatorial Structures Contents 1 Permutations 1 Partitions.1 Ferrers diagrams....................................... Skew diagrams........................................ Dominance order......................................
More informationCombinatorics for algebraic geometers
Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is
More informationNOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions
NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET JENNIFER WOODCOCK 1. Basic Definitions Dyck paths are one of the many combinatorial objects enumerated by the Catalan numbers, sequence A000108 in [2]:
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More informationAbelian Sandpile Model: Symmetric Sandpiles
Harvey Mudd College November 16, 2008 Self Organized Criticality In an equilibrium system the critical point is reached by tuning a control parameter precisely. Example: Melting water. Definition Self-Organized
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
More informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS
ON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS MOTOKI TAKIGIKU Abstract. We give some new formulas about factorizations of K-k-Schur functions, analogous to the k-rectangle factorization formula
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationThe Zeta Function of a Cyclic Language with Connections to Elliptic Curves and Chip-Firing Games
The Zeta Function of a Cyclic Language with Connections to Elliptic Curves and Chip-Firing Games University of California, San Diego March 14, 2007 University of California, San Diego Slide 1 OUTLINE I.
More informationq 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 informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationh r t r 1 (1 x i=1 (1 + x i t). e r t r = i=1 ( 1) i e i h r i = 0 r 1.
. Four definitions of Schur functions.. Lecture : Jacobi s definition (ca 850). Fix λ = (λ λ n and X = {x,...,x n }. () a α = det ( ) x α i j for α = (α,...,α n ) N n (2) Jacobi s def: s λ = a λ+δ /a δ
More informationChapter 3. Basic Properties of Matrices
3.1. Basic Definitions and Notations 1 Chapter 3. Basic Properties of Matrices Note. This long chapter (over 100 pages) contains the bulk of the material for this course. As in Chapter 2, unless stated
More informationMonoids. Definition: A binary operation on a set M is a function : M M M. Examples:
Monoids Definition: A binary operation on a set M is a function : M M M. If : M M M, we say that is well defined on M or equivalently, that M is closed under the operation. Examples: Definition: A monoid
More informationHomework 11/Solutions. (Section 6.8 Exercise 3). Which pairs of the following vector spaces are isomorphic?
MTH 9-4 Linear Algebra I F Section Exercises 6.8,4,5 7.,b 7.,, Homework /Solutions (Section 6.8 Exercise ). Which pairs of the following vector spaces are isomorphic? R 7, R, M(, ), M(, 4), M(4, ), P 6,
More informationMATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationThe Structure of the Jacobian Group of a Graph. A Thesis Presented to The Division of Mathematics and Natural Sciences Reed College
The Structure of the Jacobian Group of a Graph A Thesis Presented to The Division of Mathematics and Natural Sciences Reed College In Partial Fulfillment of the Requirements for the Degree Bachelor of
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationSolutions of exercise sheet 8
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationThe product distance matrix of a tree and a bivariate zeta function of a graphs
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 19 2012 The product distance matrix of a tree and a bivariate zeta function of a graphs R. B. Bapat krishnan@math.iitb.ac.in S. Sivasubramanian
More information22m:033 Notes: 3.1 Introduction to Determinants
22m:033 Notes: 3. Introduction to Determinants Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman October 27, 2009 When does a 2 2 matrix have an inverse? ( ) a a If A =
More informationThe Smith normal form distribution of a random integer matrix
FPSAC 2016 Vancouver, Canada DMTCS proc. BC, 2016, 1111 1122 The Smith normal form distribution of a random integer matrix Yinghui Wang 1 and Richard P. Stanley 2 1 Department of Mathematics, Columbia
More informationA Survey of Parking Functions
A Survey of Parking Functions Richard P. Stanley M.I.T. Parking functions... n 2 1... a a a 1 2 n Car C i prefers space a i. If a i is occupied, then C i takes the next available space. We call (a 1,...,a
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationAverage Mixing Matrix of Trees
Electronic Journal of Linear Algebra Volume 34 Volume 34 08 Article 9 08 Average Mixing Matrix of Trees Chris Godsil University of Waterloo, cgodsil@uwaterloo.ca Krystal Guo Université libre de Bruxelles,
More informationCounting Matrices Over a Finite Field With All Eigenvalues in the Field
Counting Matrices Over a Finite Field With All Eigenvalues in the Field Lisa Kaylor David Offner Department of Mathematics and Computer Science Westminster College, Pennsylvania, USA kaylorlm@wclive.westminster.edu
More informationAbstract Algebra Study Sheet
Abstract Algebra Study Sheet This study sheet should serve as a guide to which sections of Artin will be most relevant to the final exam. When you study, you may find it productive to prioritize the definitions,
More informationDeterminants 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 informationChapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations
Chapter 5 Groups of permutations (bijections) Basic notation and ideas We study the most general type of groups - groups of permutations (bijections). Definition A bijection from a set A to itself is also
More informationCRITICAL GROUPS AND LINE GRAPHS
CRITICAL GROUPS AND LINE GRAPHS ANDREW BERGET 1. Introduction This paper is an overview of what the author has learned about the critical group of a graph, including some new results. In particular we
More information[06.1] Given a 3-by-3 matrix M with integer entries, find A, B integer 3-by-3 matrices with determinant ±1 such that AMB is diagonal.
(January 14, 2009) [06.1] Given a 3-by-3 matrix M with integer entries, find A, B integer 3-by-3 matrices with determinant ±1 such that AMB is diagonal. Let s give an algorithmic, rather than existential,
More informationEvaluating 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 informationInteger Partitions With Even Parts Below Odd Parts and the Mock Theta Functions
Integer Partitions With Even Parts Below Odd Parts and the Mock Theta Functions by George E. Andrews Key Words: Partitions, mock theta functions, crank AMS Classification Numbers: P84, P83, P8, 33D5 Abstract
More informationOn the Sandpile Group of Circulant Graphs
On the Sandpile Group of Circulant Graphs Anna Comito, Jennifer Garcia, Justin Rivera, Natalie Hobson, and Luis David Garcia Puente (Dated: October 9, 2016) Circulant graphs are of interest in many areas
More informationFINITE GROUP THEORY: SOLUTIONS FALL MORNING 5. Stab G (l) =.
FINITE GROUP THEORY: SOLUTIONS TONY FENG These are hints/solutions/commentary on the problems. They are not a model for what to actually write on the quals. 1. 2010 FALL MORNING 5 (i) Note that G acts
More informationImproved Upper Bounds for the Laplacian Spectral Radius of a Graph
Improved Upper Bounds for the Laplacian Spectral Radius of a Graph Tianfei Wang 1 1 School of Mathematics and Information Science Leshan Normal University, Leshan 614004, P.R. China 1 wangtf818@sina.com
More informationAutomorphisms of strongly regular graphs and PDS in Abelian groups
Automorphisms of strongly regular graphs and PDS in Abelian groups Zeying Wang Department of Mathematical Sciences Michigan Technological University Joint work with Stefaan De Winter and Ellen Kamischke
More informationResistance distance in wheels and fans
Resistance distance in wheels and fans R B Bapat Somit Gupta February 4, 009 Abstract: The wheel graph is the join of a single vertex and a cycle, while the fan graph is the join of a single vertex and
More informationEigenvalues of the Redheffer Matrix and Their Relation to the Mertens Function
Eigenvalues of the Redheffer Matrix and Their Relation to the Mertens Function Will Dana June 7, 205 Contents Introduction. Notations................................ 2 2 Number-Theoretic Background 2 2.
More informationCONSEQUENCES OF THE SYLOW THEOREMS
CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.
More informationCOUNTING AND ENUMERATING SPANNING TREES IN (di-) GRAPHS
COUNTING AND ENUMERATING SPANNING TREES IN (di-) GRAPHS Xuerong Yong Version of Feb 5, 9 pm, 06: New York Time 1 1 Introduction A directed graph (digraph) D is a pair (V, E): V is the vertex set of D,
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More information5 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 informationOn algebras arising from semiregular group actions
On algebras arising from semiregular group actions István Kovács Department of Mathematics and Computer Science University of Primorska, Slovenia kovacs@pef.upr.si . Schur rings For a permutation group
More informationTHREE LECTURES ON QUASIDETERMINANTS
THREE LECTURES ON QUASIDETERMINANTS Robert Lee Wilson Department of Mathematics Rutgers University The determinant of a matrix with entries in a commutative ring is a main organizing tool in commutative
More informationDiscrete Math, Second Problem Set (June 24)
Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationDiscriminants of Brauer Algebra
Discriminants of Brauer Algebra Dr.Jeyabharthi, Associate Professor Department of Mathematics, Thiagarajar Engineering College, Madurai. J.Evangeline Jeba, Assistant Professor Department of Mathematics,
More informationMath 416, Spring 2010 The algebra of determinants March 16, 2010 THE ALGEBRA OF DETERMINANTS. 1. Determinants
THE ALGEBRA OF DETERMINANTS 1. Determinants We have already defined the determinant of a 2 2 matrix: det = ad bc. We ve also seen that it s handy for determining when a matrix is invertible, and when it
More informationDOMINO TILING. Contents 1. Introduction 1 2. Rectangular Grids 2 Acknowledgments 10 References 10
DOMINO TILING KASPER BORYS Abstract In this paper we explore the problem of domino tiling: tessellating a region with x2 rectangular dominoes First we address the question of existence for domino tilings
More informationRandom Involutions and the Distinct Prime Divisor Function
Random Involutions and the Distinct Prime Divisor Function Zubin Mukerjee and Uthsav Chitra Advisor: Kirsten Wickelgren, Harvard University PROMYS 2012 Albany Area Math Circle April 6, 2013 DISTINCT PRIME
More informationTEST 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 informationAbelian Sandpile Model: Symmetric Sandpiles
Harvey Mudd College March 20, 2009 Self Organized Criticality In an equilibrium system the critical point is reached by tuning a control parameter precisely. Example: Melting water. Definition Self-Organized
More informationONE CAN HEAR THE EULER CHARACTERISTIC OF A SIMPLICIAL COMPLEX
ONE CAN HEAR THE EULER CHARACTERISTIC OF A SIMPLICIAL COMPLEX OLIVER KNILL y G g(x, y) with g = L 1 but also agrees with Abstract. We prove that that the number p of positive eigenvalues of the connection
More information