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 408 for “"Partitions"”.
-
Complexity and Partitions
… the complexity of sets, i.e., the complexity of partitions into two parts. But often it is more appropriate to represent natural problems by partitions into more than two parts. A particularly interesting class of such problems consists of classification problems for relations. For instance, a …
-
Alliance Partitions in Graphs.
<p>For a graph <em>G</em>=(<em>V</em>,<em>E</em>), a nonempty subset <em>S</em> contained in <em>V</em> is called a <em>defensive alliance</em> if for each <em>v</em> in <em>S</em>, there are at least as many vertices from the closed neighborhood of <em>v</em> in <em>S</em> as in …
-
Asymptotic Properties of Partitions
Made available in DSpace on 2014-12-05T21:50:07Z (GMT). No. of bitstreams: 1 0018159.pdf: 1175807 bytes, checksum: 3bd896f94ef741e37dae77d2cc42c092 (MD5) Previous issue date: 1956
-
Precise Partitions Of Large Graphs
<p>First by using an easy application of the Regularity Lemma, we extend some known results about cycles of many lengths to include a specified edge on the cycles. The results in this chapter will help us in rest of this thesis. In 2000, Enomoto and Ota posed a conjecture on the existence of path …
-
Studies in partitions and permutations.
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1973.
-
Utilization of Partitions in Graph Structures
<p>The utilization of partitions is essential for proving the properties of different types of graphs. Gallai-Ramsey problems and conjectures which require the Regularity lemma require unique methods to improve the bounds on known results. In this work the upper bounds for Gallai-Ramsey using $k$ …
-
Very Cost Effective Partitions in Graphs
<p>For a graph G=(V,E) and a set of vertices S, a vertex v in S is said to be very cost effective if it is adjacent to more vertices in V -S than in S.</p> <p>A bipartition pi={S, V- S} is called very cost effective if both S and V- S are very cost effective sets. Not all graphs have a very cost …
-
Dynamics of vacuum-sealed, double-leaf partitions
… of using vacuum-sealed, double-leaf partitions for applications in noise control. Substantial work has been done previously on double-leaf partitions where the acoustics of the inner chamber and mechanical vibrations of structural supports are passively and actively controlled. The …
-
Applications of Voronoi partitions in particle therapy
… least squares. (2) We found that Voronoi partitions can provide effective heuristic solutions to the energy modulation change reduction and LET painting problems. In addition, this thesis also identified an array of important and challenging computational problems that are not only of …
-
Stabilization via smooth partitions, transversality and graphs
With the aim of circumventing the difficulty in constructing Liapunov functions, a strategy for the design of static stabilizing feedback control laws of nonlinear systems is proposed. The basic method is to partition the state space and to find all controls so that the closed-loop dynamics are …
-
Cuts and partitions: solving, counting, and enumerating
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms
-
Partitions into prime powers and related divisor functions
… Then our focus shifts to the related area of partitions into prime powers. We compute the appropriate asymptotic formulae, and demonstrate important monotonicity properties. We conclude by looking at iteration problems for some of the simpler prime symmetric functions. In doing so, we consider …
-
Half-integral weight Kloosterman sums and integer partitions
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-05-01
-
Multilevel spectral clustering : graph partitions and image segmentation
While the spectral graph partitioning method gives high quality segmentation, segmenting large graphs by the spectral method is computationally expensive. Numerous multilevel graph partitioning algorithms are proposed to reduce the segmentation time for the spectral partition of large graphs. …
-
Matrix correspondences and the enumeration of plane partitions.
Thesis. 1978. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics.
-
Random partitions and the quantum Benjamin-Ono hierarchy
… functions defines a Jack measure, a model random partitions for every analytic real function v(w) on the unit circle and parameters E2 < 0 < E1. Jacks are eigenfunctions of the Hamiltonian ... of the quantum Benjamin-Ono equation with periodic boundary conditions, dispersion and quantization …
-
Extremal Problems for Partitions of Edge Sets of Graphs
… three families of problems in graph theory about partitions of the edge sets of graphs (also known as graph decompositions). The first family we address consists of induced Ramsey number problems. Induced Ramsey numbers generalize ordinary Ramsey numbers. The induced Ramsey number of a pair of …
Page 1 of 21