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 5237 for “"Combinatorial"”.
-
Combinatorial remedies
… consists of 3 chapters which consider distinct combinatorial problems. In the first chapter we consider objects known as groupies. A non-isolated vertex of a graph G is called a groupie if the average degree of the vertices connected to it is larger than or equal to the average degree of the …
-
Combinatorial Laguerre Series
… subject to various restrictions by finding a combinatorial interpretation for a product of weighted sums of Laguerre polynomials. We describe how such a series can be computed by finding an appropriate ordinary generating function and applying a certain transformation. We use this technique to …
-
Random combinatorial processes
We study four problems in combinatorial probability, namely: activated random walk, an interacting particle process; a phase transition for Wishart matrices, a model of a random geometric graph; the Boolean intersection model, an intersection of random sets in $\mathbb{R}^d$; and rumor spreading …
-
Aspects of combinatorial probability
… contains the accumulation of five works in combinatorial probability, each with underlying connections to statistical physics. Central themes unifying these projects are in the analysis of stochastic processes for sampling combinatorial objects, and modeling combinatorially motivated …
-
ML-empowered combinatorial search
Combinatorial search problems underlie a wide range of computational tasks, from resource allocation in 5G networks and spectrum auctions to verification of hardware and software systems. Despite the best-known techniques having worst-case exponential complexity, many real-world instances exhibit …
-
Homogeneity of combinatorial spheres
… homogeneity of spheres, i.e. the complement of a combinatorial n-cell in a combinatorial n-sphere is a combinatorial n-cell. A piecewise linear proof of this theorem by a "long induction" using regular neighbourhoods and collapsing was given in [4]. A direct piecewise linear proof appeared …
-
Combinatorial Knot Floer Homology
… to compute. In 2006, in a paper titled "A combinatorial Description of Knot Floer Homology", the authors Ciprian Manolescu, Peter Ozsváth, and Sucharit Sarkar discovered an algorithm for purely combinatorial description of knot Floer homology, making its computation, in principle, fully …
-
Coroutine-based combinatorial generation
The two well-known approaches to designing combinatorial generation algorithms are the recursive approach and the iterative approach. In this thesis a third design approach using coroutines, introduced by Knuth and Ruskey, is explored further. An introduction to coroutines and their implementation …
-
Combinatorial Embeddings and Representations
… and complete multipartite graphs give rise to combinatorial designs when the faces of the embeddings are triangles. In this case, the blocks of the design correspond to the triangular faces of the embedding. These designs include Steiner, twofold and Mendelsohn triple systems, as well as Latin …
-
Combinatorial Laplacians on Complexes
The combinatorial Laplacian extends the graph Laplacian to simplicial complexes by using the coboundary maps of the simplicial cochain complex. Its spectrum contains both topological and combinatorial information. This dissertation studies eigenvalue bounds for these operators, extends the …
-
Combinatorial Games on Graphs
Combinatorial Games are intriguing and have a tendency to engross students and lead them into a serious study of mathematics. The engaging nature of games is the basis for this thesis. Two combinatorial games and some educational tools are presented which were developed by the author in the pursuit …
-
Discovering combinatorial disease biomarkers
… and targets the computational discovery of combinatorial biomarkers associated with complex human diseases from a variety of large scale case control genomic datasets. It addresses several key challenges confronted by existing discriminative pattern mining algorithms: computational …
-
Snort: A combinatorial game
This paper focuses on the game Snort, which is a combinatorial game on graphs. This paper will explore the characteristics of opposability through examples. More fully, we obtain some neccessary conditions for a graph to be opposable. Since an opposable graph guarantees a second player win, we …
-
Snort: A combinatorial game
This paper focuses on the game Snort, which is a combinatorial game on graphs. This paper will explore the characteristics of opposability through examples. More fully, we obtain some neccessary conditions for a graph to be opposable. Since an opposable graph guarantees a second player win, we …
-
Combinatorial Properties of Polyiamonds
… realized geometrically by a polyiamond. Further combinatorial and graph-theoretic aspects of polyiamonds are discussed, including a characterization of those polyiamonds that are three-connected and so three-polytopal, a result on Hamiltonicity, and constructions that use minimal numbers of …
-
Combinatorial Bin Packing Problems
… evaluating the expected behavior of what we call combinatorial bin packing problems. A combinatorial bin packing problem consists of a number of items of various sizes and value ratios (value per unit of size) along with a collection of bins of fixed capacity into which the items are to be packed. …
Page 1 of 262