A finite group attached to the laplacian of a graph
Discrete Mathematics
Chip-Firing and the Critical Group of a Graph
Journal of Algebraic Combinatorics: An International Journal
Critical groups for complete multipartite graphs and Cartesian products of complete graphs
Journal of Graph Theory
Elliptic Curves: Number Theory and Cryptography, Second Edition
Elliptic Curves: Number Theory and Cryptography, Second Edition
Smith normal form and Laplacians
Journal of Combinatorial Theory Series B
Enumerating bases of self-dual matroids
Journal of Combinatorial Theory Series A
ICACM'11 Proceedings of the 2011 international conference on Applied & computational mathematics
Hi-index | 0.00 |
Let q be a power of a prime, and E be an elliptic curve defined over $\mathbb{F}_{q}$ . Such curves have a classical group structure, and one can form an infinite tower of groups by considering E over field extensions $\mathbb{F}_{q^{k}}$ for all k驴1. The critical group of a graph may be defined as the cokernel of L(G), the Laplacian matrix of G. In this paper, we compare elliptic curve groups with the critical groups of a certain family of graphs. This collection of critical groups also decomposes into towers of subgroups, and we highlight additional comparisons by using the Frobenius map of E over $\mathbb{F}_{q}$ .