Now showing items 1-10 of 42
Application of random codes to the gathering of statistical information
(Massachusetts Institute of Technology, 1948)
Enumerative problems in intersection theory
(Massachusetts Institute of Technology, 2003)
We develop and describe some of the basic tools of intersection theory in algebraic geometry. Some classical enumerative problems are then solved using these methods. In particular, we discuss the Fano variety of a cubic ...
Branching from K to M for split classical groups
(Massachusetts Institute of Technology, 2005)
We provide two algorithms to solve branching from K to M for the real split reductive group of type A, one inductive and one related to semistandard Young tableaux. The results extend to branching from Ke to M Ke for the ...
Differential posets and dual graded graphs
(Massachusetts Institute of Technology, 2008)
In this thesis I study r-differential posets and dual graded graphs. Differential posets are partially ordered sets whose elements form the basis of a vector space that satisfies DU-UD=rI, where U and D are certain ...
Rings of regular functions on spherical nilpotent orbits for complex classical groups
(Massachusetts Institute of Technology, 2009)
Let G be a classical group and let g be its Lie algebra. For a nilpotent element X E g, the ring R(Ox) of regular functions on the nilpotent orbit Ox is a G-module. In this thesis, we will decompose it into irreducible ...
Equivalent statements to exotic p.1. structures on the 4-sphere.
(Massachusetts Institute of Technology, 1973)