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 79 for “"combinatorial methods"”.
-
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 Methods in Coding Theory
… thread of our results is the use of diverse combinatorial methods originating in coding theory and computer science. The thesis addresses three groups of problems. The first of them is aimed at the construction and analysis of codes for error correction. Here we examine properties of codes …
-
Combinatorial methods in differential algebra
… feature of this work is the use of combinatorial techniques, which offer a unique and original perspective on the subject matter. First, we establish the connection between the n-jet space of the fat point defined by xm and the stable set polytope of a perfect graph. We prove that …
-
Combinatorial methods for compressed sensing
… for those decoders are convex relaxation and combinatorial methods. The former approach requires the least number of samples for an exact reconstruction at the price of high complexities while the latter approach has low complexities but requires a higher number of samples for recovery. This …
-
Understanding piezoelectric nitrides by combinatorial methods
… requirements of these future networks. Here, combinatorial methods are applied in the search for new and improved piezoelectric nitride materials. In order to promote understanding of the current state of this field, a review of high-throughput methodology, nitride materials, and piezoelectric …
-
Low-depth circuit size bounds using combinatorial methods
… functions. The thesis is centred around the combinatorial tools and questions relevant for attacking these circuit size lower bound problems.<br><br>First, the analysis will focus on the maximum one-sided correlation achievable between polynomial-sized, constant-depth circuits and the clique …
-
Combinatorial methods in the study of Weyl module homomorphisms
… new results. First we show that under suitable combinatorial hypotheses on λ,μ and p we have Hom_G(Δ(λ),Δ(μ)) is nonzero. A nonzero homomorphism Hom_G(Δ(λ),Δ(μ)) is provided explicitly that corresponds to the sum of all semistandard tableaux of shape μ and weight λ. Second, we classify all …
-
Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus
… and Slofstra. In this thesis, we will extend the combinatorial techniques used in the papers of Goulden and Nica and Goulden and Slofstra, so that they can be applied to maps with an arbitrary number of vertices, when the graph being embedded is a tree with loops and multiple edges. This involves …
-
The word problem and combinatorial methods for groups and semigroups
The subject matter of this thesis is combinatorial semigroup theory. It includes material, in no particular order, from combinatorial and geometric group theory, formal language theory, theoretical computer science, the history of mathematics, formal logic, model theory, graph theory, and …
-
Combinatorial methods in number theory: Sieve theory and special functions
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
Behavioral Effects of Novel Treatments for Pain Management Using Combinatorial Methods
… (OUD) and fatal overdose. Finding new treatment methods, or improving existing methods, is crucial for patients with pain. This thesis explores two projects looking to develop safer analgesia using drug combination therapies. In one project, I investigated the potential synergistic and analgesic …
-
On Applications of Topological and Combinatorial Methods to the Theory of Groups
… Alternatively, graphs can be studied from a combinatorial point of view, developed by Ilya Kapovich and Alexei Myasnikov, which provides simple algorithms that answer questions about free groups. We give an exposition of both approaches and demonstrate how they are used to answer questions …
-
Combinatorial methods and search with generative AI for real-world testing and API synthesis
… tooling improvements. In this work, we leverage combinatorial and systematic search methods, augmented by generative AI, to improve the adoption of test-centric techniques, spanning test generation, execution, and development, in real-world software applications. Our work makes a threefold …
-
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.
-
Traceability schemes, frameproof codes, key distribution patterns and related topics: A combinatorial approach
… dissertation, these topics are investigated by combinatorial methods which are quite different from the previous tools used. Thus we are able to obtain many new results about the constructions and properties of these two objects. The combinatorial descriptions of these objects also reveal the …
-
Construction of few-angular spherical codes and line systems in Euclidean spaces
… are constructed via different algebraic and combinatorial methods. The most important algebraic method is automorphism prescription (in different forms) while combinatorial methods include exhaustive isomorph-free generation of Gram matrices of spherical codes and weighted clique search in …
-
Young tableaux with applications to representation theory and flag manifolds
… describe geometric and algebraic objects using combinatorial methods. In particular, we discuss applications to representations of the symmetric group and the general linear group, flag varieties, and Schubert varieties. We also describe some recent work, including proofs of the Saturation …
-
Finite Subdivision Rules from Matings of Quadratic Functions: Existence and Constructions
Combinatorial methods are utilized to examine preimage iterations of topologically glued polynomials. In particular, this paper addresses using finite subdivision rules and Hubbard trees as tools to model the dynamic behavior of mated quadratic functions. Several methods of construction of …
-
Knot complements and 3-manifolds
… as a compact 3-manifold. We will also apply some combinatorial methods in three-manifold topology to the study of the presentation of the knot complement.
Page 1 of 4