Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 10029 for “"Sets"”.
-
Counting Convex Sets on Products of Totally Ordered Sets
… of this thesis is to find the number of convex sets on a product of two totally ordered spaces. We will give formulas to find this number for specific cases and describe a process to obtain this number for all such spaces. In the first chapter we briefly discuss the motivation behind the work …
-
Manifoldlike Causal Sets
… question of manifold likeness of causal sets. This problem has importance in the sense that in the continuum limit and in the case one finds a formalism for the sum over histories, the result requires to be embeddable in a manifold to be able to reproduce General Relativity. In what …
-
Reconstructing convex sets
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1985.
-
Zero Sets in Graphs.
… 0. In this thesis we introduce the study of zero sets in graphs. We give proofs of the existence of zero sets in various kinds of graphs such as even order graphs, bipartite graphs, and graphs of maximum degree 3. We also give proofs regarding the existence of graphs which contain no zero sets and …
-
Concerning Scattered Point Sets
Made available in DSpace on 2015-05-12T17:09:35Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 6200536.PDF: 1305698 bytes, checksum: 39f68772311df4d3e9ccc5af1bba6ca0 (MD5) Previous issue date: 1961
-
Combinatorics of finite sets
… represent the subset lattice of (n) with sets ordered by inclusion. A collection I of subsets of (n) is called an ideal if every subset of a member of I is also in I. An intersecting family S in 2$\sp{\lbrack n\rbrack }$ is called a star if there exists an element of (n) belonging to every …
-
Equivariant symmetry breaking sets
… this, we introduce the idea of symmetry breaking sets (SBS). Rather than redesign existing networks to output symmetrically degenerate sets, we design sets of symmetry breaking objects which we feed into our network based on the symmetry of our input. We show there is a natural way to define …
-
Sets and their sizes
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1981.
-
Triangulation of stratified sets,
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 1973
-
Transformations preserving tame sets
… is called tame and is said to preserve tame sets if for each tame set PcX, f(P) is tame. Tame local homeomorphisms from triangulated n-manifolds into triangulated n-manifolds and tame light open maps of 2-manifolds into themselves are homeomorphisms. Connected complexes are compact if and …
-
Continued Radicals and Cantor Sets
<p>We examine the formation of sets homeomorphic to the ternary Cantor set by continued radicals. We determine properties of bridges and gaps and calculate the thickness of the Cantor set. From this we apply information from continued fractions to continued radicals to obtain new results. We also …
-
Potential Theory on Compact Sets
… the notions of potential theory to compact sets. There are several equivalent ways to define continuous harmonic functions <em>H</em>(<em>K</em>) on a compact set <em>K</em> in [the set of real numbers]<sup>n</sup>. One may let <em>H</em>(<em>K</em>) be the uniform closure of all functions …
-
Vertices in Total Dominating Sets.
… denote a property of interest concerning sets of vertices. A vertex <em>u</em> is <em>rho-good</em> if <em>u</em> is contained in a {minimum, maximum} <em>rho-set</em> in <em>G</em> and <em>rho-bad</em> if <em>u</em> is not contained in a <em>rho-set</em>. Let <em>g</em> denote the number …
Page 1 of 502