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 11 of 11 for “"polymatroids"”.
-
Connectivity of Matroids and Polymatroids
… concerns alternate senses in which matroids and polymatroids can be connected. After a brief introduction to matroid theory in Chapter 1, the main results of this dissertation are given in Chapters 2 and 3. Tutte proved that, for an element e of a 2- connected matroid M , either the deletion or …
-
Finite Groups, Polymatroids, and Error-Correcting Codes
… over finite fields to finite groups and polymatroids. In the first half of this dissertation we describe this generalization and, given a finite group Γ, begin the characterization of polymatroids representable over Γ. We show that there is a unique excluded minor for matroids …
-
q-Polymatroids and their application to rank-metric codes.
… codes. This relation was then generalized to q-polymatroids and linear matrix rank metric codes. This dissertation aims at developing the theory of q-(poly)matroid and its relation to the theory of rank metric codes. In a first part, we recall and establish preliminary results for both …
-
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)
The main problem studied in this thesis is that of comparing a minimum-delay time-varying routing assignment in a dynamic network where the node demands and link capacities are deterministic functions of time, and where the commodity being routed is represented by continuous variables. A single …
-
Dissecting an integer polymatroid
… C, we can define another class: the class of k-polymatroids whose k-natural matroids are in C. This new class is (polymatroid) minor-closed as well as closed under a generalization of matroid duality known as k-duality. For the case k = 2, Bonin and Long determined the set of excluded minors for …
-
On Matroid and Polymatroid Connectivity
… to understand the structure of matroids and polymatroids. In this dissertation, we study the notion of connectivity from several angles. It is a well-known result of Tutte that, for every element x of a connected matroid M, at least one of the deletion and contraction of x from M is …
-
SUBMODULAR FUNCTIONS, GRAPHS AND INTEGER POLYHEDRA
… the vertices of the intersection of two integral polymatroids and the integrality of the vertices of strong k-cover and strong k-matching polyhedra. Chapter 7 is a discussion of the facets of polyhedra defined in Chapter 6 and we obtain a description of the facets of a subclass of these polyhedra …
-
On the Fundamental Limits and Symmetric Designs for Distributed Information Systems
… entropic vectors and representability of integer polymatroids, construction of such vector has been discussed. Specifically, It is shown that representability of the particularly constructed matroid is a sufficient condition for integer polymatroids to be linearly representable over real numbers. …
-
Theory and applications of freedom in matroids
… flats of M*. If ζ(M) is the set of integer polymatroids with underlying matroid structure M, then we show that for any cell e of M ǁ e ǁ= \frac{max\ f \ (e)}{f\in\zeta} We look at freedom in binary matroids and show that for a connected binary matroid M, ǁ e ǁ is the number of connected …
-
On Matroid Theory and Distributed Data Storage
… mixed alphabets and derive their tradeoff using polymatroids.
-
Lattice minors and Eulerian posets
We study a partial ordering on pairings called the uncrossing poset, which first appeared in the literature in connection with a certain stratified space of planar electrical networks. We begin by examining some of the relationships between the uncrossing poset and Catalan combinatorics, and then …