Differences between revisions 33 and 34
Revision 33 as of 2008-09-29 17:43:46
Size: 2491
Editor: DavidJoyner
Comment:
Revision 34 as of 2008-09-29 17:46:41
Size: 2657
Editor: DavidJoyner
Comment:
Deletions are marked like this. Additions are marked like this.
Line 43: Line 43:
 * 1:00- 1:20 Ryan-266 - Siegel modular forms
 * 1:30- 1:50 Noel-272 - nilpotent orbit, weyl gp, atlas of lie gps and reps
 * 2:00- 2:20 Joyner/Miller-758 - coding theory
 * 2:30- 2:50 Villard-1571 - LLL and floating point
 * 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.
Line 48: Line 48:
 * 3:30- 3:50 Bard-1959 - sparse elim over gf2, row echelon form
 * 4:00- 4:20 Xiang-1752 - p-ranks, strongly regular graphs from semi-fields
 * 4:30- 4:50 Saunders-2007 - p-ranks computation
 * 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.

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

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)

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.
  • 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.

ams-sage (last edited 2017-02-05 18:05:04 by mrennekamp)