The Computer Algebra Group at Simon Fraser

Text Size: ππππ
2024 Meetings 2023 Meetings 2022 Meetings 2021 Meetings 2020 Meetings 2019 Meetings 2018 Meetings 2017 Meetings 2016 Meetings 2015 Meetings 2014 Meetings 2013 Meetings 2012 Meetings 2011 Meetings 2010 Meetings 2009 Meetings 2008 Meetings 2007 Meetings 2006 Meetings 2005 Meetings 2004 Meetings 2003 Meetings 2002 Meetings 2001 Meetings 2000 Meetings 1999 Meetings 1998 Meetings

Computer Algebra Group Meetings and Seminars at SFU

CAG Schedule for 2012

February 2012
     1 Christian Kattenthaler: Department of Mathematics, University of Vienna
	A method for determining the mod-2k behaviour of (certain) recursive sequences.

March 2012
    29 Jeff Sommars: Strong Divisibility, Cyclotomic Polynomials, and Iterated Polynomials.

April 2012
    12  Steve Kieffer: Computability in Algebraic Number Theory: Hensel to Zassenhaus
    30  Marc Moreno Maza: From Multicore to Manycore Architectures: The Reduction of 
Parallelization Overheads and its Impact on Implementing Polynomial Arithmetic

June 2012
    20 Soo Go: Sparse polynomial interpolation and the fast Euclidean algorithm.
    20 Michael Monagan: POLY: A new data structure for Maple 17

July 2012
     9 Paul Vrbik: On Fulton's algorithm for computing intersection multiplicities.
     9 Michael Monagan Ben-Or/Tiwari interpolation using discrete logarithms.
    11 Paul Vrbik: Inversion modulo zero dimensional regular chains.
    11 Roman Pearce: Sparse polynomial powers using heaps.

August 2012
     7 Andrew Arnold: TBA
     8 Computational Math Day 2012

September 2012
    12 John Ogilvie Group theory for chemical applications.