Theory and applications of freedom in matroids

To each cell e in a matroid M we can associate a non-negative integer lIell called the freedom of e. Geometrically the value Ilell indicates how freely placed the cell ~s ~n the matroid. We see tha t II e II ~s equal to the degree of the modular cut generated by all the fully-dependent flats of M co...

Full description

Bibliographic Details
Main Author: Duke, R.
Published: Open University 1981
Subjects:
510
Online Access:https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.354270
id ndltd-bl.uk-oai-ethos.bl.uk-354270
record_format oai_dc
spelling ndltd-bl.uk-oai-ethos.bl.uk-3542702018-11-20T03:19:27ZTheory and applications of freedom in matroidsDuke, R.1981To each cell e in a matroid M we can associate a non-negative integer lIell called the freedom of e. Geometrically the value Ilell indicates how freely placed the cell ~s ~n the matroid. We see tha t II e II ~s equal to the degree of the modular cut generated by all the fully-dependent flats of M containing e . The relationship between freedom and basic matroid constructions, particularly one-point lifts and duality, is examined, and then applied to erections. We see that the number of times a matroid M can be erected is related to the degree of the modular cut generated by all the fully-dependent flats of W<. If Z;;(M) is the set of integer polymatroids with underlying matroid structure M, then we show that for any cell e of M II ell max f (e) • f E 1;; (M) We look at freedom in binary matroids and show that for a connected binary matroid M, II e II is the number of connec ted components of M\e. Finally the matroid join is examined and we are able to solve a conjecture of Lovasz and Recski that a connected binary matroid M is reducible if and only if there is a cell e of M with M\e disconnected.510Pure mathematicsOpen Universityhttps://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.354270http://oro.open.ac.uk/56903/Electronic Thesis or Dissertation
collection NDLTD
sources NDLTD
topic 510
Pure mathematics
spellingShingle 510
Pure mathematics
Duke, R.
Theory and applications of freedom in matroids
description To each cell e in a matroid M we can associate a non-negative integer lIell called the freedom of e. Geometrically the value Ilell indicates how freely placed the cell ~s ~n the matroid. We see tha t II e II ~s equal to the degree of the modular cut generated by all the fully-dependent flats of M containing e . The relationship between freedom and basic matroid constructions, particularly one-point lifts and duality, is examined, and then applied to erections. We see that the number of times a matroid M can be erected is related to the degree of the modular cut generated by all the fully-dependent flats of W<. If Z;;(M) is the set of integer polymatroids with underlying matroid structure M, then we show that for any cell e of M II ell max f (e) • f E 1;; (M) We look at freedom in binary matroids and show that for a connected binary matroid M, II e II is the number of connec ted components of M\e. Finally the matroid join is examined and we are able to solve a conjecture of Lovasz and Recski that a connected binary matroid M is reducible if and only if there is a cell e of M with M\e disconnected.
author Duke, R.
author_facet Duke, R.
author_sort Duke, R.
title Theory and applications of freedom in matroids
title_short Theory and applications of freedom in matroids
title_full Theory and applications of freedom in matroids
title_fullStr Theory and applications of freedom in matroids
title_full_unstemmed Theory and applications of freedom in matroids
title_sort theory and applications of freedom in matroids
publisher Open University
publishDate 1981
url https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.354270
work_keys_str_mv AT duker theoryandapplicationsoffreedominmatroids
_version_ 1718795717853577216