Search

Algebraic Geometry Algebra/Logic DeLong Diversity Functional Analysis Grad Algebra/Logic Homotopy Init Conditions Kempner Lie Theory Math Club Math Phys Noncomm Geometry Number Theory PDE/Analysis Probability Rep Theory Grad Student Seminar Thesis Defenses Topology Ulam Math Edu

Events for July – November 2010

Return to this week

Print these events

Aug. 31, 2010 2pm (MATH 350)	Lie Theory Nat Thiem (CU) X At a recent AIM workshop, the participants found a remarkable connection between two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in noncommuting variables. Each is a Hopf algebra and the two are Hopf isomorphic. The identification suggests a rich class of examples for the emerging field of combinatorial Hopf algebras. This talk will be in two parts: (1) I will give an introduction to combinatorial Hopf algebras with our favorite examples (2) I will describe supercharacters and how they connect up to one of our favorite Hopf algebras. Supercharacters and combinatorial Hopf algebras I
Sep. 07, 2010 2pm (MATH 350)	Lie Theory Nat Thiem (CU) X At a recent AIM workshop, the participants found a remarkable connection between two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in noncommuting variables. Each is a Hopf algebra and the two are Hopf isomorphic. The identification suggests a rich class of examples for the emerging field of combinatorial Hopf algebras. This talk will be in two parts: (1) I will give an introduction to combinatorial Hopf algebras with our favorite examples (2) I will describe supercharacters and how they connect up to one of our favorite Hopf algebras. Supercharacters and combinatorial Hopf algebras II
Sep. 21, 2010 2pm (MATH 350)	Lie Theory Jacob Harper (CU) X This talk will be split into two parts. In the first part I will describe a hypersimplex and go over concepts of Coxeter groups and topology in order to get a better understanding of this polytope. In the second talk I will describe a matching on the face lattice of a hypersimplex and use discrete Morse theory to classify all subcomplexes whose reduced homology groups are concentrated in a single degree. These homology groups support a natural action of the symmetric group and I will finish my talk by describing the characters that this action produces. Homology representations arising from a hypersimplex I
Sep. 28, 2010 2pm (MATH 350)	Lie Theory Jacob Harper (CU) X This talk will be split into two parts. In the first part I will describe a hypersimplex and go over concepts of Coxeter groups and topology in order to get a better understanding of this polytope. In the second talk I will describe a matching on the face lattice of a hypersimplex and use discrete Morse theory to classify all subcomplexes whose reduced homology groups are concentrated in a single degree. These homology groups support a natural action of the symmetric group and I will finish my talk by describing the characters that this action produces. Homology representations arising from a hypersimplex II
Oct. 12, 2010 2pm (MATH 350)	Lie Theory Daniel Swenson (Black Hills State) X The Steinberg Complex is a generalization, to the case of an arbitrary finite group G, of the Steinberg Representation of a finite group of Lie type. It is defined in terms of the conjugation action of G on its poset of p-subgroups (analogous to the building in the classical case). I will describe the Steinberg Complex and what is known about it in the general case, and I will indicate some directions for further research. The Steinberg Complex of an Arbitrary Finite Group
Oct. 19, 2010 2pm (MATH 350)	Lie Theory Tom Denton (UC Davis) X The variety of J-trivial monoids does not enjoy the semi-simplicity of groups, but has other properties which make their representation theory approachable and inherently combinatorial. I will describe these combinatorics, and also present important examples of some J-trivial monoids, including the zero-Hecke monoid, the monoid of regressive order-preserving functions on a poset, and the upper-unitriangular matrices over the boolean semiring. Combinatorial Representation Theory of J-Trivial Monoids
Nov. 02, 2010 2pm (MATH 350)	Lie Theory Matt Macauley (Clemson) X In this talk, I will describe how a scientist studying discrete dynamical systems in a bioinformatics institute stumbled into the field of Coxeter groups. Central to these diverse fields are involutions, and what has a group-theoretic interpretation on one hand may lead to insight to the dynamics on the other, and vice-versa. I will highlight some of the central themes and common structures, as well as discuss some novel approaches to some open and open-ended problems. From dynamical systems to Coxeter groups
Nov. 09, 2010 2pm (MATH 350)	Lie Theory Richard Green (CU) X A Gaussian poset is a type of finite poset satisfying a certain technical algebraic condition that defies concise summary. I will explain how minuscule representations of Lie algebras give rise to interesting examples of Gaussian posets. It is conjectured that any Gaussian poset is a direct sum of Gaussian posets coming from minuscule representations, and this has been an open question since the 80s. Although a direct combinatorial characterization of Gaussian posets is not known, the set of irreducible Gaussian posets is the solution to another problem that is purely combinatorial in nature. These (expository) talks will also discuss applications of Gaussian posets to the combinatorics of plane partitions. Gaussian posets I
Nov. 16, 2010 2pm (MATH 350)	Lie Theory Richard Green (CU) X A Gaussian poset is a type of finite poset satisfying a certain technical algebraic condition that defies concise summary. I will explain how minuscule representations of Lie algebras give rise to interesting examples of Gaussian posets. It is conjectured that any Gaussian poset is a direct sum of Gaussian posets coming from minuscule representations, and this has been an open question since the 80s. Although a direct combinatorial characterization of Gaussian posets is not known, the set of irreducible Gaussian posets is the solution to another problem that is purely combinatorial in nature. These (expository) talks will also discuss applications of Gaussian posets to the combinatorics of plane partitions. Gaussian posets II
Nov. 30, 2010 2pm (MATH 350)	Lie Theory Z. Strider McGregor-Dorsey (CU) X The notion of a full heap was developed by Richard Green as an affine analogue to the minuscule posets of simple Lie algebras. As such, one might expect that various properties of minuscule posets are shared by full heaps. (For example, convex subposets of both minuscule posets and full heaps correspond to their respective minuscule elements.) In this talk, we look to a few properties of minuscule posets and discuss their application to full heaps, if any. In particular, we will build new full heaps from others using the ideas from the Fundamental Theorem for Finite Distributive Lattices , as well as explore a somewhat unsatisfying relation to Gaussian posets. And more!, time permitting. Making Analogies with Full Heaps I

Return to the top of the page