Differences between revisions 32 and 33
Revision 32 as of 2007-02-26 18:17:13
Size: 3157
Editor: anonymous
Comment:
Revision 33 as of 2007-02-28 18:28:42
Size: 4211
Editor: anonymous
Comment:
Deletions are marked like this. Additions are marked like this.
Line 3: Line 3:
 * Wed, March 1, 5-6pm: Jim Morrow -- '''Algorithms for Discrete Electrical Networks'''  * Wed, Feb 28, Padelford 401, 5-6pm: Jim Morrow -- '''Algorithms for Discrete Electrical Networks'''
Line 5: Line 5:

 * Thur, Mar 1, 4-5pm: Martin Albrecht -- '''Attacks on Algebraic Block Ciphers''', room TBA.

 * Fri, Mar 2, 4-5pm: Robert Miller --
Title: Opening Graph Automorphisms

Abstract:

Bill McKay has written what many people agree to be the world's
fastest automorphism computation package, "nauty." The package is
given a labelled graph G and an ordered partition P, and it outputs
the partition stabilizer subgroup of the automorphism group and,
optionally, the canonical label C(G,P). If P is the unit partition,
this means the whole automorphism group and the canonical label C(G).
Canonical labels are in one-to-one correspondence with isomorphism
classes.

The package has a restrictive license, which excludes it from use in
the open source community. The algorithm is described in McKay's
paper, "Practical Graph Isomorphism," and luckily, academic Journals
are amongst the most open of sources. The big picture of the algorithm
will be explained, and reproductions of a few subroutines will be
demonstrated.

SAGE UW Seminar

  • Wed, Feb 28, Padelford 401, 5-6pm: Jim Morrow -- Algorithms for Discrete Electrical Networks

    • ABSTRACT: I will present algorithms for recovery of information about discrete electrical networks. Time permitting, I'll also discuss algorithms for embedding graphs in Riemann surfaces.
  • Thur, Mar 1, 4-5pm: Martin Albrecht -- Attacks on Algebraic Block Ciphers, room TBA.

  • Fri, Mar 2, 4-5pm: Robert Miller --

Title: Opening Graph Automorphisms

Abstract:

Bill McKay has written what many people agree to be the world's fastest automorphism computation package, "nauty." The package is given a labelled graph G and an ordered partition P, and it outputs the partition stabilizer subgroup of the automorphism group and, optionally, the canonical label C(G,P). If P is the unit partition, this means the whole automorphism group and the canonical label C(G). Canonical labels are in one-to-one correspondence with isomorphism classes.

The package has a restrictive license, which excludes it from use in the open source community. The algorithm is described in McKay's paper, "Practical Graph Isomorphism," and luckily, academic Journals are amongst the most open of sources. The big picture of the algorithm will be explained, and reproductions of a few subroutines will be demonstrated.


Past

  • Friday, March 2: TBA
  • Friday, March 9: TBA
  • Friday, March 16: TBA

Things Martin Albrecht may talk about during his visit:

Hi everybody, 
 
this is a list of stuff I could talk about. I didn't think those through, just 
stuff that came to mind.
 
 * Pyrex/SageX (I know e.g. Robert Miller wants to start hacking Pyrex to 
    speed up the graph stuff)
 * Wrap up of what happened at the MSRI workshop
 * Algebraic attacks on block ciphers and Groebner bases in SAGE 
 * 

Fridays 4-5pm in C401, at least -- probably more frequently!

  • Friday, Jan 19 (at 4pm): William Stein -- SAGE 2.0
  • Friday, Jan 19 (at 5pm): William Stein -- Tutorial introduction to using SAGE for the Modeling Contest (etc.)
  • Friday, Jan 26: Andrey Novoseltsev: PALP

    • PALP is a Package for Analyzing Lattice Polytopes, written by Maximilian Kreuzer and Harald Skarke during their work with reflexive polytopes, that appear in connection with toric varieties, Calabi-Yau manifolds, and string theory. It contains several command line applications written in C, is quite small and fast. Recently is was included into standard distribution of SAGE, together with lattice_polytope.py module that uses some of its functions. I will talk about PALP itself, functions and structure of lattice_polytope.py module, and directions for improvement/development.
  • Friday, Feb 2: TBA (I will be gone)
  • Friday, Feb 9: TBA (I will be gone)


Talks are all in the communications building, B027, except on Tuesday, Feb 13:

sage-uw (last edited 2008-11-14 13:42:07 by anonymous)