Abstract
The author illustrates several results from the theory of elliptic curves, as well as the theory of chip-firing games on graphs. More specifically, in both of these cases, we obtain analogues of cyclotomic polynomials with several combinatorial and number theoretic properties. We also provide an analysis of zeta functions which highlights the connections between these two disparate fields.
Original language | English (US) |
---|---|
State | Published - 2007 |
Event | 19th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'07 - Tianjin, China Duration: Jul 2 2007 → Jul 6 2007 |
Other
Other | 19th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'07 |
---|---|
Country/Territory | China |
City | Tianjin |
Period | 7/2/07 → 7/6/07 |
Keywords
- Chip-firing games
- Cyclic languages
- Elliptic curves
- Finite fields
- Spanning trees
- Zeta functions