Advanced Search
DSpace@MIT

Browsing MIT Theses by Title

Research and Teaching Output of the MIT Community

Browsing MIT Theses by Title

Sort by: Order: Results:

  • Losonczy, Jozsef (Massachusetts Institute of Technology, 1996)
  • Williams, Lauren Kiyomi (Massachusetts Institute of Technology, 2005)
    In this thesis I study combinatorial aspects of an emerging field known as total positivity. The classical theory of total positivity concerns matrices in which all minors are nonnegative. While this theory was pioneered ...
  • Stembridge, John Reese (Massachusetts Institute of Technology, 1985)
  • An, Junkyu (Massachusetts Institute of Technology, 2010)
    This thesis is devoted to the divisibility property of weighted Catalan and Motzkin numbers and its applications. In Chapter 1, the definitions and properties of weighted Catalan and Motzkin numbers are introduced. Chapter ...
  • Babson, Eric Kendall (Massachusetts Institute of Technology, 1994)
  • Young, Andrew John, S.M. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2015)
    Traditional error correction and source coding has focused on the stochastic setting where separation based schemes are optimal, and current solutions for applications requiring both lossy compression and noise resilience ...
  • Nguyen, David-Huy Nhu (Massachusetts Institute of Technology, 2008)
    RNA-based therapy is an exciting new realm of experimental medicine due to the diverse roles of RNA in the human body. RNA function depends on sequence, structure, and cellular location. Whereas cytosolic short-interfering ...
  • Ehrenborg, Jöns Richard Gustaf (Massachusetts Institute of Technology, 1993)
  • Stratila, Dan (Massachusetts Institute of Technology, 2009)
    In the first part, we study the problem of minimizing a separable concave function over a polyhedron. We assume the concave functions are nonnegative nondecreasing on R+, and the polyhedron is in RI' (these assumptions can ...
  • Klivans, Caroline J. (Caroline Jane), 1977- (Massachusetts Institute of Technology, 2003)
    In this thesis we study the class of shifted simplicial complexes. A simplicial complex on n nodes is shifted if there exists a labelling of the nodes by 1 through n such that for any face, replacing any node of the face ...
  • Santos, Christine Nicole S. (Christine Nicole San Diego) (Massachusetts Institute of Technology, 2010)
    Although the field of microbial metabolic engineering has traditionally been dominated by rational and knowledge-driven approaches, recent advances in genetic engineering have led to the emergence of a new methodology based ...
  • Delagrave, Simon (Massachusetts Institute of Technology, 1995)
  • Yoo, Hwanchul (Massachusetts Institute of Technology, 2011)
    This thesis consists of two parts. Both parts are devoted to finding links between geometric/algebraic objects and combinatorial objects. In the first part of the thesis, we link Schubert varieties in the full flag variety ...
  • Iriarte Giraldo, Benjamin (Massachusetts Institute of Technology, 2015)
    This thesis studies aspects of the set of acyclic orientations of a simple undirected graph. Acyclic orientations of a graph may be readily obtained from bijective labellings of its vertex-set with a totally ordered set, ...
  • Zhang, Yan, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2013)
    Adinkras are graphical tools created to study representations of supersymmetry algebras. Besides having inherent interest for physicists, the study of adinkras has already shown nontrivial connections with coding theory ...
  • Morales, Alejandro Henry (Massachusetts Institute of Technology, 2012)
    In the first part of this thesis we study factorizations of the permutation (1; 2,..., n) into k factors of given cycle type. Using representation theory, Jackson obtained for each k an elegant formula for counting these ...
  • Konvalinka, Matjaž (Massachusetts Institute of Technology, 2008)
    In this thesis, we apply combinatorial means for proving and generalizing classical determinantal identities. In Chapter 1, we present some historical background and discuss the algebraic framework we employ throughout the ...
  • Trongsiriwat, Wuttisak (Massachusetts Institute of Technology, 2015)
    In the first part, we study pattern avoidance and permutation statistics. For a set of patterns n and a permutation statistic st, let Fst/n ([Pi]; q) be the polynomial that counts st on the permutations avoiding all patterns ...
  • Tenner, Bridget Eileen (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 ...
  • Lam, Thomas F. (Thomas Fun Yau) (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 ...
MIT-Mirage