The critical group of a graph
|
|
- Felix Ball
- 5 years ago
- Views:
Transcription
1 The critical group of a graph Peter Sin Texas State U., San Marcos, March th, 4.
2 Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs with known critical groups Paley graphs Critical group of Paley graphs
3 This talk is about the critical group, a finite abelian group associated with a finite graph.
4 This talk is about the critical group, a finite abelian group associated with a finite graph. The critical group is defined using the Laplacian matrix of the graph.
5 This talk is about the critical group, a finite abelian group associated with a finite graph. The critical group is defined using the Laplacian matrix of the graph. The critical group arises in several contexts;
6 This talk is about the critical group, a finite abelian group associated with a finite graph. The critical group is defined using the Laplacian matrix of the graph. The critical group arises in several contexts; in physics: the Abelian Sandpile model (Bak-Tang-Wiesenfeld, Dhar);
7 This talk is about the critical group, a finite abelian group associated with a finite graph. The critical group is defined using the Laplacian matrix of the graph. The critical group arises in several contexts; in physics: the Abelian Sandpile model (Bak-Tang-Wiesenfeld, Dhar); its combinatorial variant: the Chip-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs);
8 This talk is about the critical group, a finite abelian group associated with a finite graph. The critical group is defined using the Laplacian matrix of the graph. The critical group arises in several contexts; in physics: the Abelian Sandpile model (Bak-Tang-Wiesenfeld, Dhar); its combinatorial variant: the Chip-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs); in arithmetic geometry: Picard group, graph Jacobian (Lorenzini).
9 This talk is about the critical group, a finite abelian group associated with a finite graph. The critical group is defined using the Laplacian matrix of the graph. The critical group arises in several contexts; in physics: the Abelian Sandpile model (Bak-Tang-Wiesenfeld, Dhar); its combinatorial variant: the Chip-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs); in arithmetic geometry: Picard group, graph Jacobian (Lorenzini). We ll consider the problem of computing the critical group for families of graphs.
10 This talk is about the critical group, a finite abelian group associated with a finite graph. The critical group is defined using the Laplacian matrix of the graph. The critical group arises in several contexts; in physics: the Abelian Sandpile model (Bak-Tang-Wiesenfeld, Dhar); its combinatorial variant: the Chip-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs); in arithmetic geometry: Picard group, graph Jacobian (Lorenzini). We ll consider the problem of computing the critical group for families of graphs. The Paley graphs are a very important class of strongly regular graphs arising from finite fields.
11 This talk is about the critical group, a finite abelian group associated with a finite graph. The critical group is defined using the Laplacian matrix of the graph. The critical group arises in several contexts; in physics: the Abelian Sandpile model (Bak-Tang-Wiesenfeld, Dhar); its combinatorial variant: the Chip-firing game (Björner-Lovasz-Shor, Gabrielov, Biggs); in arithmetic geometry: Picard group, graph Jacobian (Lorenzini). We ll consider the problem of computing the critical group for families of graphs. The Paley graphs are a very important class of strongly regular graphs arising from finite fields. We ll say something about the computation of their critical groups, which involves groups, characters and number theory.
12 Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs with known critical groups Paley graphs Critical group of Paley graphs
13 Pierre-Simon Laplace (749-87)
14 Γ = (V, E) simple, connected graph.
15 Γ = (V, E) simple, connected graph. L = D A, A adjacency matrix, D degree matrix.
16 Γ = (V, E) simple, connected graph. L = D A, A adjacency matrix, D degree matrix. Think of L as a linear map L : Z V Z V.
17 Γ = (V, E) simple, connected graph. L = D A, A adjacency matrix, D degree matrix. Think of L as a linear map L : Z V Z V. rank(l) = V.
18 Critical group Z V / Im(L) = Z K (Γ)
19 Critical group Z V / Im(L) = Z K (Γ) The finite group K (Γ) is called the critical group of Γ.
20 Critical group Z V / Im(L) = Z K (Γ) The finite group K (Γ) is called the critical group of Γ. Let ε : Z V Z, v V a vv v V a v.
21 Critical group Z V / Im(L) = Z K (Γ) The finite group K (Γ) is called the critical group of Γ. Let ε : Z V Z, v V a vv v V a v. L(ker(ε)) ker(ε), and K (Γ) = Ker(ε)/L(Ker(ε))
22 Kirchhoff s Matrix-Tree Theorem Gustav Kirchhoff (84-887) Kirchhoff s Matrix Tree Theorem For any connected graph Γ, the number of spanning trees is equal to det( L), where L is obtained from L be deleting the row and column corrresponding to any chosen vertex.
23 Kirchhoff s Matrix-Tree Theorem Gustav Kirchhoff (84-887) Kirchhoff s Matrix Tree Theorem For any connected graph Γ, the number of spanning trees is equal to det( L), where L is obtained from L be deleting the row and column corrresponding to any chosen vertex. Also, det( L) = K (Γ) = V V j= λ j.
24 Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs with known critical groups Paley graphs Critical group of Paley graphs
25 Rules - 5 A configuration is an assignment of a nonnegative integer s(v) to each round vertex v and v s(v) to the square vertex.
26 Rules - 5 A configuration 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.
27 Rules A configuration 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.
28 Rules A configuration 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.
29 Rules A configuration 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.
30 Rules A configuration 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. A configuration is stable if no round vertex can be fired.
31 Rules A configuration 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. A configuration is stable if no round vertex can be fired. A configuration is recurrent if there is a sequence of firings that lead to the same configuration.
32 Rules A configuration 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. A configuration is stable if no round vertex can be fired. A configuration is recurrent if there is a sequence of firings that lead to the same configuration. A configuration is critical if it is both recurrent and stable.
33 Sample game -
34 Sample game - -4
35 Sample game
36 Sample game
37 Sample game
38 Sample game
39 Sample game
40 Sample game -
41 Sample game - -4
42 Sample game
43 Sample game
44 Sample game
45 Sample game
46 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.
47 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) = x(v) deg(v) + (v,w) E x(w)
48 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) = x(v) deg(v) + (v,w) E x(w) s = s Lx
49 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) = x(v) deg(v) + (v,w) E x(w) s = s Lx Theorem Let s be a configuration in the chip-firing game on a connected graph G. Then there is a unique critical configuration which can be reached from s.
50 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) = x(v) deg(v) + (v,w) E x(w) s = s Lx Theorem Let s be a configuration in the chip-firing game on a connected graph G. Then there is a unique critical configuration which can be reached from s. Theorem The set of critical configurations has a natural group operation making it isomorphic to the critical group K (Γ).
51 Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs with known critical groups Paley graphs Critical group of Paley graphs
52 Equivalence and Smith normal form Henry John Stephen Smith (86-883) Given an integer matrix X, there exist unimodular integer matrices P and Q such that [ ] Y PXQ =, Y = diag(s, s,... s r ), s s s r.
53 Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs with known critical groups Paley graphs Critical group of Paley graphs
54 Trees, K (Γ) = {}.
55 Trees, K (Γ) = {}. Complete graphs, K (K n ) = (Z/nZ) n.
56 Trees, K (Γ) = {}. Complete graphs, K (K n ) = (Z/nZ) n. n-cycle, n 3, K (C n ) = Z/nZ.
57 Trees, K (Γ) = {}. Complete graphs, K (K n ) = (Z/nZ) n. n-cycle, n 3, K (C n ) = Z/nZ. Wheel graphs W n, K (Γ) = (Z/l n ), if n is odd (Biggs). Here l n is a Lucas number.
58 Trees, K (Γ) = {}. Complete graphs, K (K n ) = (Z/nZ) n. n-cycle, n 3, K (C n ) = Z/nZ. Wheel graphs W n, K (Γ) = (Z/l n ), if n is odd (Biggs). Here l n is a Lucas number. Complete multipartite graphs (Jacobson, Niedermaier, Reiner).
59 Trees, K (Γ) = {}. Complete graphs, K (K n ) = (Z/nZ) n. n-cycle, n 3, K (C n ) = Z/nZ. Wheel graphs W n, K (Γ) = (Z/l n ), if n is odd (Biggs). Here l n is a Lucas number. Complete multipartite graphs (Jacobson, Niedermaier, Reiner). Conference graphs on a square-free number of vertices (Lorenzini).
60 Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs with known critical groups Paley graphs Critical group of Paley graphs
61 Raymond E. A. C. Paley (97-33)
62 Paley graphs P(q) Vertex set is F q, q = p t (mod 4)
63 Paley graphs P(q) Vertex set is F q, q = p t (mod 4) S = set of nonzero squares in F q
64 Paley graphs P(q) Vertex set is F q, q = p t (mod 4) S = set of nonzero squares in F q two vertices x and y are joined by an edge iff x y S.
65 Some Paley graphs (from Wolfram Mathworld)
66 Paley graphs are Cayley graphs We can view P(q) as a Cayley graph on (Fq, +) with connecting set S Arthur Cayley (8-95)
67 Paley graphs are strongly regular graphs It is well known and easily checked that P(q) is a strongly regular graph and that its eigenvalues are k = q, r = + q and s = q, with multiplicities, q and q, respectively.
68 Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs with known critical groups Paley graphs Critical group of Paley graphs
69 David Chandler and Qing Xiang
70 Symmetries K (P(q)) = q where µ = q 4. ( ) q + q k ( ) q q k = q q 3 µ k,
71 Symmetries K (P(q)) = q where µ = q 4. Aut(P(q)) F q S. ( ) q + q k ( ) q q k = q q 3 µ k,
72 Symmetries K (P(q)) = q where µ = q 4. Aut(P(q)) F q S. K (P(q)) = K (P(q)) p K (P(q)) p ( ) q + q k ( ) q q k = q q 3 µ k,
73 Symmetries K (P(q)) = q where µ = q 4. Aut(P(q)) F q S. K (P(q)) = K (P(q)) p K (P(q)) p ( ) q + q k ( ) q q k = q q 3 µ k, Use F q -action to help compute p -part.
74 Symmetries K (P(q)) = q where µ = q 4. Aut(P(q)) F q S. K (P(q)) = K (P(q)) p K (P(q)) p ( ) q + q k ( ) q q k = q q 3 µ k, Use F q -action to help compute p -part. Use S-action to help compute p-part.
75 p -part Joseph Fourier (768-83)
76 Discrete Fourier Transform X, complex character table of (F q, +)
77 Discrete Fourier Transform X, complex character table of (F q, +) X is a matrix over Z[ζ], ζ a complex primitive p-th root of unity.
78 Discrete Fourier Transform X, complex character table of (F q, +) X is a matrix over Z[ζ], ζ a complex primitive p-th root of unity. q XXt = I.
79 Discrete Fourier Transform X, complex character table of (F q, +) X is a matrix over Z[ζ], ζ a complex primitive p-th root of unity. q XXt = I. q XLX t = diag(k ψ(s)) ψ, ()
80 Discrete Fourier Transform X, complex character table of (F q, +) X is a matrix over Z[ζ], ζ a complex primitive p-th root of unity. q XXt = I. q XLX t = diag(k ψ(s)) ψ, () Interpret this as PLQ-equivalence over suitable local rings of integers.
81 Theorem K (P(q)) p = (Z/µZ) µ, where µ = q 4.
82 The p-part Carl Gustav Jacob Jacobi (84-5)
83 F q -action R = Z p [ξ q ], pr maximal ideal of R, R/pR = F q.
84 F q -action R = Z p [ξ q ], pr maximal ideal of R, R/pR = F q. T : F q R Teichmüller character.
85 F q -action R = Z p [ξ q ], pr maximal ideal of R, R/pR = F q. T : F q R Teichmüller character. T generates the cyclic group Hom(F q, R ).
86 F q -action R = Z p [ξ q ], pr maximal ideal of R, R/pR = F q. T : F q R Teichmüller character. T generates the cyclic group Hom(F q, R ). Let R Fq be the free R-module with basis indexed by the elements of F q ; write the basis element corresponding to x F q as [x].
87 F q -action R = Z p [ξ q ], pr maximal ideal of R, R/pR = F q. T : F q R Teichmüller character. T generates the cyclic group Hom(F q, R ). Let R Fq be the free R-module with basis indexed by the elements of F q ; write the basis element corresponding to x F q as [x]. F q acts on R Fq, permuting the basis by field multiplication,
88 F q -action R = Z p [ξ q ], pr maximal ideal of R, R/pR = F q. T : F q R Teichmüller character. T generates the cyclic group Hom(F q, R ). Let R Fq be the free R-module with basis indexed by the elements of F q ; write the basis element corresponding to x F q as [x]. F q acts on R Fq, permuting the basis by field multiplication, R Fq decomposes as the direct sum R[] R F q module with the regular module for F q. of a trivial
89 F q -action R = Z p [ξ q ], pr maximal ideal of R, R/pR = F q. T : F q R Teichmüller character. T generates the cyclic group Hom(F q, R ). Let R Fq be the free R-module with basis indexed by the elements of F q ; write the basis element corresponding to x F q as [x]. F q acts on R Fq, permuting the basis by field multiplication, R Fq decomposes as the direct sum R[] R F q module with the regular module for F q. R F q = q i= E i, E i affording T i. of a trivial
90 F q -action R = Z p [ξ q ], pr maximal ideal of R, R/pR = F q. T : F q R Teichmüller character. T generates the cyclic group Hom(F q, R ). Let R Fq be the free R-module with basis indexed by the elements of F q ; write the basis element corresponding to x F q as [x]. F q acts on R Fq, permuting the basis by field multiplication, R Fq decomposes as the direct sum R[] R F q module with the regular module for F q. R F q = q i= E i, E i affording T i. A basis element for E i is e i = T i (x )[x]. of a trivial x F q
91 S-action Consider action S on R F q. T i = T i+k on S.
92 S-action Consider action S on R F q. T i = T i+k on S. S-isotypic components on R F q are each -dimensional.
93 S-action Consider action S on R F q. T i = T i+k on S. S-isotypic components on R F q are each -dimensional. {e i, e i+k } is basis of M i = E i + E i+k
94 S-action Consider action S on R F q. T i = T i+k on S. S-isotypic components on R F q are each -dimensional. {e i, e i+k } is basis of M i = E i + E i+k The S-fixed subspace M has basis {, [], e k }.
95 S-action Consider action S on R F q. T i = T i+k on S. S-isotypic components on R F q are each -dimensional. {e i, e i+k } is basis of M i = E i + E i+k The S-fixed subspace M has basis {, [], e k }. L is S-equivariant endomorphisms of R Fq, L([x]) = k[x] s S[x + s], x F q.
96 S-action Consider action S on R F q. T i = T i+k on S. S-isotypic components on R F q are each -dimensional. {e i, e i+k } is basis of M i = E i + E i+k The S-fixed subspace M has basis {, [], e k }. L is S-equivariant endomorphisms of R Fq, L([x]) = k[x] s S[x + s], x F q. L maps each M i to itself.
97 Jacobi Sums The Jacobi sum of two nontrivial characters T a and T b is J(T a, T b ) = x F q T a (x)t b ( x).
98 Jacobi Sums The Jacobi sum of two nontrivial characters T a and T b is J(T a, T b ) = x F q T a (x)t b ( x). Lemma Suppose i q and i, k. Then L(e i ) = (qe i J(T i, T k )e i+k )
99 Jacobi Sums The Jacobi sum of two nontrivial characters T a and T b is J(T a, T b ) = x F q T a (x)t b ( x). Lemma Suppose i q and i, k. Then L(e i ) = (qe i J(T i, T k )e i+k ) Lemma (i) L() =. (ii) L(e k ) = ( q([] e k)). (iii) L([]) = (q[] e k ).
100 Corollary The Laplacian matrix L is equivalent over R to the diagonal matrix with diagonal entries J(T i, T k ), for i =,..., q and i k, two s and one zero.
101 Carl Friedrich Gauss ( ) Ludwig Stickelberger (85-936)
102 Gauss and Jacobi Gauss sums: If χ Hom(F q, R ), g(χ) = χ(y)ζ tr(y), y F q where ζ is a primitive p-th root of unity in some extension of R.
103 Gauss and Jacobi Gauss sums: If χ Hom(F q, R ), g(χ) = y F q χ(y)ζ tr(y), where ζ is a primitive p-th root of unity in some extension of R. Lemma If χ and ψ are nontrivial multiplicative characters of F q such that χψ is also nontrivial, then J(χ, ψ) = g(χ)g(ψ). g(χψ)
104 Stickelberger s Congruence Theorem For < a < q, write a p-adically as a = a + a p + + a t p t. Then the number of times that p divides g(t a ) is a + a + + a t.
105 Stickelberger s Congruence Theorem For < a < q, write a p-adically as a = a + a p + + a t p t. Then the number of times that p divides g(t a ) is a + a + + a t. Theorem Let a, b Z/(q )Z, with a, b, a + b (mod q ). Then number of times that p divides J(T a, T b ) is equal to the number of carries in the addition a + b (mod q ) when a and b are written in p-digit form.
106 The Counting Problem k = (q )
107 The Counting Problem k = (q ) What is the number of i, i q, i k such that adding i to q modulo q involves exactly λ carries?
108 The Counting Problem k = (q ) What is the number of i, i q, i k such that adding i to q modulo q involves exactly λ carries? This problem can be solved by applying the transfer matrix method.
109 The Counting Problem k = (q ) What is the number of i, i q, i k such that adding i to q modulo q involves exactly λ carries? This problem can be solved by applying the transfer matrix method. Reformulate as a count of closed walks on a certain directed graph.
110 The Counting Problem k = (q ) What is the number of i, i q, i k such that adding i to q modulo q involves exactly λ carries? This problem can be solved by applying the transfer matrix method. Reformulate as a count of closed walks on a certain directed graph. Transfer matrix method yields the generating function for our counting problem from the adjacency matrix of the digraph.
111 Theorem Let q = p t be a prime power congruent to modulo 4. Then the number of p-adic elementary divisors of L(P(q)) which are equal to p λ, λ < t, is f (t, λ) = min{λ,t λ} i= t t i ( t i i )( ) ( ) t i p + t i ( p) i. λ i The number of p-adic elementary divisors of L(P(q)) which are ) t equal to p t is. ( p+
112 Example:K (P(5 3 )) f (3, ) = 3 3 = 7
113 Example:K (P(5 3 )) f (3, ) = 3 3 = 7 f (3, ) = ( 3 ) ( )( ) 5 3 = 36.
114 Example:K (P(5 3 )) f (3, ) = 3 3 = 7 f (3, ) = ( 3 ) ( )( ) 5 3 = 36. K (P(5 3 )) = (Z/3Z) 6 (Z/5Z) 36 (Z/5Z) 36 (Z/5Z) 5.
115 Example:K (P(5 4 )) f (4, ) = 3 4 = 8.
116 Example:K (P(5 4 )) f (4, ) = 3 4 = 8. f (4, ) = ( 4 ) ( 3 )( ) 5 3 = 44.
117 Example:K (P(5 4 )) f (4, ) = 3 4 = 8. f (4, ) = ( 4 ) ( 3 )( ) 5 3 = 44. f (4, ) = ( 4 ) ( 3 )( ) ( )( ) 5 = 76.
118 Example:K (P(5 4 )) f (4, ) = 3 4 = 8. f (4, ) = ( 4 ) ( 3 )( ) 5 3 = 44. f (4, ) = ( 4 ) ( 3 )( ) ( )( ) 5 = 76. K (P(5 4 )) = (Z/56Z) 3 (Z/5Z) 44 (Z/5Z) 76 (Z/5Z) 44 (Z/65Z) 79.
119 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 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 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 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 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 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 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 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 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 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 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 informationCharacters (definition)
Characters (definition) Let p be a prime. A character on F p is a group homomorphism F p C. Example The map a 1 a F p denoted by ɛ. is called the trivial character, henceforth Example If g is a generator
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 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 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 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 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 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 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 informationCyclotomic schemes and related problems
momihara@educkumamoto-uacjp 16-06-2014 Definition Definition: Cayley graph G: a finite abelian group D: an inverse-closed subset of G (0 D and D = D) E := {(x, y) x, y G, x y D} (G, E) is called a Cayley
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 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 informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationReachability of recurrent positions in the chip-firing game
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2015-10. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationRings, Paths, and Paley Graphs
Spectral Graph Theory Lecture 5 Rings, Paths, and Paley Graphs Daniel A. Spielman September 12, 2012 5.1 About these notes These notes are not necessarily an accurate representation of what happened in
More informationTHE CRITICAL GROUPS OF A FAMILY OF GRAPHS AND ELLIPTIC CURVES OVER FINITE FIELDS
THE CRITICAL GROUPS OF A FAMILY OF GRAPHS AND ELLIPTIC CURVES OVER FINITE FIELDS GREGG MUSIKER Abstract. Let q be a power of a prime, and E be an elliptic curve defined over F q. Such curves have a classical
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 informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationProperties of Ramanujan Graphs
Properties of Ramanujan Graphs Andrew Droll 1, 1 Department of Mathematics and Statistics, Jeffery Hall, Queen s University Kingston, Ontario, Canada Student Number: 5638101 Defense: 27 August, 2008, Wed.
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 informationA mod p 3 analogue of a theorem of Gauss on binomial coefficients
A mod p 3 analogue of a theorem of Gauss on binomial coefficients Dalhousie University, Halifax, Canada ELAZ, Schloß Schney, August 16, 01 Joint work with John B. Cosgrave Dublin, Ireland We begin with
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 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 informationLatin square determinants and permanents Ken Johnson Penn State Abington College (Joint work with D. Donovan and I. Wanless)
Latin square determinants and permanents Ken Johnson Penn State Abington College (Joint work with D. Donovan and I. Wanless) Outline 1)The basic idea 2) Motivation 3) Summary of the group case 4) Results
More informationThree-dimensional imprimitive representations of PSL 2 (Z) and their associated vector-valued modular forms
Three-dimensional imprimitive representations of PSL 2 (Z) and their associated vector-valued modular forms U-M Automorphic forms workshop, March 2015 1 Definition 2 3 Let Γ = PSL 2 (Z) Write ( 0 1 S =
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 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 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 informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
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 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 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 informationarxiv: v1 [math.co] 15 Jun 2009
SANDPILE GROUPS AND SPANNING TREES OF DIRECTED LINE GRAPHS arxiv:0906.2809v1 [math.co] 15 Jun 2009 LIONEL LEVINE Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed
More informationGalois groups with restricted ramification
Galois groups with restricted ramification Romyar Sharifi Harvard University 1 Unique factorization: Let K be a number field, a finite extension of the rational numbers Q. The ring of integers O K of K
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 informationOn The Weights of Binary Irreducible Cyclic Codes
On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:
More informationRepresentations Associated to the Group Matrix
Brigham Young University BYU ScholarsArchive All Theses and Dissertations 014-0-8 Representations Associated to the Group Matrix Joseph Aaron Keller Brigham Young University - Provo Follow this and additional
More informationAn Additive Characterization of Fibers of Characters on F p
An Additive Characterization of Fibers of Characters on F p Chris Monico Texas Tech University Lubbock, TX c.monico@ttu.edu Michele Elia Politecnico di Torino Torino, Italy elia@polito.it January 30, 2009
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationCommutative Association Schemes Whose Symmetrizations Have Two Classes*
Journal of Algebraic Combinatorics 5 (1996), 47-55 1996 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Commutative Association Schemes Whose Symmetrizations Have Two Classes* SUNG
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 informationA note on the Isomorphism Problem for Monomial Digraphs
A note on the Isomorphism Problem for Monomial Digraphs Aleksandr Kodess Department of Mathematics University of Rhode Island kodess@uri.edu Felix Lazebnik Department of Mathematical Sciences University
More informationAlgebra SEP Solutions
Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since
More informationGauss periods and related Combinatorics
momihara@educkumamoto-uacjp 23-01-2015 Fundamentals of characters of abelian groups A character ψ of G is a homomorphism from G to C Ĝ: the set of all characters of G e: the exponent of G Remark The image
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 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 informationRepresentation Theory
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 Paper 1, Section II 19I 93 (a) Define the derived subgroup, G, of a finite group G. Show that if χ is a linear character
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 informationRIEMANN-ROCH AND ABEL-JACOBI THEORY ON A FINITE GRAPH
RIEMANN-ROCH AND ABEL-JACOBI THEORY ON A FINITE GRAPH MATTHEW BAKER AND SERGUEI NORINE Abstract. It is well-known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Mednykh A. D. (Sobolev Institute of Math) Laplacian for Graphs 27 June - 03 July 2015 1 / 30 Laplacians of Graphs, Spectra and Laplacian polynomials Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk
More informationCHARACTERS OF FINITE GROUPS.
CHARACTERS OF FINITE GROUPS. ANDREI YAFAEV As usual we consider a finite group G and the ground field F = C. Let U be a C[G]-module and let g G. Then g is represented by a matrix [g] in a certain basis.
More informationResearch Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
Applied Mathematics Volume 20, Article ID 423163, 14 pages doi:101155/20/423163 Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
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 informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationFundamental theorem of modules over a PID and applications
Fundamental theorem of modules over a PID and applications Travis Schedler, WOMP 2007 September 11, 2007 01 The fundamental theorem of modules over PIDs A PID (Principal Ideal Domain) is an integral domain
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationSANDPILE GROUPS AND SPANNING TREES OF DIRECTED LINE GRAPHS
SANDPILE GROUPS AND SPANNING TREES OF DIRECTED LINE GRAPHS LIONEL LEVINE arxiv:0906.2809v2 [math.co] 6 Apr 2010 Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed
More informationAlgebra Questions. May 13, Groups 1. 2 Classification of Finite Groups 4. 3 Fields and Galois Theory 5. 4 Normal Forms 9
Algebra Questions May 13, 2013 Contents 1 Groups 1 2 Classification of Finite Groups 4 3 Fields and Galois Theory 5 4 Normal Forms 9 5 Matrices and Linear Algebra 10 6 Rings 11 7 Modules 13 8 Representation
More informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin National University of Ireland, Galway 14 March 2012 Outline 1 (Finite) Projective planes 2 Symmetric Designs 3 Difference sets 4 Doubly transitive
More informationMath 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank
Math 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank David Glickenstein November 3, 4 Representing graphs as matrices It will sometimes be useful to represent graphs
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More 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 informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationMath 306 Topics in Algebra, Spring 2013 Homework 7 Solutions
Math 306 Topics in Algebra, Spring 203 Homework 7 Solutions () (5 pts) Let G be a finite group. Show that the function defines an inner product on C[G]. We have Also Lastly, we have C[G] C[G] C c f + c
More informationTREVOR HYDE AND JOSEPH KRAISLER
CIRCULANT q-butson HADAMARD MATRICES TREVOR HYDE AND JOSEPH KRAISLER ABSTRACT. If q = p n is a prime power, then a d-dimensional q-butson Hadamard matrix H is a d d matrix with all entries qth roots of
More informationAlgebraic Constructions of Graphs
Spectral Graph Theory Lecture 15 Algebraic Constructions of Graphs Daniel A. Spielman October 17, 2012 15.1 Overview In this lecture, I will explain how to make graphs from linear error-correcting codes.
More informationPostmodern Primality Proving
Preda Mihăilescu (University of Göttingen) Postmodern Primality Proving June 28, 2013 1 / 29 Postmodern Primality Proving Preda Mihăilescu Mathematical Institute, University of Göttingen, Germany June
More informationAbstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications
1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the
More informationA PROOF OF BURNSIDE S p a q b THEOREM
A PROOF OF BURNSIDE S p a q b THEOREM OBOB Abstract. We prove that if p and q are prime, then any group of order p a q b is solvable. Throughout this note, denote by A the set of algebraic numbers. We
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 informationStability in Chip-Firing Games. A Thesis Presented to The Division of Mathematics and Natural Sciences Reed College
Stability in Chip-Firing Games A Thesis Presented to The Division of Mathematics and Natural Sciences Reed College In Partial Fulfillment of the Requirements for the Degree Bachelor of Arts Tian Jiang
More informationLectures 15: Cayley Graphs of Abelian Groups
U.C. Berkeley CS294: Spectral Methods and Expanders Handout 15 Luca Trevisan March 14, 2016 Lectures 15: Cayley Graphs of Abelian Groups In which we show how to find the eigenvalues and eigenvectors of
More informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationThe MacWilliams Identities
The MacWilliams Identities Jay A. Wood Western Michigan University Colloquium March 1, 2012 The Coding Problem How to ensure the integrity of a message transmitted over a noisy channel? Cleverly add redundancy.
More informationAN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS
AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS The integers are the set 1. Groups, Rings, and Fields: Basic Examples Z := {..., 3, 2, 1, 0, 1, 2, 3,...}, and we can add, subtract, and multiply
More informationOn metacyclic extensions
On metacyclic extensions Masanari Kida 1 Introduction A group G is called metacyclic if it contains a normal cyclic subgroup N such that the quotient group G/N is also cyclic. The category of metacyclic
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 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 informationFORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS
Sairaiji, F. Osaka J. Math. 39 (00), 3 43 FORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS FUMIO SAIRAIJI (Received March 4, 000) 1. Introduction Let be an elliptic curve over Q. We denote by ˆ
More informationFirst we introduce the sets that are going to serve as the generalizations of the scalars.
Contents 1 Fields...................................... 2 2 Vector spaces.................................. 4 3 Matrices..................................... 7 4 Linear systems and matrices..........................
More informationMATH 430 PART 2: GROUPS AND SUBGROUPS
MATH 430 PART 2: GROUPS AND SUBGROUPS Last class, we encountered the structure D 3 where the set was motions which preserve an equilateral triangle and the operation was function composition. We determined
More informationCYCLOTOMIC FIELDS CARL ERICKSON
CYCLOTOMIC FIELDS CARL ERICKSON Cyclotomic fields are an interesting laboratory for algebraic number theory because they are connected to fundamental problems - Fermat s Last Theorem for example - and
More informationReal representations
Real representations 1 Definition of a real representation Definition 1.1. Let V R be a finite dimensional real vector space. A real representation of a group G is a homomorphism ρ VR : G Aut V R, where
More informationD-MATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions.
D-MAH Algebra II FS18 Prof. Marc Burger Solution 26 Cyclotomic extensions. In the following, ϕ : Z 1 Z 0 is the Euler function ϕ(n = card ((Z/nZ. For each integer n 1, we consider the n-th cyclotomic polynomial
More informationOn non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
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 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 informationp-ary Weight problems in designs, coding, and cryptography (preceded by a brief research overview)
p-ary Weight problems in designs, coding, and cryptography (preceded by a brief research overview) Henk Hollmann Singapore, Nanyang Technological University, 29 Sept. 2010 (mostly joint work with Qing
More informationQuantum walk algorithms
Quantum walk algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 28 September 2011 Randomized algorithms Randomness is an important tool in computer science Black-box problems
More information