|
Size: 2689
Comment:
|
← Revision 47 as of 2017-02-05 18:05:04 ⇥
Size: 15
Comment: redirects to [[ams]]
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| = AMS Special Session on Sage and Mathematical Research Using Open Source Software = The purpose of this session is to bring together those who develop and/or use or would like to use the mathematical software system [[http://www.sagemath.org/|Sage]] and related open source software in their research. The Sage session abstracts will be published in the [[http://www.sigsam.org/cca/|CCA]]. === Organizers === * David Saunders, University of Delaware, <saunders@udel.edu> * David Harvey, New York University, <dmharvey@cims.nyu.edu> * David Joyner, U.S. Naval Academy, <wdjoyner@gmail.com> The time slots scheduled are: * Thursday, January 8, 2009: 8:00-10:50 AM * Thursday, January 8, 2009: 1:00-5:50 PM === Attendees (tentative) === * Jason Grout, Iowa State University <jason-sage@creativetrax.com> * Kiran Kedlaya, MIT * Nathan Ryan <nathan.ryan@bucknell.edu> * Karl Crisman <Karl.Crisman@gordon.edu> * [[http://www.math.umb.edu/~anoel/|Alfred Noel]] * Gregory Bard, Fordham, <bard@fordham.edu> * Marshall Hampton <mhampton@d.umn.edu> * [[http://www4.ncsu.edu/~kaltofen/|Erich Kaltofen]] * Qing Xiang <xiang@math.udel.edu> * Robert Miller, University of Washington, <rlmillster@gmail.com> * [[http://www.ens-lyon.fr/~gvillard|Gilles Villard]] * Dan Roche, Univ. Waterloo, droche@cs.uwaterloo.ca AMS session [[http://www.ams.org/amsmtgs/2110_program_ss2.html#title|webpage]] === Tentative schedule === * 8:00- 8:20 Crisman-102 - Undergraduate research in the mathematics of voting and choice using Sage. * 8:30- 8:50 Grout-1841 - Sage in an early-graduate research course investigating the minimum rank problem * 9:00- 9:20 Harvey-1822 - zn_poly: a library for polynomial arithmetic. * 9:30- 9:50 Roche-1837 - Fast multiplication with low space complexity. * 10:00-10:20 Hampton-20 - Solutions, bounds, and finiteness of polynomial systems in Sage. * 10:30-10:50 Kaltofen-2094 - Rump’s model problem and the computer search for records in number theory. * 1:00- 1:20 Ryan-266 - Siegel modular forms in Sage. * 1:30- 1:50 Noel-272 - Nilpotent orbits associated to Coxeter cells. * 2:00- 2:20 Joyner/Miller-758 - Coding theory and combinatorics in Sage. * 2:30- 2:50 Villard-1571 - Numerical analysis tools for LLL lattice basis reduction. (cancelled - sorry) * 3:00- 3:30 break * 3:30- 3:50 Bard-1959 - Ultra-sparse matrix reduction to reduced row-echelon form for matrices over GF(2) * 4:00- 4:20 Xiang-1752 - Modular ranks of the adjacency matrices of strongly regular graphs arising from semifields. * 4:30- 4:50 Saunders-2007 - On matrix rank modulo small primes. |
#REDIRECT ams |
