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 945 for “"decompositions"”.
-
Generalizing graph decompositions
… a star); thus, to be able to conquer, we need decompositions that take temporal information into account. We take these considerations to heart and define a purely temporal width measure called interval-membership-width which allows us to employ dynamic programming (i.e. divide and conquer) …
-
Complete Equitable Decompositions
A well-known result in spectral graph theory states that if a graph has an equitable partition then the eigenvalues of the associated divisor graph are a subset of the graph's eigenvalues. A natural question question is whether it is possible to recover the remaining eigenvalues of the graph. Here …
-
Combinatorics of Grassmannian Decompositions
… Additionally, we study the Deodhar and positroid decompositions of the Grassmannian. A basis shape locus takes as input data a zero/nonzero pattern in a matrix, which is equivalent to a specific presentation of a transversal matroid. The locus is defined to be the set of points in the Grassmannian …
-
Cyclic automorphic graph decompositions
… to the report and discussion of automorphic decompositions will be covered in brief detail. An automorphic decomposition D of a graph H by a graph G is a G-decomposition of H such that the intersection of graph (D) @H. H is called the automorhpic host, and G is the automorphic divisor. We …
-
Automorphic Decompositions of Graphs
… in a cyclic group. Such valuations yield decompositions of circulant graphs. We will show that every graph has a valuation and hence is a divisor of arbitrarily large circulant graphs. Let D be a G-decomposition of H. The intersection graph generated by the decomposition D, denoted I(D), …
-
Octave-band Directional Decompositions
A new two-dimensional transform is derived and implemented that is able to discriminate with respect to angular and radial frequency. This octave-band directional filter bank (OBDFB) is maximally decimated, has a separable polyphase implmentation, provides perfect reconstruction, and can be …
-
Decompositions of Simplicial Complexes
… on when these properties imply the existence of decompositions of the face poset. In Chapter 2, we present a counterexample to Stanley's partitionability conjecture, we give a characterization of the h-vectors of Cohen-Macaulay relative complexes, and we construct a family of disconnected …
-
Decompositions of Betti diagrams
In this dissertation, we are concerned with decompositions of Betti diagrams over standard graded rings and the information about that ring and its modules that can be recovered from these decompositions. In Chapter 2, we study the structure of modules over short Gorenstein graded rings and …
-
Constructions of open book decompositions
… this to construct nice, minimal genus open book decompositions compatible with all of the universally tight contact structures (as well as a few others) on torus-bundles over S¹, following Honda's classification. In an accurate sense, we find Stein fillings of 'half' of the torus bundles. In …
-
Direct decompositions of abelian groups
Not available
-
Bruhat decompositions and Schubert varieties
This paper is divided into two parts. In first chapter we give a special C* action on G/ P and show that the associated plus decomposition of this action is the Bruhat decomposition of G/P. Moreover we prove that the set of Schubert varieties of Gk(Cⁿ) is in one to one correspondence with the plus …
-
Localized structure in graph decompositions
… provided an existence theory for balanced G-decompositions of Kv. Shortly afterwards, Bonisoli, Bonvicini, and Rinaldi introduced degree- and orbit-balanced G-decompositions. Similar to balanced decompositions,these two types of G-decompositions impose a local structure on the vertices of Kv. …
-
Decompositions of graphs and hypergraphs
… results in the areas of design theory and edge decompositions of graphs and hypergraphs. Most notably, we give a new proof of the existence conjecture, dating back to the 19th century. For \(r\)-graphs \(F\) and \(G\), an \(F\)-decomposition of G is a collection of edge-disjoint copies of F in G …
-
Branch decompositions and their applications
… and bound while another method is by graph decompositions. In the 1980's, Robertson and Seymour conceived of two new ways to decompose the graph in order to solve these problems. These ingenious ideas were only by-products of their work proving Wagner's Conjecture. A branch decomposition is …
-
HPC algorithms for nonnegative decompositions
Muchos problemas procedentes de aplicaciones del mundo real pueden ser modelados como problemas matemáticos con magnitudes no negativas, y por tanto, las soluciones de estos problemas matemáticos solo tienen sentido si son no negativas. Estas magnitudes no negativas pueden ser, por ejemplo, las …
-
Graph factors and Hamiltonian decompositions.
A necessary and sufficient condition is obtained for a bipartite graph to have an f-factor which includes a designated set of edges and is disjoint from another designated set of edges. Various other characterizations are obtained for similar subgraph structures, and a characterization is obtained …
-
Enumeration of inequivalent cycle decompositions
… to count the number of inequivalent k-cycle decompositions of order n.
-
Width functions for hypertree decompositions
… terms of the cardinalities of the pieces of tree-decompositions. Hypertree-width can be understood as a variant of tree-width which results from applying a measure other than cardinality to the pieces. This idea gives rise to a unifying framework (f-hypertree-width) for tree-width, hypertree-width …
-
Polygon visibility decompositions with applications.
… pi. We investigate the application of visibility decompositions of polygons to solving problems of the forms described. Any visibility decomposition pi of a polygon P that we construct will have the property that, for some class of polygons ℘ where the polygons in ℘ have useful …
Page 1 of 48