Differences between revisions 11 and 12
 ⇤ ← Revision 11 as of 2007-10-30 03:45:33 → Size: 3485 Editor: MikeHansen Comment: ← Revision 12 as of 2007-10-30 03:54:15 → ⇥ Size: 2537 Editor: was Comment: Deletions are marked like this. Additions are marked like this. Line 22: Line 22: [http://mwhansen.org/combinatorial_algebras.pdf Slides] [http://www.mwhansen.org/sage-uw.html Worksheets] Line 50: Line 54: Monday, October 29, 2007:{{{TITLE: Combinatorial Algebras in SAGETIME: 5-6pm on Monday, October 29, 2007LOCATION: B027 in the Communications buildingSPEAKER: Mike HansenAbstract: A "combinatorial algebra" is an algebra over a ring whose modulebasis is indexed by a class of combintorial objects with multiplication onbasis elements typically determined by some combinatorial operation. Some examples of combinatorial algebras include the symmetric group algebra of ordern (indexed by permutations of size n), the algebra of Schubert polynomials(indexed by permutations), partition algebras (indexed by set partitionssatisfying certain constraints), and the symmetric function algebra (indexedby integer partitions). In this talk, I will go over support for combinatorial algebras in SAGE with an emphasis on symmetric functions, some issuesthat have arisen in their implementation, and things still left to do.}}}[http://mwhansen.org/combinatorial_algebras.pdf Slides] [http://www.mwhansen.org/sage-uw.html Worksheets]

## The UW Sage Seminar Schedule

The seminar meets at 5pm in Communications B027.

Monday, October 29, 2007:

```TITLE: Combinatorial Algebras in SAGE
TIME: 5-6pm on Monday, October 29, 2007
LOCATION: B027 in the Communications building
SPEAKER: Mike Hansen
Abstract:  A "combinatorial algebra" is an algebra over a ring whose module
basis is indexed by a class of combintorial objects with multiplication on
basis elements typically determined by some combinatorial operation.  Some
examples of combinatorial algebras include the symmetric group algebra of order
n (indexed by permutations of size n), the algebra of Schubert polynomials
(indexed by permutations), partition algebras (indexed by set partitions
satisfying certain constraints), and the symmetric function algebra (indexed
by integer partitions).  In this talk, I will go over support for combinatorial
algebras in SAGE with an emphasis on symmetric functions, some issues
that have arisen in their implementation, and things still left to do.```

[http://mwhansen.org/combinatorial_algebras.pdf Slides] [http://www.mwhansen.org/sage-uw.html Worksheets]

=======================================================================

Monday, October 15, 2007:

```TITLE: Introduction to Abelian Varieties
TIME: 5-6pm on Monday, October 15, 2007
LOCATION: B027 in the Communications building
SPEAKER: Robert Miller
Abstract: What the heck is an abelian variety? Elliptic curves are
the 1-dimensional abelian varieties.   What are they in general?  Maybe
something like an abelian group and an algebraic variety? A complex
torus is a complex manifold which is diffeomorphic to an n-torus. All
such structures can be obtained as a quotient of CC^n by a lattice,
and this procedure gives us a compact complex manifold. For n=1, this
is an elliptic curve. For n >= 1, any variety structure on a complex
torus must be unique, and Riemann proved that there is such a variety
structure if and only if the torus can be embedded in complex
projective space. More specifically, CC^n/L is an abelian variety if
and only if there is a positive definite Hermitian form whose
imaginary part takes integral values on L.
After defining abelian varieties as above, William Stein will give
an example or two in Sage.```

Monday, October 22, 2007:

(no seminar)

Monday, November 5, 2007:

Monday, November 12, 2007: (no seminar -- Sage Days 6)

Monday, November 19, 2007:

Monday, November 26, 2007:

Monday, December 3, 2007:

sage-uw/sched (last edited 2008-11-14 13:41:55 by anonymous)