Combinatorial aspects of elliptic curves

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Given an elliptic curve C, we study here the number N k = #C(F q k) of points of C over the finite field F q k. We obtain two combinatorial formulas for N k. In particular we prove that N k = -W k(q,t)

Original languageEnglish (US)
Title of host publicationFPSAC 2006 - Proceedings
Subtitle of host publication18th Annual International Conference on Formal Power Series and Algebraic Combinatorics
Pages233-242
Number of pages10
StatePublished - Dec 1 2006
Event18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006 - San Diego, CA, United States
Duration: Jun 19 2006Jun 23 2006

Other

Other18th Annual International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2006
Country/TerritoryUnited States
CitySan Diego, CA
Period6/19/066/23/06

Keywords

  • Elliptic curves
  • Finite fields
  • Lucas numbers
  • Spanning trees
  • Symmetric functions
  • Zeta functions

Fingerprint

Dive into the research topics of 'Combinatorial aspects of elliptic curves'. Together they form a unique fingerprint.

Cite this