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, 1973)
-
(Massachusetts Institute of Technology, 1994)
-
The presentation functor and Weierstrass theory for families of local complete intersection curves (Massachusetts Institute of Technology, 1994)
-
(Massachusetts Institute of Technology, 1972)
-
(Massachusetts Institute of Technology, 1996)
-
(Massachusetts Institute of Technology, 1988)
-
(Massachusetts Institute of Technology, 2005)(cont.) Packing/Covering problems, we prove upper and lower bounds on the adaptivity gap depending on the dimension. We also design polynomial-time algorithms achieving near-optimal approximation guarantees with respect ...
-
(Massachusetts Institute of Technology, 1994)
-
(Massachusetts Institute of Technology, 2001)By a Galton-Watson tree T we mean an infinite rooted tree that starts with one node and where each node has a random number of children independently of the rest of the tree. In the first chapter of this thesis, we prove ...
-
(Massachusetts Institute of Technology, 1993)
-
(Massachusetts Institute of Technology, 1970)
-
(Massachusetts Institute of Technology, 2005)Proofs of Tsygan's formality conjectures for chains would unlock important algebraic tools which might lead to new generalizations of the Atiyah-Patodi-Singer index theorem and the Riemann-Roch-Hirzebruch theorem. Despite ...
-
(Massachusetts Institute of Technology, 1997)
-
(Massachusetts Institute of Technology, 2003)The thesis considers two fundamental questions in propositional proof complexity: lower bounds on the size of the shortest proof and automatizability of propositional proof systems. With respect to the first part, we develop ...
-
(Massachusetts Institute of Technology, 2009)The main result of this work is a q-analogue relationship between nilpotent transformations and spanning trees. For example, nilpotent endomorphisms on an n-dimensional vector space over Fq is a q-analogue of rooted spanning ...
-
(Massachusetts Institute of Technology, 2006)In Part A we will study the quantifier rank spectrum of sentences of L!1,!. We will show that there are scattered sentences with models of arbitrarily high but bounded quantifier rank. We will also consider the case of ...
-
(Massachusetts Institute of Technology, 1996)
-
(Massachusetts Institute of Technology, 2011)In this thesis, a new class of algebras called quantized multiplicative quiver varieties A (Q), is constructed, depending upon a quiver Q, its dimension vector d, and a certain "moment map" parameter . The algebras Ad(Q) ...
-
(Massachusetts Institute of Technology, 1996)
-
(Massachusetts Institute of Technology, 2012)Let C be a smooth connected projective curve of genus > 1 over an algebraically closed field k of characteristic p > 0, and c [epsilon] k \ Fp. Let BunN be the stack of rank N vector bundles on C and Ldet the line bundle ...
Browse
My Account
MIT-Mirage