• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 15
  • 1
  • Tagged with
  • 16
  • 16
  • 5
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Mean curvature flow with free boundary on smooth hypersurfaces

Buckland, John A. (John Anthony), 1978- January 2003 (has links)
Abstract not available
12

Generalizations of the reduced distance in the Ricci flow - monotonicity and applications

Enders, Joerg. January 2008 (has links)
Thesis (Ph.D.)--Michigan State University. Dept. of Mathematics, 2008. / Title from PDF t.p. (viewed on July 24, 2009) Includes bibliographical references (p. 75-78). Also issued in print.
13

Problems and results in partially ordered sets, graphs and geometry

Biro, Csaba January 2008 (has links)
Thesis (Ph.D.)--Mathematics, Georgia Institute of Technology, 2008. / Committee Chair: Trotter, William T.; Committee Member: Duke, Richard A.; Committee Member: Randall, Dana; Committee Member: Thomas, Robin; Committee Member: Yu, Xingxing
14

A proposed algorithm toward uniform-distribution monotone DNF learning

Bi, Wenzhu. January 2004 (has links)
Thesis (M.S.)--Duquesne University, 2004. / Title from document title page. Abstract included in electronic submission form. Includes bibliographical references (p. 24-25) and index.
15

Nonparametric estimation of a k-monotone density : a new asymptotic distribution theory /

Balabdaoui, Fadoua, January 2004 (has links)
Thesis (Ph. D.)--University of Washington, 2004. / Vita. Includes bibliographical references (p. 213-219).
16

Problems and results in partially ordered sets, graphs and geometry

Biro, Csaba 26 June 2008 (has links)
The thesis consist of three independent parts. In the first part, we investigate the height sequence of an element of a partially ordered set. Let $x$ be an element of the partially ordered set $P$. Then $h_i(x)$ is the number of linear extensions of $P$ in which $x$ is in the $i$th lowest position. The sequence ${h_i(x)}$ is called the height sequence of $x$ in $P$. Stanley proved in 1981 that the height sequence is log-concave, but no combinatorial proof has been found, and Stanley's proof does not reveal anything about the deeper structure of the height sequence. In this part of the thesis, we provide a combinatorial proof of a special case of Stanley's theorem. The proof of the inequality uses the Ahlswede--Daykin Four Functions Theorem. In the second part, we study two classes of segment orders introduced by Shahrokhi. Both classes are natural generalizations of interval containment orders and interval orders. We prove several properties of the classes, and inspired by the observation, that the classes seem to be very similar, we attempt to find out if they actually contain the same partially ordered sets. We prove that the question is equivalent to a stretchability question involving certain sets of pseudoline arrangements. We also prove several facts about continuous universal functions that would transfer segment orders of the first kind into segments orders of the second kind. In the third part, we consider the lattice whose elements are the subsets of ${1,2,ldots,n}$. Trotter and Felsner asked whether this subset lattice always contains a monotone Hamiltonian path. We make progress toward answering this question by constructing a path for all $n$ that satisfies the monotone properties and covers every set of size at most $3$. This portion of thesis represents joint work with David M.~Howard.

Page generated in 0.1048 seconds