Smith normal forms of matrices associated with the Grassmann graphs of lines in
|
|
- Aubrey Palmer
- 5 years ago
- Views:
Transcription
1 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
2 Smith normal forms Graphs from lines Smith normal forms Chip-firing game Cross-characteristics Defining characteristic
3 Critical groups of graphs Graphs from lines Smith normal forms Chip-firing game Cross-characteristics Defining characteristic
4 Grassmann and skew lines graphs q = p t, p prime, V = F n q,
5 Grassmann and skew lines graphs q = p t, p prime, V = F n q, Γ = Γ (n, q) Grassman graph, vertices are lines of PG(V ), i.e. 2-diml subspaces of V. Two vertices lie on an edge iff the subspaces are distinct and have nonzero intersection.
6 Grassmann and skew lines graphs q = p t, p prime, V = F n q, Γ = Γ (n, q) Grassman graph, vertices are lines of PG(V ), i.e. 2-diml subspaces of V. Two vertices lie on an edge iff the subspaces are distinct and have nonzero intersection. Γ the complementary graph, is the skew lines graph.
7 Strongly Regular Graphs Definition A strongly regular graph with parameters (v, k, λ, µ) is a k-regular graph such that any two adjacent vertices have λ neighbors in common; and any two nonadjacent vertices have µ neighbors in common. The adjacency matrix of a SRG has three eigenvalues k, r, s.
8 Strongly Regular Graphs Definition A strongly regular graph with parameters (v, k, λ, µ) is a k-regular graph such that any two adjacent vertices have λ neighbors in common; and any two nonadjacent vertices have µ neighbors in common. The adjacency matrix of a SRG has three eigenvalues k, r, s. Γ is a SRG v = [ n 2 ] q, k = q(q + )[ ] n 2 q, λ = [ ] n q + q2 2, µ = (q + ) 2, r = [ n ] q and s = (q + ) [ n ] q.
9 Strongly Regular Graphs Definition A strongly regular graph with parameters (v, k, λ, µ) is a k-regular graph such that any two adjacent vertices have λ neighbors in common; and any two nonadjacent vertices have µ neighbors in common. The adjacency matrix of a SRG has three eigenvalues k, r, s. Γ is a SRG v = [ n 2 ] q, k = q(q + )[ ] n 2 q, λ = [ ] n q + q2 2, µ = (q + ) 2, r = [ n ] q and s = (q + ) [ ] n q. Γ is also a SRG. So we have two families of SRGs paramtrized by n, p and t.
10 Critical groups of graphs Graphs from lines Smith normal forms Chip-firing game Cross-characteristics Defining characteristic
11 Smith Normal form A(G), an adjacency matrix of a graph G.
12 Smith Normal form A(G), an adjacency matrix of a graph G. L(G) = D(G) A(G), Laplacian matrix.
13 Smith Normal form A(G), an adjacency matrix of a graph G. L(G) = D(G) A(G), Laplacian matrix. The Smith normal forms of A(G) and L(G) are invariants of G.
14 Smith Normal form A(G), an adjacency matrix of a graph G. L(G) = D(G) A(G), Laplacian matrix. The Smith normal forms of A(G) and L(G) are invariants of G. S(G), the abelian group whose cyclic decomposition is given by the SNF of A(G), (Smith group).
15 Smith Normal form A(G), an adjacency matrix of a graph G. L(G) = D(G) A(G), Laplacian matrix. The Smith normal forms of A(G) and L(G) are invariants of G. S(G), the abelian group whose cyclic decomposition is given by the SNF of A(G), (Smith group). K (G), the finite part of the abelian group whose cyclic decomposition is given by the SNF of L(G) (critical group, sandpile group, jacobian).
16 Smith Normal form A(G), an adjacency matrix of a graph G. L(G) = D(G) A(G), Laplacian matrix. The Smith normal forms of A(G) and L(G) are invariants of G. S(G), the abelian group whose cyclic decomposition is given by the SNF of A(G), (Smith group). K (G), the finite part of the abelian group whose cyclic decomposition is given by the SNF of L(G) (critical group, sandpile group, jacobian). K (G) = number of spanning trees (Kirchhoff s Matrix-tree Theorem).
17 Smith Normal form A(G), an adjacency matrix of a graph G. L(G) = D(G) A(G), Laplacian matrix. The Smith normal forms of A(G) and L(G) are invariants of G. S(G), the abelian group whose cyclic decomposition is given by the SNF of A(G), (Smith group). K (G), the finite part of the abelian group whose cyclic decomposition is given by the SNF of L(G) (critical group, sandpile group, jacobian). K (G) = number of spanning trees (Kirchhoff s Matrix-tree Theorem). Survey article on SNFs in combinatorics by R. Stanley (JCTA 206).
18 Critical groups of graphs Graphs from lines Smith normal forms Chip-firing game Cross-characteristics Defining characteristic
19 Rules A configuration on the graph G is an assignment of a nonnegative integer s(v) to each round vertex v and v s(v) to the square vertex.
20 Rules A configuration on the graph G is an assignment of a nonnegative integer s(v) to each round vertex v and v s(v) to the square vertex. A round vertex v can be fired if it has at least deg(v) chips.
21 Rules A configuration on the graph G is an assignment of a nonnegative integer s(v) to each round vertex v and v s(v) to the square vertex. A round vertex v can be fired if it has at least deg(v) chips.
22 Rules A configuration on the graph G is an assignment of a nonnegative integer s(v) to each round vertex v and v s(v) to the square vertex. A round vertex v can be fired if it has at least deg(v) chips.
23 Rules A configuration on the graph G is an assignment of a nonnegative integer s(v) to each round vertex v and v s(v) to the square vertex. A round vertex v can be fired if it has at least deg(v) chips. The square vertex is fired only when no others can be fired.
24 Example game -2 0
25 Example game
26 Example game
27 Example game
28 Example game
29 Example game
30 Relation with Laplacian Start with a configuration s and fire vertices in a sequence where each vertex v is fired x(v) times, ending up with configuration s.
31 Relation with Laplacian Start with a configuration s and fire vertices in a sequence where each vertex v is fired x(v) times, ending up with configuration s. s (v) = s(v) x(v) deg(v) + (v,w) E x(w)
32 Relation with Laplacian Start with a configuration s and fire vertices in a sequence where each vertex v is fired x(v) times, ending up with configuration s. s (v) = s(v) x(v) deg(v) + (v,w) E x(w) s = s L(G)x.
33 Relation with Laplacian Start with a configuration s and fire vertices in a sequence where each vertex v is fired x(v) times, ending up with configuration s. s (v) = s(v) x(v) deg(v) + (v,w) E x(w) s = s L(G)x. A configuration is stable if no round vertex can be fired, recurrent if there is a sequence of firings leading back to the same configuration, critical if recurrent and stable. Theorem (Dhar, Björner-Lovász, Biggs, Gabrielov,...) Consider the chip-firing game on a connected graph G. Any starting configuration leads to a unique critical configuration. The set of critical configurations has a natural group operation making it isomorphic to the critical group K (G).
34 GL(n, q)-permutation modules We (Ducey-S) compute the SNF for A = A(Γ(n, q)), L = L(Γ(n, q)), A = A(Γ (n, q)), L = L(Γ (n, q)).
35 GL(n, q)-permutation modules We (Ducey-S) compute the SNF for A = A(Γ(n, q)), L = L(Γ(n, q)), A = A(Γ (n, q)), L = L(Γ (n, q)). L r, the set of r-diml. subspaces of V.
36 GL(n, q)-permutation modules We (Ducey-S) compute the SNF for A = A(Γ(n, q)), L = L(Γ(n, q)), A = A(Γ (n, q)), L = L(Γ (n, q)). L r, the set of r-diml. subspaces of V. A and L define Z GL(n, q)-module homomorphisms A, L : Z L 2 Z L 2
37 GL(n, q)-permutation modules We (Ducey-S) compute the SNF for A = A(Γ(n, q)), L = L(Γ(n, q)), A = A(Γ (n, q)), L = L(Γ (n, q)). L r, the set of r-diml. subspaces of V. A and L define Z GL(n, q)-module homomorphisms A, L : Z L 2 Z L 2 SNF can be computed one prime at a time (elementary divisors).
38 GL(n, q)-permutation modules We (Ducey-S) compute the SNF for A = A(Γ(n, q)), L = L(Γ(n, q)), A = A(Γ (n, q)), L = L(Γ (n, q)). L r, the set of r-diml. subspaces of V. A and L define Z GL(n, q)-module homomorphisms A, L : Z L 2 Z L 2 SNF can be computed one prime at a time (elementary divisors). Fix prime l M = Z L 2 l, M = FL 2 l, α {A, L}.
39 GL(n, q)-permutation modules We (Ducey-S) compute the SNF for A = A(Γ(n, q)), L = L(Γ(n, q)), A = A(Γ (n, q)), L = L(Γ (n, q)). L r, the set of r-diml. subspaces of V. A and L define Z GL(n, q)-module homomorphisms A, L : Z L 2 Z L 2 SNF can be computed one prime at a time (elementary divisors). Fix prime l M = Z L 2 l, M = FL 2 l, α {A, L}. M = M 0 M M r = Ker(α) 0. M = M 0 M M r = Ker(α) 0.
40 e i = e i (α) := multiplicity of l i as an elementary divisor of α. (e 0 = rank(α)).
41 e i = e i (α) := multiplicity of l i as an elementary divisor of α. (e 0 = rank(α)). dim M a = + i a e i.
42 e i = e i (α) := multiplicity of l i as an elementary divisor of α. (e 0 = rank(α)). dim M a = + i a e i. All quotients M a /M a+ are F l GL(n, q)-modules, so the number of nonzero e i is at most the composition length of M as a F l GL(n, q)-module.
43 Critical groups of graphs Graphs from lines Smith normal forms Chip-firing game Cross-characteristics Defining characteristic
44 l-modular representations of GL(n, q) l p
45 l-modular representations of GL(n, q) l p Theory due to G. D. James.
46 l-modular representations of GL(n, q) l p Theory due to G. D. James. M is a q-analogue of the F l -permutation module of subsets of size 2 in a set of size n.
47 l-modular representations of GL(n, q) l p Theory due to G. D. James. M is a q-analogue of the F l -permutation module of subsets of size 2 in a set of size n. M has 3 isomorphism types of composition factors.
48 l-modular representations of GL(n, q) l p Theory due to G. D. James. M is a q-analogue of the F l -permutation module of subsets of size 2 in a set of size n. M has 3 isomorphism types of composition factors. The composition length is 6 and does not grow with n or t or p, but depends on certain divisibility conditions.
49 l-modular representations of GL(n, q) l p Theory due to G. D. James. M is a q-analogue of the F l -permutation module of subsets of size 2 in a set of size n. M has 3 isomorphism types of composition factors. The composition length is 6 and does not grow with n or t or p, but depends on certain divisibility conditions. Based on James results, it is easy to work out the submodule structure of M in all cases.
50 l [ ] n 2 q l [ ] n 2 q l q + l q + [ ] l n l [ ] n q q M = F l D D 2 M = F l D D 2 M = D F l D 2 F l N/A l n 2 M = F l D D 2 N/A F l l n 2 M = D D 2 F l Table : l ( ) n q N/A D
51 [ l q+ ] l n q l [ ] n 2 q F l M= D D 2 F l l q+ l n 2 N/A l [ n 2 ] q D l [ ] n 2 q N/A l [ n 2 ] q D l q+ l n M = F l D 2 F l D 2 N/A M=F l Table : l ( n ) q D F l D 2 F l D M = F l D 2 F l D
52 Example: l q +, n even Assume l q +, n even.
53 Example: l q +, n even Assume l q +, n even. Then k = q(q + ) 2 h, r = (q + )(qh ), s = (q + ), where h := qn 2 q 2.
54 Example: l q +, n even Assume l q +, n even. Then k = q(q + ) 2 h, r = (q + )(qh ), s = (q + ), where h := qn 2 q 2. r has multiplicity f = [ n ] q, s has multiplicity g = [ n 2 ] q [ n ] q.
55 Example: l q +, n even Assume l q +, n even. Then k = q(q + ) 2 h, r = (q + )(qh ), s = (q + ), where h := qn 2 q 2. r has multiplicity f = [ n ] q, s has multiplicity g = [ n 2 ] q [ n ] q. Let a = v l (q + ), b = v l (qh ) and c = v l (h).
56 Example: l q +, n even Assume l q +, n even. Then k = q(q + ) 2 h, r = (q + )(qh ), s = (q + ), where h := qn 2 q 2. r has multiplicity f = [ n ] q, s has multiplicity g = [ n 2 ] q [ n ] q. Let a = v l (q + ), b = v l (qh ) and c = v l (h). l h if and only if l n 2 2
57 Example: l q +, n even Assume l q +, n even. Then k = q(q + ) 2 h, r = (q + )(qh ), s = (q + ), where h := qn 2 q 2. r has multiplicity f = [ n ] q, s has multiplicity g = [ n 2 ] q [ n ] q. Let a = v l (q + ), b = v l (qh ) and c = v l (h). l h if and only if l n 2 2 gcd(h, qh ) =, so either c = 0 or b = 0.
58 Example: l q +, n even Assume l q +, n even. Then k = q(q + ) 2 h, r = (q + )(qh ), s = (q + ), where h := qn 2 q 2. r has multiplicity f = [ n ] q, s has multiplicity g = [ n 2 ] q [ n ] q. Let a = v l (q + ), b = v l (qh ) and c = v l (h). l h if and only if l n 2 2 gcd(h, qh ) =, so either c = 0 or b = 0. b = 0 if and only if l [ n 2 ] q.
59 Example: l q +, n even Assume l q +, n even. Then k = q(q + ) 2 h, r = (q + )(qh ), s = (q + ), where h := qn 2 q 2. r has multiplicity f = [ n ] q, s has multiplicity g = [ n 2 ] q [ n ] q. Let a = v l (q + ), b = v l (qh ) and c = v l (h). l h if and only if l n 2 2 gcd(h, qh ) =, so either c = 0 or b = 0. b = 0 if and only if l [ n 2 ] q. We ll look at the case c = 0 and b = 0. Then v l (r) = v l (s) = a and v l ( S(Γ) ) = af + ag + 2a
60 Example: l q +, n even, v l (r) = v l (s) = a M = Z l Y.
61 Example: l q +, n even, v l (r) = v l (s) = a M = Z l Y. On Y = Ker(J) we have A (A (r + s)i) = rsi.
62 Example: l q +, n even, v l (r) = v l (s) = a M = Z l Y. On Y = Ker(J) we have A (A (r + s)i) = rsi. This shows that (A (r + s)i)(y ) M 2a Y, so as l (r + s), A (Y ) M 2a Y.
63 Example: l q +, n even, v l (r) = v l (s) = a M = Z l Y. On Y = Ker(J) we have A (A (r + s)i) = rsi. This shows that (A (r + s)i)(y ) M 2a Y, so as l (r + s), A (Y ) M 2a Y. A (Y ) is nonzero, so it has D as a composition factor.
64 Example: l q +, n even, v l (r) = v l (s) = a M = Z l Y. On Y = Ker(J) we have A (A (r + s)i) = rsi. This shows that (A (r + s)i)(y ) M 2a Y, so as l (r + s), A (Y ) M 2a Y. A (Y ) is nonzero, so it has D as a composition factor. dim M 2a Y f and so dim M 2a f.
65 Example: l q +, n even, v l (r) = v l (s) = a M = Z l Y. On Y = Ker(J) we have A (A (r + s)i) = rsi. This shows that (A (r + s)i)(y ) M 2a Y, so as l (r + s), A (Y ) M 2a Y. A (Y ) is nonzero, so it has D as a composition factor. dim M 2a Y f and so dim M 2a f. Further analysis of A and structure of M shows dim M a = g + 2.
66 We have dim M 2a f, dim M a = g + 2.
67 We have dim M 2a f, dim M a = g + 2. a(f + g) + 2a = v l ( S(Γ) ) = ie i i 0 ie i + ie i a a i<2a a i<2a i 2a e i + 2a i 2a a(dim M a dim M 2a ) + 2a dim M 2a a(g + 2) + af. Therefore, equality holds throughout, and it follows that e 0 = f, e a = g f + 2, e 2a = f (and e i = 0 otherwise). e i
68 Critical groups of graphs Graphs from lines Smith normal forms Chip-firing game Cross-characteristics Defining characteristic
69 Here the number of composition factors of M grows like n t, where q = p t.
70 Here the number of composition factors of M grows like n t, where q = p t. But from the eigenvalues, L has no p-elementary divisors.
71 Here the number of composition factors of M grows like n t, where q = p t. But from the eigenvalues, L has no p-elementary divisors. For A, we can see that only k is divisible by p, so S(Γ ) is cyclic of order p t.
72 Here the number of composition factors of M grows like n t, where q = p t. But from the eigenvalues, L has no p-elementary divisors. For A, we can see that only k is divisible by p, so S(Γ ) is cyclic of order p t. The skew lines matrices A and L are much harder but much of the difficulty was handled in earlier work for the case n = 4 (Brouwer-Ducey-S.)
73 Here the number of composition factors of M grows like n t, where q = p t. But from the eigenvalues, L has no p-elementary divisors. For A, we can see that only k is divisible by p, so S(Γ ) is cyclic of order p t. The skew lines matrices A and L are much harder but much of the difficulty was handled in earlier work for the case n = 4 (Brouwer-Ducey-S.) Note A L mod (p 4t ), so just consider A.
74 Example Table : The elementary divisors of the incidence matrix of lines vs. lines in PG(3, 9), where two lines are incident when skew. Elem. Div Multiplicity
75 For n = 4 we have A(A + q(q )I) = q 3 I + q 3 (q )J,
76 For n = 4 we have A(A + q(q )I) = q 3 I + q 3 (q )J, For general n, we have A(A + q( [ ] n 2 q 2)I) = q 3[ n 3 ]q I + q3 [ n 3 ] q ( [ ) n ]q (q + 2) J, q +
77 Reductions using SRG equation p [ n 2 ] q so Z L 2 p = Z p Y, Y = Ker(J)
78 Reductions using SRG equation p [ n 2 ] q so Z L 2 p = Z p Y, Y = Ker(J) A() = k = q 4[ ] n 2 2 q, so e 4t.
79 Reductions using SRG equation p [ n 2 ] q so Z L 2 p = Z p Y, Y = Ker(J) A() = k = q 4[ ] n 2 2 q, so e 4t. We have A Y [A Y qz I] = q 3 z 2 I, where z, z 2 are units in Z p.
80 Reductions using SRG equation p [ n 2 ] q so Z L 2 p = Z p Y, Y = Ker(J) A() = k = q 4[ ] n 2 2 q, so e 4t. We have A Y [A Y qz I] = q 3 z 2 I, where z, z 2 are units in Z p. This equation implies:
81 Reductions using SRG equation p [ n 2 ] q so Z L 2 p = Z p Y, Y = Ker(J) A() = k = q 4[ ] n 2 2 q, so e 4t. We have A Y [A Y qz I] = q 3 z 2 I, where z, z 2 are units in Z p. This equation implies:. A Y has no elementary divisors p i for i > 3t.
82 Reductions using SRG equation p [ n 2 ] q so Z L 2 p = Z p Y, Y = Ker(J) A() = k = q 4[ ] n 2 2 q, so e 4t. We have A Y [A Y qz I] = q 3 z 2 I, where z, z 2 are units in Z p. This equation implies:. A Y has no elementary divisors p i for i > 3t. 2. e i = e 3t i 0 i < t.
83 Reductions using SRG equation p [ n 2 ] q so Z L 2 p = Z p Y, Y = Ker(J) A() = k = q 4[ ] n 2 2 q, so e 4t. We have A Y [A Y qz I] = q 3 z 2 I, where z, z 2 are units in Z p. This equation implies:. A Y has no elementary divisors p i for i > 3t. 2. e i = e 3t i 0 i < t. 3. e i = 0 unless 0 i t or 2t i 3t.
84 Reductions using SRG equation p [ n 2 ] q so Z L 2 p = Z p Y, Y = Ker(J) A() = k = q 4[ ] n 2 2 q, so e 4t. We have A Y [A Y qz I] = q 3 z 2 I, where z, z 2 are units in Z p. This equation implies:. A Y has no elementary divisors p i for i > 3t. 2. e i = e 3t i 0 i < t. 3. e i = 0 unless 0 i t or 2t i 3t. 4. Once we have e i 0 i < t we have them all.
85 Reduction to point-line incidence A r,s := the skewness matrix of r-subspaces vs. s-subspaces of V. So A = A 2,2.
86 Reduction to point-line incidence A r,s := the skewness matrix of r-subspaces vs. s-subspaces of V. So A = A 2,2. A r,s A r, A,s (mod p t )
87 Reduction to point-line incidence A r,s := the skewness matrix of r-subspaces vs. s-subspaces of V. So A = A 2,2. A r,s A r, A,s (mod p t ) Hence e i (A r,s ) = e i (A r, A,s ) for i < t.
88 Reduction to point-line incidence A r,s := the skewness matrix of r-subspaces vs. s-subspaces of V. So A = A 2,2. A r,s A r, A,s (mod p t ) Hence e i (A r,s ) = e i (A r, A,s ) for i < t. The p-elementary divisors for A r, (and A,r ) were computed by Chandler-Sin-Xiang (2006).
89 Reduction to point-line incidence A r,s := the skewness matrix of r-subspaces vs. s-subspaces of V. So A = A 2,2. A r,s A r, A,s (mod p t ) Hence e i (A r,s ) = e i (A r, A,s ) for i < t. The p-elementary divisors for A r, (and A,r ) were computed by Chandler-Sin-Xiang (2006). Nontrivial to relate p-elementary divisors of A r, and A,s to those of A r, A,s.
90 The poset H H := the set of tuples { s = (s 0,..., s t ) such that, for 0 i t,
91 The poset H H := the set of tuples { s = (s 0,..., s t ) such that, for 0 i t, s i n,
92 The poset H H := the set of tuples { s = (s 0,..., s t ) such that, for 0 i t, s i n, 0 ps i+ s i (p )n,
93 The poset H H := the set of tuples { s = (s 0,..., s t ) such that, for 0 i t, s i n, 0 ps i+ s i (p )n, The poset H describes the submodule structure of F L q under the action of GL(n, q). (Bardoe-S (2000)).
94 The poset H H := the set of tuples { s = (s 0,..., s t ) such that, for 0 i t, s i n, 0 ps i+ s i (p )n, The poset H describes the submodule structure of F L q under the action of GL(n, q). (Bardoe-S (2000)). For s = (s 0,..., s t ) H define d( s) as follows.
95 The poset H H := the set of tuples { s = (s 0,..., s t ) such that, for 0 i t, s i n, 0 ps i+ s i (p )n, The poset H describes the submodule structure of F L q under the action of GL(n, q). (Bardoe-S (2000)). For s = (s 0,..., s t ) H define d( s) as follows. Set λ i = ps i+ s i (0 i t subscripts mod t).
96 The poset H H := the set of tuples { s = (s 0,..., s t ) such that, for 0 i t, s i n, 0 ps i+ s i (p )n, The poset H describes the submodule structure of F L q under the action of GL(n, q). (Bardoe-S (2000)). For s = (s 0,..., s t ) H define d( s) as follows. Set λ i = ps i+ s i (0 i t subscripts mod t). d( s) = t i=0 d λ i, where d k := coefficient of x k in the expansion of ( + x + + x p ) n
97 The poset H H := the set of tuples { s = (s 0,..., s t ) such that, for 0 i t, s i n, 0 ps i+ s i (p )n, The poset H describes the submodule structure of F L q under the action of GL(n, q). (Bardoe-S (2000)). For s = (s 0,..., s t ) H define d( s) as follows. Set λ i = ps i+ s i (0 i t subscripts mod t). d( s) = t i=0 d λ i, where d k := coefficient of x k in the expansion of ( + x + + x p ) n d( s) is the dimension of a GL(n, q) composition factor of F L q.
98 For nonnegative integers α, β, define the subsets of H and { t } H α (s) = (s 0,..., s t ) H max{0, s s i } = α βh(r) = {(n s 0,..., n s t ) (s 0,..., s t ) H β (r)} { t } = (s 0,..., s t ) H max{0, s i (n r)} = β}. i=0 i=0
99 General formula for e i (A r, A,s ) Theorem Let E i = e i (A r, A,s ) denote the multiplicity of p i as a p-adic elementary divisor of A r, A,s. E t(r+s) =. For i t(r + s), where Γ(i) = E i = s Γ(i) α+β=i 0 α t(s ) 0 β t(r ) d( s), βh(r) H α (s).
100 Thank you for your attention!
Smith 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 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 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 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 informationRoot system chip-firing
Root system chip-firing PhD Thesis Defense Sam Hopkins Massachusetts Institute of Technology April 27th, 2018 Includes joint work with Pavel Galashin, Thomas McConville, Alexander Postnikov, and James
More informationNote that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.
Algebra fact sheet An algebraic structure (such as group, ring, field, etc.) is a set with some operations and distinguished elements (such as 0, 1) satisfying some axioms. This is a fact sheet with definitions
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 informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
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 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 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 informationLecture 7 Cyclic groups and subgroups
Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:
More informationSmith Normal Form and Combinatorics
Smith Normal Form and Combinatorics Richard P. Stanley June 8, 2017 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
More informationChip-Firing and the Critical Group of a Graph
Journal of Algebraic Combinatorics 9 (1999), 25 45 c 1999 Kluwer Academic Publishers. Manufactured in The Netherlands. Chip-Firing and the Critical Group of a Graph N.L. BIGGS N.L.Biggs@lse.ac.uk London
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 informationINVARIANT DISTRIBUTIONS ON PROJECTIVE SPACES OVER LOCAL FIELDS
INVARIANT DISTRIBUTIONS ON PROJECTIVE SPACES OVER LOCAL FIELDS GUYAN ROBERTSON Abstract Let Γ be an Ãn subgroup of PGL n+1(k), with n 2, where K is a local field with residue field of order q and let P
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
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 informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More informationSpanning Trees of Shifted Simplicial Complexes
Art Duval (University of Texas at El Paso) Caroline Klivans (Brown University) Jeremy Martin (University of Kansas) Special Session on Extremal and Probabilistic Combinatorics University of Nebraska, Lincoln
More informationSmith 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 informationAlgebra Qualifying Exam August 2001 Do all 5 problems. 1. Let G be afinite group of order 504 = 23 32 7. a. Show that G cannot be isomorphic to a subgroup of the alternating group Alt 7. (5 points) b.
More informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
More informationAbelian Networks. Lionel Levine. Berkeley combinatorics seminar. November 7, 2011
Berkeley combinatorics seminar November 7, 2011 An overview of abelian networks Dhar s model of abelian distributed processors Example: abelian sandpile (a.k.a. chip-firing) Themes: 1. Local-to-global
More informationCritical Groups for Cayley Graphs of Bent Functions
Critical Groups for Cayley Graphs of Bent Functions Thomas F. Gruebl Adviser: David Joyner December 9, 2015 1 Introduction This paper will study the critical group of bent functions in the p-ary case.
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 informationMATH 665: TROPICAL BRILL-NOETHER THEORY
MATH 665: TROPICAL BRILL-NOETHER THEORY 2. Reduced divisors The main topic for today is the theory of v-reduced divisors, which are canonical representatives of divisor classes on graphs, depending only
More informationRing Theory Problems. A σ
Ring Theory Problems 1. Given the commutative diagram α A σ B β A σ B show that α: ker σ ker σ and that β : coker σ coker σ. Here coker σ = B/σ(A). 2. Let K be a field, let V be an infinite dimensional
More informationVery few Moore Graphs
Very few Moore Graphs Anurag Bishnoi June 7, 0 Abstract We prove here a well known result in graph theory, originally proved by Hoffman and Singleton, that any non-trivial Moore graph of diameter is regular
More informationMath 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9
Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Section 0. Sets and Relations Subset of a set, B A, B A (Definition 0.1). Cartesian product of sets A B ( Defintion 0.4). Relation (Defintion 0.7). Function,
More information1.4 Solvable Lie algebras
1.4. SOLVABLE LIE ALGEBRAS 17 1.4 Solvable Lie algebras 1.4.1 Derived series and solvable Lie algebras The derived series of a Lie algebra L is given by: L (0) = L, L (1) = [L, L],, L (2) = [L (1), L (1)
More informationSimplification by Truth Table and without Truth Table
Engineering Mathematics 2013 SUBJECT NAME SUBJECT CODE MATERIAL NAME MATERIAL CODE REGULATION UPDATED ON : Discrete Mathematics : MA2265 : University Questions : SKMA1006 : R2008 : August 2013 Name of
More informationRSI 2009 ABSTRACTS Anirudha Balasubramanian
RSI 2009 ABSTRACTS Anirudha Balasubramanian On the Lower Central Series Quotients of a Graded Associative Algebra Martina Balagović Let A be a noncommutative associative algebra, viewed as a Lie algebra
More informationx y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2
5. Finitely Generated Modules over a PID We want to give a complete classification of finitely generated modules over a PID. ecall that a finitely generated module is a quotient of n, a free module. Let
More informationEighth Homework Solutions
Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
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 information0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
More informationRadon Transforms and the Finite General Linear Groups
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 1-1-2004 Radon Transforms and the Finite General Linear Groups Michael E. Orrison Harvey Mudd
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 informationA chip-firing game and Dirichlet eigenvalues
A chip-firing game and Dirichlet eigenvalues Fan Chung and Robert Ellis University of California at San Diego Dedicated to Dan Kleitman in honor of his sixty-fifth birthday Abstract We consider a variation
More informationBENJAMIN LEVINE. 2. Principal Ideal Domains We will first investigate the properties of principal ideal domains and unique factorization domains.
FINITELY GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN BENJAMIN LEVINE Abstract. We will explore classification theory concerning the structure theorem for finitely generated modules over a principal
More informationBulletin of the Iranian Mathematical Society
ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Special Issue of the Bulletin of the Iranian Mathematical Society in Honor of Professor Heydar Radjavi s 80th Birthday Vol 41 (2015), No 7, pp 155 173 Title:
More informationNotation. 0,1,2,, 1 with addition and multiplication modulo
Notation Q,, The set of all natural numbers 1,2,3, The set of all integers The set of all rational numbers The set of all real numbers The group of permutations of distinct symbols 0,1,2,,1 with addition
More informationSome Notes on Distance-Transitive and Distance-Regular Graphs
Some Notes on Distance-Transitive and Distance-Regular Graphs Robert Bailey February 2004 These are notes from lectures given in the Queen Mary Combinatorics Study Group on 13th and 20th February 2004,
More informationALGEBRA QUALIFYING EXAM PROBLEMS
ALGEBRA QUALIFYING EXAM PROBLEMS Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND MODULES General
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
More informationSimplification by Truth Table and without Truth Table
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : June 2017 (Scan the above Q.R code for the direct download of this material)
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 informationSince G is a compact Lie group, we can apply Schur orthogonality to see that G χ π (g) 2 dg =
Problem 1 Show that if π is an irreducible representation of a compact lie group G then π is also irreducible. Give an example of a G and π such that π = π, and another for which π π. Is this true for
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationMA Discrete Mathematics
MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would
More informationMAT534 Fall 2013 Practice Midterm I The actual midterm will consist of five problems.
MAT534 Fall 2013 Practice Midterm I The actual midterm will consist of five problems. Problem 1 Find all homomorphisms a) Z 6 Z 6 ; b) Z 6 Z 18 ; c) Z 18 Z 6 ; d) Z 12 Z 15 ; e) Z 6 Z 25 Proof. a)ψ(1)
More informationSimplification by Truth Table and without Truth Table
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : April-May 2018 BOOK FOR REFERENCE To buy the book visit : Sri Hariganesh
More informationBinomial Exercises A = 1 1 and 1
Lecture I. Toric ideals. Exhibit a point configuration A whose affine semigroup NA does not consist of the intersection of the lattice ZA spanned by the columns of A with the real cone generated by A.
More information. Here the flats of H(2d 1, q 2 ) consist of all nonzero totally isotropic
NEW BOUNDS FOR PARTIAL SPREADS OF H(d 1, ) AND PARTIAL OVOIDS OF THE REE-TITS OCTAGON FERDINAND IHRINGER, PETER SIN, QING XIANG ( ) Abstract Our first result is that the size of a partial spread of H(,
More informationLECTURE 13. Quotient Spaces
LECURE 13 Quotient Spaces In all the development above we have created examples of vector spaces primarily as subspaces of other vector spaces Below we ll provide a construction which starts with a vector
More informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
More informationDIVISOR THEORY ON TROPICAL AND LOG SMOOTH CURVES
DIVISOR THEORY ON TROPICAL AND LOG SMOOTH CURVES MATTIA TALPO Abstract. Tropical geometry is a relatively new branch of algebraic geometry, that aims to prove facts about algebraic varieties by studying
More informationAlgebraically defined graphs and generalized quadrangles
Department of Mathematics Kutztown University of Pennsylvania Combinatorics and Computer Algebra 2015 July 22, 2015 Cages and the Moore bound For given positive integers k and g, find the minimum number
More informationMath 250: Higher Algebra Representations of finite groups
Math 250: Higher Algebra Representations of finite groups 1 Basic definitions Representations. A representation of a group G over a field k is a k-vector space V together with an action of G on V by linear
More informationHandout to Wu Characteristic Harvard math table talk Oliver Knill, 3/8/2016
Handout to Wu Characteristic Harvard math table talk Oliver Knill, 3/8/2016 Definitions Let G = (V, E) be a finite simple graph with vertex set V and edge set E. The f-vector v(g) = (v 0 (G), v 1 (G),...,
More informationSPHERICAL UNITARY REPRESENTATIONS FOR REDUCTIVE GROUPS
SPHERICAL UNITARY REPRESENTATIONS FOR REDUCTIVE GROUPS DAN CIUBOTARU 1. Classical motivation: spherical functions 1.1. Spherical harmonics. Let S n 1 R n be the (n 1)-dimensional sphere, C (S n 1 ) the
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture (u, v) is a horizontal edge K u,v = i (u, v) is a vertical edge 0 else
18.312: Algebraic Combinatorics Lionel Levine Lecture date: Apr 14, 2011 Lecture 18 Notes by: Taoran Chen 1 Kasteleyn s theorem Theorem 1 (Kasteleyn) Let G be a finite induced subgraph of Z 2. Define the
More informationINTRODUCTION TO LIE ALGEBRAS. LECTURE 7.
INTRODUCTION TO LIE ALGEBRAS. LECTURE 7. 7. Killing form. Nilpotent Lie algebras 7.1. Killing form. 7.1.1. Let L be a Lie algebra over a field k and let ρ : L gl(v ) be a finite dimensional L-module. Define
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
More informationMath 121 Homework 4: Notes on Selected Problems
Math 121 Homework 4: Notes on Selected Problems 11.2.9. If W is a subspace of the vector space V stable under the linear transformation (i.e., (W ) W ), show that induces linear transformations W on W
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 informationMATH 304 Linear Algebra Lecture 20: Review for Test 1.
MATH 304 Linear Algebra Lecture 20: Review for Test 1. Topics for Test 1 Part I: Elementary linear algebra (Leon 1.1 1.4, 2.1 2.2) Systems of linear equations: elementary operations, Gaussian elimination,
More informationarxiv: v4 [math.co] 14 Apr 2017
RIEMANN-ROCH THEORY FOR GRAPH ORIENTATIONS SPENCER BACKMAN arxiv:1401.3309v4 [math.co] 14 Apr 2017 Abstract. We develop a new framework for investigating linear equivalence of divisors on graphs using
More informationCHIP-FIRING GAMES, G-PARKING FUNCTIONS, AND AN EFFICIENT BIJECTIVE PROOF OF THE MATRIX-TREE THEOREM
CHIP-FIRING GAMES, G-PARKING FUNCTIONS, AND AN EFFICIENT BIJECTIVE PROOF OF THE MATRIX-TREE THEOREM (STUDENT PAPER) FARBOD SHOKRIEH Abstract. Kirchhoff s matrix-tree theorem states that the number of spanning
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 informationA Little Beyond: Linear Algebra
A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two
More informationMATH 420 FINAL EXAM J. Beachy, 5/7/97
MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only
More informationThe number of homomorphisms from a finite group to a general linear group
The number of homomorphisms from a finite group to a general linear group Martin W. Liebeck Department of Mathematics Imperial College London SW7 2BZ England m.liebeck@ic.ac.uk Aner Shalev Institute of
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 informationMath 594. Solutions 5
Math 594. Solutions 5 Book problems 6.1: 7. Prove that subgroups and quotient groups of nilpotent groups are nilpotent (your proof should work for infinite groups). Give an example of a group G which possesses
More informationName: Solutions Final Exam
Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] All of
More informationAlgebra Exam Topics. Updated August 2017
Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have
More informationis an isomorphism, and V = U W. Proof. Let u 1,..., u m be a basis of U, and add linearly independent
Lecture 4. G-Modules PCMI Summer 2015 Undergraduate Lectures on Flag Varieties Lecture 4. The categories of G-modules, mostly for finite groups, and a recipe for finding every irreducible G-module of a
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 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 informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)
More informationSUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT
SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.
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 informationChip-Firing and Rotor-Routing on Z d and on Trees
FPSAC 2008 DMTCS proc. (subm.), by the authors, 1 12 Chip-Firing and Rotor-Routing on Z d and on Trees Itamar Landau, 1 Lionel Levine 1 and Yuval Peres 2 1 Department of Mathematics, University of California,
More informationMaximal non-commuting subsets of groups
Maximal non-commuting subsets of groups Umut Işık March 29, 2005 Abstract Given a finite group G, we consider the problem of finding the maximal size nc(g) of subsets of G that have the property that no
More informationAlgebra Exam Syllabus
Algebra Exam Syllabus The Algebra comprehensive exam covers four broad areas of algebra: (1) Groups; (2) Rings; (3) Modules; and (4) Linear Algebra. These topics are all covered in the first semester graduate
More informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
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 information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationNew Bounds for Partial Spreads of H(2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon
New Bounds for Partial Spreads of H2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon Ferdinand Ihringer Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Givat Ram, Jerusalem,
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 informationSpectral characterization of Signed Graphs
University of Primorska, Koper May 2015 Signed Graphs Basic notions on Signed Graphs Matrices of Signed Graphs A signed graph Γ is an ordered pair (G, σ), where G = (V (G), E(G)) is a graph and σ : E(G)
More informationMay 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.
Math 236H May 6, 2008 Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. 1. (15 points) Prove that the symmetric group S 4 is generated
More informationOn the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem
On the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem Bertram Kostant, MIT Conference on Representations of Reductive Groups Salt Lake City, Utah July 10, 2013
More informationBP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results
BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS DONALD M. DAVIS Abstract. We determine the BP -module structure, mod higher filtration, of the main part of the BP -homology of elementary 2- groups.
More informationLaplacians 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