Browsing Theses - Dept. of Mathematics by Title
Research and Teaching Output of the MIT Community
- Home
- →
- MIT Libraries
- →
- MIT Theses
- →
- Theses - Dept. of Mathematics
- →
- Browsing Theses - Dept. of Mathematics by Title
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing Theses - Dept. of Mathematics by Title
-
(Massachusetts Institute of Technology, 2006)This thesis examines several aspects of reduced decompositions in finite Coxeter groups. Effort is primarily concentrated on the symmetric group, although some discussions are subsequently expanded to finite Coxeter groups ...
-
(Massachusetts Institute of Technology, 2005)This thesis begins with the study of a class of symmetric functions ... Which are generating functions for ribbon tableaux (hereon called ribbon functions), first defined by Lascoux, Leclerc and Thibon. Following work of ...
-
(Massachusetts Institute of Technology, 2011)In this thesis we study the combinatorial objects that appear in the study of nonnegative part of the Grassmannian. The classical theory of total positivity studies matrices such that all minors are nonnegative. Lustzig ...
-
(Massachusetts Institute of Technology, 1997)
-
(Massachusetts Institute of Technology, 2004)We define a moduli functor parametrizing finite maps from a projective (locally) Cohen-Macaulay curve to a fixed projective space. The definition of the functor includes a number of technical conditions, but the most ...
-
(Massachusetts Institute of Technology, 2007)In this thesis a conjecture of Okounkov, a conjecture of Fomin-Fulton-Li-Poon, and a special case of Lascoux-Leclerc-Thibon's conjecture on Schur positivity of certain differences of products of Schur functions are proved. ...
-
(Massachusetts Institute of Technology, 1991)
-
(Massachusetts Institute of Technology, 2002)This thesis details a new vantage point for attacking longstanding problems in machine learning. We use tools from computational complexity theory to make progress on problems from computational learning theory. Our methods ...
-
(Massachusetts Institute of Technology, 2014)Absorbing layers are sometimes required to be impractically thick in order to offer an accurate approximation of an absorbing boundary condition for the Helmholtz equation in a heterogeneous medium. It is always possible ...
-
(Massachusetts Institute of Technology, 2006)This is an exposition of the Compression Theorem of Colin Rourke and Brian Sanderson, which leads to a new proof of the Immersion Theorem.
-
(Massachusetts Institute of Technology, 2003)This thesis is concerned with the study of the noise sensitivity of boolean functions and its applications in theoretical computer science. Noise sensitivity is defined as follows: Let f be a boolean function and let ... ...
-
(Massachusetts Institute of Technology, 1995)
-
(Massachusetts Institute of Technology, 2006)We begin by present a new Hopf algebra which can be used to compute the tmf homology of a space or spectrum at the prime 3. Generalizing work of Mahowald and Davis, we use this Hopf algebra to compute the tmf homology of ...
-
(Massachusetts Institute of Technology, 1973)
-
(Massachusetts Institute of Technology, 2011)Training, Research, Isotopes, General Atomics (TRIGA) reactors have the unique capability of generating high neutron flux environments with the removal of a transient control rod, creating conditions observed in fast fission ...
-
(Massachusetts Institute of Technology, 1982)
-
(Massachusetts Institute of Technology, 1992)
-
(Massachusetts Institute of Technology, 2013)In this dissertation we apply computer-assisted proof techniques to two problems, one in discrete geometry and one in celestial mechanics. Our main tool is an effective inverse function theorem which shows that, in favorable ...
-
(Massachusetts Institute of Technology, 1980)
-
(Massachusetts Institute of Technology, 1989)
Browse
My Account
MIT-Mirage