Browsing Mathematics - Ph.D. / Sc.D. by Title
Research and Teaching Output of the MIT Community
- Home
- →
- MIT Libraries
- →
- MIT Theses
- →
- Theses - Dept. of Mathematics
- →
- Mathematics - Ph.D. / Sc.D.
- →
- Browsing Mathematics - Ph.D. / Sc.D. by Title
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing Mathematics - Ph.D. / Sc.D. by Title
-
(Massachusetts Institute of Technology, 1971)
-
(Massachusetts Institute of Technology, 2005)In this thesis, we present bijections proving partitions identities. In the first part, we generalize Dyson's definition of rank to partitions with successive Durfee squares. We then present two symmetries for this new ...
-
(Massachusetts Institute of Technology, 1994)
-
(Massachusetts Institute of Technology, 2012)We consider a variety of questions related to pattern avoidance in alternating permutations and generalizations thereof. We give bijective enumerations of alternating permutations avoiding patterns of length 3 and 4, of ...
-
(Massachusetts Institute of Technology, 2009)A grid shape is a set of boxes chosen from a square grid; any Young diagram is an example. We consider a notion of pattern-avoidance for 0-1 fillings of grid shapes, which generalizes permutation pattern-avoidance. A filling ...
-
(Massachusetts Institute of Technology, 1992)
-
(Massachusetts Institute of Technology, 1990)
-
(Massachusetts Institute of Technology, 1994)
-
(Massachusetts Institute of Technology, 2008)We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation [sigma] = [sigma] 1 [sigma] 2 an defined as ...
-
(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)
Browse
My Account
MIT-Mirage