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 50 for “"Matroid Theory"”.
-
On Matroid Theory and Distributed Data Storage
… storage codes and the relation between codes and matroids. Matroids are interesting mathematical objects on their own right and provide useful tools related to the alphabet. In the articles composing this thesis, we derive alphabet-dependent tradeoffs with various locality assumptions. …
-
Metabolic Networks, Thermodynamic Constraints, and Matroid Theory
… the analysis of metabolic networks. Using matroid theory I show how modules can efficiently be computed. With the definition of k-module, I also show a decomposition theorem for general polyhedra using the concept of matroid branch-width. With flux modules and algorithmic approaches to also …
-
Comparing 3-Connectedness and Roundness in Matroid Theory
A matroid is a discrete mathematical object that abstracts and connects the various notions of independence found throughout mathematics. Such notions of independence include linear independence, algebraic independence, as well as notions of independence that arise in graph theory. There are many …
-
Type synthesis of mechanisms using matroid theory with applications to assistive technology
… de helicoides, método de Davies e teoria de matroides. O método de Davies e teoria de helicoides são usados para modelar mecanismos em termos de liberdades e restrições. Matroides são usados para enumerar mecanismos autoalinhantes usando os modelos criados com o método de Davies como entrada. …
-
A Dual Fano, and Dual Non-Fano Matroidal Network
<p>Matroidal networks are useful tools in furthering research in network coding. They have been used to show the limitations of linear coding solutions. In this paper we examine the basic information on network coding and matroid theory. We then go over the method of creating matroidal networks. …
-
Tutte's first colour-cycle conjecture
… of W. T. Tutte's paper "A contribution to the theory of chromatic polynomials''. It is believed that this conjecture has not previously been resolved. Sections 25 and 38 are original. The remainder of the thesis is a summary of the requisite graph theory and matroid theory. Most of the material …
-
Regular Round Matroids
A matroid M is a finite set E, called the ground set of M, together with a notion of what it means for subsets of E to be independent. Some matroids, called regular matroids, have the property that all elements in their ground set can be represented by vectors over any field. A matroid is called …
-
Exploring Flag Matroids and Duality
Matroids capture an abstraction of independence in mathematics, and in doing so, connect discrete mathematical structures that arise in a variety of contexts. A matroid can be defined in several cryptomorphic ways depending on which perspective of a matroid is most applicable to the given context. …
-
Matroids, Matrices, and Partial Hyperstructures
… application of algebra and algebraic geometry to matroid theory. Baker and Bowler developed the notions of weak and strong matroids over tracts. Later, Baker and Lorscheid developed the notion of foundation of a matroid, which characterize the representability of the matroid. We study a variety of …
-
Exploring Matroid Minors
Matroids are discrete mathematical objects that generalize important concepts of independence arising in other areas of mathematics. There are many different important classes of matroids and a frequent problem in matroid theory is to determine whether or not a given matroid belongs to a certain …
-
Dependence Deduction: A New Perspective in Constructing Matroidal Networks
Matroidal networks play a fundamental role in proving theoretical results on the limitation of network coding. This can be explained by the underlying connections between network coding and matroid theory. Two existing methods are known in the network coding literature for constructing networks …
-
Polytopes of Cographic Unimodular Systems and Valuated Delta-Matroids
Here we will cover topics arising from matroid theory. To any graphic matroid, we can associate a certain class of polytopes via its representation forming the well-studied generalized permutahedra. When studying these permutehdra, it has been useful understanding both their normal fans and the …
-
Matroids and Geometric Invariant Theory of torus actions on flag spaces
… SL(n,C) weight variety is a Geometric Invariant Theory quotient of the space of full flags by the maximal torus in SL(n,C). Special cases include configurations of n-tuples of points in projective space modulo automorphisms of projective space. There are three main results. The first is an …
-
Representations of matroids
The concept of matroids was originally introduced by Whitney and Van der Waerden in the 1930's to generalise the notion of linear dependence in a vector space; certain axioms satisfied by this relation were observed to be satisfied by other types of ’ dependence’ relations, such as algebraic …
-
TOPOLOGICAL STRUCTURE OF SPATIALLY-DISTRIBUTED NETWORK CODED INFORMATION
… algebraic topology, persistent homology, and matroid theory to study it. The coverage complex shares properties with the Rips complex, however it also suffers from a more diverse variety of potential failures. We extend the standard coverage criteria to account for some of these situations …
-
Extremal Connectivity in Graphs and Matroids
Connectivity is a central theme in both graph theory and matroid theory. This dissertation investigates extremal connectivity in graphs and matroids, with emphasis on unavoidable structures and minimal connectivity phenomena. Chapter 2 introduces cycle-contraction minors of graphs and investigates …
-
Verifying Sudoku Puzzles
… we investigate this question in the context of matroid theory and present a matroid theoretic solution by using the concept of circuits of a matroid.
-
Excluded minors for nearly-paving matroids
Matroids capture an abstract notion of independence that generalizes linear independence in linear algebra, edge independence in graph theory, as well as algebraic independence. Given a particular property of matroids, all the matroids possessing that property form a matroid class. A common …
-
Accessing the Topological Properties of Neural Network Functions.
… tool from hyperplane arrangements and oriented matroid theory. Our theoretical results lead to algorithms for computing not only the canonical polyhedral complex itself but topological invariants of its substructures such as the decision boundary, as well as for evaluating the presence of PL …
-
On the robustness of clustered sensor networks
… presents efficient algorithms based on matroid theory to compute the redundancy degree of a clustered sensor network. In the efficient algorithms, a cluster pattern of a sensor network allows us to decompose a large sensor network into smaller sub-systems, from which the redundancy …
Page 1 of 3