3414
Comment:

3485

Deletions are marked like this.  Additions are marked like this. 
Line 2:  Line 2: 
Line 6:  Line 5: 
Line 11:  Line 11: 
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 
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 
Line 20:  Line 19: 
algebras in SAGE with an emphasis on symmetric functions, some issues  algebras in SAGE with an emphasis on symmetric functions, some issues 
Line 23:  Line 22: 
Line 27:  Line 24: 
Monday, October 15, 2007:  
Line 28:  Line 26: 
Monday, October 15, 2007:  
Line 34:  Line 31: 
Line 47:  Line 43: 
Line 51:  Line 46: 
Monday, October 22, 2007: 
Monday, October 22, 2007: 
Line 57:  Line 50: 
Monday, October 29, 2007:  Monday, October 29, 2007: 
Line 63:  Line 57: 
Abstract: A "combinatorial algebra" is an algebra over a ring whose module basis is indexed by a class of combintorial objects with multiplication on 
Abstract: A "combinatorial algebra" is an algebra over a ring whose module basis is indexed by a class of combintorial objects with multiplication on 
Line 67:  Line 60: 
xamples 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 
xamples 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 
Line 72:  Line 65: 
algebras in SAGE with an emphasis on symmetric functions, some issues  algebras in SAGE with an emphasis on symmetric functions, some issues 
Line 75:  Line 68: 
[http://mwhansen.org/combinatorial_algebras.pdf Slides] [http://www.mwhansen.org/sageuw.html Worksheets]  
Line 76:  Line 70: 
Monday, November 5, 2007:  Monday, November 5, 2007: 
Line 80:  Line 74: 
Monday, November 19, 2007:  Monday, November 19, 2007: 
Line 82:  Line 76: 
Monday, November 26, 2007:  Monday, November 26, 2007: 
Line 84:  Line 78: 
Monday, December 3, 2007:  Monday, December 3, 2007: 
The UW Sage Seminar Schedule
The seminar meets at 5pm in Communications B027.
Monday, October 29, 2007:
TITLE: Combinatorial Algebras in SAGE TIME: 56pm 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.
=======================================================================
Monday, October 15, 2007:
TITLE: Introduction to Abelian Varieties TIME: 56pm 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 1dimensional 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 ntorus. 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, October 29, 2007:
TITLE: Combinatorial Algebras in SAGE TIME: 56pm 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 e xamples 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/sageuw.html Worksheets]
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: