Advanced Search
DSpace@MIT

Browsing Theses - Dept. of Mathematics by Title

Research and Teaching Output of the MIT Community

Browsing Theses - Dept. of Mathematics by Title

Sort by: Order: Results:

  • Šipčić, Radica, 1972- (Massachusetts Institute of Technology, 1998)
  • Taylor, Brian David (Massachusetts Institute of Technology, 1997)
  • Stroilova, Olga (Olga Y.) (Massachusetts Institute of Technology, 2012)
    The purpose of this work is give some field notes on exploring the idea that a generalized Tate construction tk reduces chromatic level in stable homotopy theory. The first parts introduce the construction and discuss ...
  • Lynch, Thomas Emile (Massachusetts Institute of Technology, 1979)
  • Gessel, Ira Martin (Massachusetts Institute of Technology, 1977)
  • Haines, Leonard Harold (Massachusetts Institute of Technology, 1965)
  • Benbernou, Nadia M (Massachusetts Institute of Technology, 2011)
    In this thesis, we study three problems related to geometric algorithms of reconfigurable structures. In the first problem, strip folding, we present two universal hinge patterns for a strip of material that enable the ...
  • Korn, Michael Robert, 1978- (Massachusetts Institute of Technology, 2004)
    In this thesis we study tilings of regions on the square grid by polyominoes. A polyomino is any connected shape formed from a union of grid cells, and a tiling of a region is a collection of polyominoes lying in the region ...
  • Rassart, Étienne, 1975- (Massachusetts Institute of Technology, 2004)
    Using tools from combinatorics, convex geometry and symplectic geometry, we study the behavior of the Kostka numbers and Littlewood-Richardson coefficients (the type A weight multiplicities and Clebsch-Gordan coefficients). ...
  • Chen, Tsao-Hsien (Massachusetts Institute of Technology, 2012)
    Let C be a smooth projective curve over an algebraically closed field k of sufficiently large characteristic. Let G be a semisimple algebraic group over k and let GV be its Langlands dual group over k. Denote by BunG the ...
  • Hashemi, Hila (Massachusetts Institute of Technology, 2012)
    In this work, we study two different manipulations of electromagnetic waves governed by macroscopic Maxwell's equations. One is frequency conversion of such waves using small intrinsic material nonlinearities. We study ...
  • Rubinstein, Yanir Akiva (Massachusetts Institute of Technology, 2008)
    This Thesis is concerned with the study of the geometry and structure of the space of Kihler metrics representing a fixed cohomology class on a compact Kähler manifold. The first part of the Thesis is concerned with a ...
  • Dunagan, John D. (John David), 1976- (Massachusetts Institute of Technology, 2002)
    We develop a new understanding of outliers and the behavior of linear programs under perturbation. Outliers are ubiquitous in scientific theory and practice. We analyze a simple algorithm for removal of outliers from a ...
  • Hu, Yi (Massachusetts Institute of Technology, 1991)
  • Yang, Xiaochun, 1971- (Massachusetts Institute of Technology, 2002)
    Geometry is the synthetic tool we use to unify all existing analytical cone-beam reconstruction methods. These reconstructions are based on formulae derived by Tuy [Tuy, 1983], Smith [Smith, 1985] and Grangeat [Grangeat, ...
  • Božin, Vladimir, 1973- (Massachusetts Institute of Technology, 2004)
    In this work, we study geometry of Ricci-flat Kähler manifolds, and also provide some counterexample constructions. We study asymptotic behavior of complete Ricci-flat metrics at infinity and consider a construction of ...
  • Dodds, Peter Sheridan, 1969- (Massachusetts Institute of Technology, 2000)
  • Sher, Joshua S. (Joshua Simon) (Massachusetts Institute of Technology, 1995)
  • Pereira, Luis Alexandre Meira Fernandes Alves (Massachusetts Institute of Technology, 2013)
    The overall goal of this thesis is to apply the theory of Goodwillie calculus to the category Algo of algebras over a spectral operad. Its first part generalizes many of the original results of Goodwillie in [14] so that ...
  • Chen, Victor Yen-Wen (Massachusetts Institute of Technology, 2009)
    A property tester is a fast, randomized algorithm that reads only a few entries of the input, and based on the values of these entries, it distinguishes whether the input has a certain property or is "different" from any ...
MIT-Mirage