Sage Days 71 Abstracts and Slides
Sunday
Sage Number Theory and Development, Alyson Deines (10:00-11:00)slides
This talk will have three parts. In the first, I will discuss what number theoretic constructs are implemented in Sage and how to use them. Next, I will compare Sage's functionality with Magma's functionality. In particular, some gaps in Sage. The last part is an introduction to Sage development using GitHub and the Trac server.
Zeta functions, Fernando Rodriguez Villegas (11:30-12:00)
Counting points using uniform p-adic integration, Immanuel Halupczok (12:15-12:45)slides
Given a variety
One way to prove this result uses
Iwasawa theory - a brief introduction, Jeanine Van Order (2:00-2:30) slides
I will present an overview of Iwasawa theory starting with the work of Iwasawa on
Some other recent developments and open problems will be discussed at the end of the lecture.
Overconvergent modular symbols, David Roe (2:45-3:15, slides)
I will give an introduction to overconvergent modular symbols, their implementation in Sage, and what remains to be done.
p-adic precision: theory, examples and application to some p-adic differential equations, Tristan Vaccon (3:45-4:15, slides)
As you already know, p-adic numbers can usually only be handled with finite precision, which yields the problems of determining the smallest precision needed or the loss of precision per operation. With X. Caruso and D. Roe, we have provided a new method to handle precision over p-adics that relies on differentials and first-order approximation. It provides results that are (essentially) optimals and do not depend on the choice of algorithm. We will present an illustration on how to use this method with the study of the computation of the determinant of a p-adic matrix.
We will also present the following application. In a joint work with P.Lairez, we have applied this method for the computation of solutions to some p-adic differential equations with separation of variables. These differential equations were studied as they are used to compute isogenies between elliptic curves.
Variations on Chabauty-Coleman I, Victor Flynn (4:30-5:00)
This will be a short introduction to main principles of using classical Chabauty-Coleman as a technique for finding rational points on curves, where the rank of the Jacobian is less than the genus of the curve (note that this will be an introduction to the main ideas of the technique, and will not about any specific implementation).
Computation of Hida families of ordinary cusp forms, Francesca Bianchi (8:00-8:15)
The first example of a
A family of Eisenstein polynomials generating totally ramified extensions, identification of extensions and construction of class fields, Maurizio Monge (8:20-8:35)
We present a family of special polynomials generating totally ramified extensions of local field
Zeta functions of quartic K3 surfaces over F_3, Edgar Costa (8:40-8:55, slides)
With the goal of doing a census of the Hasse--Weil zeta functions of quartic K3 surfaces over
Monday
A survey of p-adic point counting, Jan Tuitman (10:00-11:00, slides)
We will give a broad overview of p-adic methods to compute the zeta function of an algebraic variety.
Recent developments and applications of uniform p-adic integration, Raf Cluckers (11:30-12:30)
As a concrete variant of motivic integration, we will discuss uniform
Tuesday
Iwasawa theory II, Chris Wuthrich (10:00-11:00, notes slides)
I intend to show what sage can do with
Non-ordinary families of overconvergent modular symbols, Ander Steele (11:30-12:30)
Abstract: I'll describe an approach to computing families of modular symbols in the higher slope case. I'll also survey the recent work of Robert Harron, Robert Pollack, et. al. on computations of ordinary families.
Wednesday
Variations on Chabauty-Coleman II, Jennifer Balakrishnan (10:00-11:00)
I will discuss the computation of some iterated Coleman integrals that play a role in Kim's nonabelian Chabauty method to find rational points on curves. In particular, I will give a few examples in the case where the rank of the Jacobian is equal to the genus of the curve where this has been used in joint work with Dogra and Mueller to explicitly find rational points.
p-adic Floats, Xavier Caruso (11:30-12:30)
Floating point arithmetic is by far the most common implementation of real numbers on computers. This is in complete opposition with the