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 1369 for “"Combinatorial"”.
-
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 …
-
Combinatorial incremental problems
We study the class of Incremental Combinatorial optimization problems, where solutions are evaluated as they are built, as opposed to only measuring the performance of the final solution. Even though many of these problems have been studied, it has' usually been in isolation, so the first objective …
-
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 …
-
Topics in Combinatorial Algorithms
… This thesis deals with various aspects of combinatorial algorithms and data structures.
-
Probabilistic combinatorial optimization problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988.
-
Combinatorial Methods in Statistics
This thesis explores combinatorial methods in random vector balancing, nonparametric estimation, and network inference. First, motivated by problems from controlled experiments, we study random vector balancing from the perspective of discrepancy theory, a classical topic in combinatorics, and give …
-
A combinatorial flag space
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1994.
-
Massively parallel combinatorial microbiology
… new platform for constructing massively parallel combinatorial arrays of these parts in order to measure their interactions directly. I describe how kChip has been used to reveal patterns in microbial community assembly, unearth minimal microbial combinations with desirable functions, and screen …
-
An Application of Combinatorial Methods
… likely. Probability theory is simply enumerative combinatorial analysis when applied to finite sets. For a given finite sample space, probability questions are usually "just" a lot of counting. The purpose of this thesis is to provide some in depth analysis of several combinatorial methods, …
-
Combinatorial optimization using quantum computing
This thesis explores quantum computing for combinatorial optimization through the Traveling Salesman Problem (TSP), which aims to find a minimum-cost Hamiltonian cycle visiting each city exactly once. Using Qiskit, we implement the Quantum Approximate Optimization Algorithm (QAOA) on both …
-
Combinatorial Problems on the Chessboard
Positional chess problems concern the placement of chess pieces, on a given board, that satisfy certain criteria. Classic examples are the independence and domination problems. The former asks for a maximal placement of a given chess piece such that no piece in the placement can move to the …
-
Combinatorial Algorithms in Scientific Computing
This thesis highlighted combinatorial techniques in scientific computing as a research field full of interesting problems with real impact. From the scientific computing point of view, our results show that very significant computational savings can be achieved by employing combinatorial …
-
Topics in Combinatorial Number Theory
… we present a number of new results in combinatorial number theory. Chapter I discusses a generalization of B(,2)-sequences which are used in Chapter II and Chapter III to obtain short interval results about k-free values of irreducible polynomials. Chapter IV deals with the number of …
-
Combinatorial optimization on embedded curves
We describe several algorithms for classifying, comparing and optimizing curves on surfaces. We give algorithms to compute the minimum member of a given homology class, particularly computing the maximum flow and minimum cuts, in surface embedded graphs. We describe approximation algorithms to …
-
Combinatorial approaches to integer sequences
Combinatorial methods are used to prove several results in number theory. The chapters may be read independently, and are briefly discussed below.
-
Combinatorial complexes associated to surfaces
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms
-
Tilings and other combinatorial results
… three tiling problems and three problems in combinatorial geometry, extremal graph theory and sparse Ramsey theory. We first consider tilings of $\mathbb{Z}^n$. In this setting a tile $T$ is just a finite subset of $\mathbb{Z}^n$. We say that $T$ tiles $\mathbb{Z}^n$ if the latter set admits …
Page 1 of 69