Matroid Theory Release 9.4
Total Page：16
File Type：pdf, Size：1020Kb
Load more
Recommended publications
-
Even Factors, Jump Systems, and Discrete Convexity
Even Factors, Jump Systems, and Discrete Convexity Yusuke KOBAYASHI¤ Kenjiro TAKAZAWAy May, 2007 Abstract A jump system, which is a set of integer lattice points with an exchange property, is an extended concept of a matroid. Some combinatorial structures such as the degree sequences of the matchings in an undirected graph are known to form a jump system. On the other hand, the maximum even factor problem is a generalization of the maximum matching problem into digraphs. When the given digraph has a certain property called odd- cycle-symmetry, this problem is polynomially solvable. The main result of this paper is that the degree sequences of all even factors in a digraph form a jump system if and only if the digraph is odd-cycle-symmetric. Furthermore, as a gen- eralization, we show that the weighted even factors induce M-convex (M-concave) functions on jump systems. These results suggest that even factors are a natural generalization of matchings and the assumption of odd-cycle-symmetry of digraphs is essential. 1 Introduction In the study of combinatorial optimization, extensions of matroids are introduced as abstract con- cepts including many combinatorial objects. A number of optimization problems on matroidal structures can be solved in polynomial time. One of the extensions of matroids is a jump system of Bouchet and Cunningham [2]. A jump system is a set of integer lattice points with an exchange property (to be described in Section 2.1); see also [18, 22]. It is a generalization of a matroid [4], a delta-matroid [1, 3, 8], and a base polyhedron of an integral polymatroid (or a submodular sys- tem) [14]. -
Some Topics Concerning Graphs, Signed Graphs and Matroids
SOME TOPICS CONCERNING GRAPHS, SIGNED GRAPHS AND MATROIDS DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of the Ohio State University By Vaidyanathan Sivaraman, M.S. Graduate Program in Mathematics The Ohio State University 2012 Dissertation Committee: Prof. Neil Robertson, Advisor Prof. Akos´ Seress Prof. Matthew Kahle ABSTRACT We discuss well-quasi-ordering in graphs and signed graphs, giving two short proofs of the bounded case of S. B. Rao's conjecture. We give a characterization of graphs whose bicircular matroids are signed-graphic, thus generalizing a theorem of Matthews from the 1970s. We prove a recent conjecture of Zaslavsky on the equality of frus- tration number and frustration index in a certain class of signed graphs. We prove that there are exactly seven signed Heawood graphs, up to switching isomorphism. We present a computational approach to an interesting conjecture of D. J. A. Welsh on the number of bases of matroids. We then move on to study the frame matroids of signed graphs, giving explicit signed-graphic representations of certain families of matroids. We also discuss the cycle, bicircular and even-cycle matroid of a graph and characterize matroids arising as two different such structures. We study graphs in which any two vertices have the same number of common neighbors, giving a quick proof of Shrikhande's theorem. We provide a solution to a problem of E. W. Dijkstra. Also, we discuss the flexibility of graphs on the projective plane. We conclude by men- tioning partial progress towards characterizing signed graphs whose frame matroids are transversal, and some miscellaneous results. -
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Daniel Lokshtanov1, Pranabendu Misra2, Fahad Panolan1, Saket Saurabh1,2, and Meirav Zehavi3 1 University of Bergen, Bergen, Norway. {daniello,pranabendu.misra,fahad.panolan}@ii.uib.no 2 The Institute of Mathematical Sciences, HBNI, Chennai, India. [email protected] 3 Ben-Gurion University, Beersheba, Israel. [email protected] Abstract Deterministic polynomial-time computation of a representation of a transversal matroid is a longstanding open problem. We present a deterministic computation of a so-called union rep- resentation of a transversal matroid in time quasipolynomial in the rank of the matroid. More precisely, we output a collection of linear matroids such that a set is independent in the trans- versal matroid if and only if it is independent in at least one of them. Our proof directly implies that if one is interested in preserving independent sets of size at most r, for a given r ∈ N, but does not care whether larger independent sets are preserved, then a union representation can be computed deterministically in time quasipolynomial in r. This consequence is of independent interest, and sheds light on the power of union representation. Our main result also has applications in Parameterized Complexity. First, it yields a fast computation of representative sets, and due to our relaxation in the context of r, this computation also extends to (standard) truncations. In turn, this computation enables to efficiently solve various problems, such as subcases of subgraph isomorphism, motif search and packing problems, in the presence of color lists. Such problems have been studied to model scenarios where pairs of elements to be matched may not be identical but only similar, and color lists aim to describe the set of compatible elements associated with each element. -
![Arxiv:1403.0920V3 [Math.CO] 1 Mar 2019](https://docslib.b-cdn.net/cover/8507/arxiv-1403-0920v3-math-co-1-mar-2019-398507.webp)
Arxiv:1403.0920V3 [Math.CO] 1 Mar 2019
Matroids, delta-matroids and embedded graphs Carolyn Chuna, Iain Moffattb, Steven D. Noblec,, Ralf Rueckriemend,1 aMathematics Department, United States Naval Academy, Chauvenet Hall, 572C Holloway Road, Annapolis, Maryland 21402-5002, United States of America bDepartment of Mathematics, Royal Holloway University of London, Egham, Surrey, TW20 0EX, United Kingdom cDepartment of Mathematics, Brunel University, Uxbridge, Middlesex, UB8 3PH, United Kingdom d Aschaffenburger Strasse 23, 10779, Berlin Abstract Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic matroids to the setting of embedded graphs. We show that various basic ribbon graph operations and concepts have delta-matroid analogues, and illus- trate how the connections between embedded graphs and delta-matroids can be exploited. Also, in direct analogy with the fact that the Tutte polynomial is matroidal, we show that several polynomials of embedded graphs from the liter- ature, including the Las Vergnas, Bollab´as-Riordanand Krushkal polynomials, are in fact delta-matroidal. Keywords: matroid, delta-matroid, ribbon graph, quasi-tree, partial dual, topological graph polynomial 2010 MSC: 05B35, 05C10, 05C31, 05C83 1. Overview Matroid theory is often thought of as a generalization of graph theory. Many results in graph theory turn out to be special cases of results in matroid theory. This is beneficial -
Partial Fields and Matroid Representation
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by UC Research Repository Partial Fields and Matroid Representation Charles Semple and Geoff Whittle Department of Mathematics Victoria University PO Box 600 Wellington New Zealand April 10, 1995 Abstract A partial field P is an algebraic structure that behaves very much like a field except that addition is a partial binary operation, that is, for some a; b ∈ P, a + b may not be defined. We develop a theory of matroid representation over partial fields. It is shown that many im- portant classes of matroids arise as the class of matroids representable over a partial field. The matroids representable over a partial field are closed under standard matroid operations such as the taking of mi- nors, duals, direct sums and 2{sums. Homomorphisms of partial fields are defined. It is shown that if ' : P1 → P2 is a non-trivial partial field homomorphism, then every matroid representable over P1 is rep- resentable over P2. The connection with Dowling group geometries is examined. It is shown that if G is a finite abelian group, and r>2, then there exists a partial field over which the rank{r Dowling group geometry is representable if and only if G has at most one element of order 2, that is, if G is a group in which the identity has at most two square roots. 1 1 Introduction It follows from a classical (1958) result of Tutte [19] that a matroid is rep- resentable over GF (2) and some field of characteristic other than 2 if and only if it can be represented over the rationals by the columns of a totally unimodular matrix, that is, by a matrix over the rationals all of whose non- zero subdeterminants are in {1; −1}. -
Invitation to Matroid Theory
Invitation to Matroid Theory Gregory Henselman-Petrusek January 21, 2021 Abstract This text is a companion to the short course Invitation to matroid theory taught in the Univer- sity of Oxford Centre for TDA in January 2021. It was first written for algebraic topologists, but should be suitable for all audiences; no background in matroid theory is assumed! 1 How to use this text Matroid theory is a beautiful, powerful, and accessible. Many important subjects can be understood and even researched with just a handful of concepts and definitions from matroid theory. Even so, getting use out of matroids often depends on knowing the right keywords for an internet search, and finding the right keyword depends on two things: (i) a precise knowledge of the core terms/definitions of matroid theory, and (ii) a birds eye view of the network of relationships that interconnect some of the main ideas in the field. These are the focus of this text; it falls far short of a comprehensive overview, but provides a strong start to (i) and enough of (ii) to build an interesting (and fun!) network of ideas including some of the most important concepts in matroid theory. The proofs of most results can be found in standard textbooks (e.g. Oxley, Matroid theory). Exercises are chosen to maximize the fraction intellectual reward time required to solve Therefore, if an exercise takes more than a few minutes to solve, it is fine to look up answers in a textbook! Struggling is not prerequisite to learning, at this level. 2 References The following make no attempt at completeness. -
Parity Systems and the Delta-Matroid Intersection Problem
Parity Systems and the Delta-Matroid Intersection Problem Andr´eBouchet ∗ and Bill Jackson † Submitted: February 16, 1998; Accepted: September 3, 1999. Abstract We consider the problem of determining when two delta-matroids on the same ground-set have a common base. Our approach is to adapt the theory of matchings in 2-polymatroids developed by Lov´asz to a new abstract system, which we call a parity system. Examples of parity systems may be obtained by combining either, two delta- matroids, or two orthogonal 2-polymatroids, on the same ground-sets. We show that many of the results of Lov´aszconcerning ‘double flowers’ and ‘projections’ carry over to parity systems. 1 Introduction: the delta-matroid intersec- tion problem A delta-matroid is a pair (V, ) with a finite set V and a nonempty collection of subsets of V , called theBfeasible sets or bases, satisfying the following axiom:B ∗D´epartement d’informatique, Universit´edu Maine, 72017 Le Mans Cedex, France. [email protected] †Department of Mathematical and Computing Sciences, Goldsmiths’ College, London SE14 6NW, England. [email protected] 1 the electronic journal of combinatorics 7 (2000), #R14 2 1.1 For B1 and B2 in and v1 in B1∆B2, there is v2 in B1∆B2 such that B B1∆ v1, v2 belongs to . { } B Here P ∆Q = (P Q) (Q P ) is the symmetric difference of two subsets P and Q of V . If X\ is a∪ subset\ of V and if we set ∆X = B∆X : B , then we note that (V, ∆X) is a new delta-matroid.B The{ transformation∈ B} (V, ) (V, ∆X) is calledB a twisting. -
Matroids, Cyclic Flats, and Polyhedra
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by ResearchArchive at Victoria University of Wellington Matroids, Cyclic Flats, and Polyhedra by Kadin Prideaux A thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Master of Science in Mathematics. Victoria University of Wellington 2016 Abstract Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining them. A common feature of these is that they areable to be efficiently tested, certifying whether a given input complies withsuch an axiom system in polynomial time. Joseph Bonin and Anna de Mier, re- discovering a theorem first proved by Julie Sims, developed an axiom system for matroids in terms of their cyclic flats and the ranks of those cyclic flats. As with other matroid axiom systems, this is able to be tested in polynomial time. Distinct, non-isomorphic matroids may each have the same lattice of cyclic flats, and so matroids cannot be defined solely in terms of theircyclic flats. We do not have a clean characterisation of families of sets thatare cyclic flats of matroids. However, it may be possible to tell in polynomial time whether there is any matroid that has a given lattice of subsets as its cyclic flats. We use Bonin and de Mier’s cyclic flat axioms to reduce the problem to a linear program, and show that determining whether a given lattice is the lattice of cyclic flats of any matroid corresponds to finding in- tegral points in the solution space of this program, these points representing the possible ranks that may be assigned to the cyclic flats. -
Parameterized Algorithms Using Matroids Lecture I: Matroid Basics and Its Use As Data Structure
Parameterized Algorithms using Matroids Lecture I: Matroid Basics and its use as data structure Saket Saurabh The Institute of Mathematical Sciences, India and University of Bergen, Norway, ADFOCS 2013, MPI, August 5{9, 2013 1 Introduction and Kernelization 2 Fixed Parameter Tractable (FPT) Algorithms For decision problems with input size n, and a parameter k, (which typically is the solution size), the goal here is to design an algorithm with (1) running time f (k) nO , where f is a function of k alone. · Problems that have such an algorithm are said to be fixed parameter tractable (FPT). 3 A Few Examples Vertex Cover Input: A graph G = (V ; E) and a positive integer k. Parameter: k Question: Does there exist a subset V 0 V of size at most k such ⊆ that for every edge( u; v) E either u V 0 or v V 0? 2 2 2 Path Input: A graph G = (V ; E) and a positive integer k. Parameter: k Question: Does there exist a path P in G of length at least k? 4 Kernelization: A Method for Everyone Informally: A kernelization algorithm is a polynomial-time transformation that transforms any given parameterized instance to an equivalent instance of the same problem, with size and parameter bounded by a function of the parameter. 5 Kernel: Formally Formally: A kernelization algorithm, or in short, a kernel for a parameterized problem L Σ∗ N is an algorithm that given ⊆ × (x; k) Σ∗ N, outputs in p( x + k) time a pair( x 0; k0) Σ∗ N such that 2 × j j 2 × • (x; k) L (x 0; k0) L , 2 () 2 • x 0 ; k0 f (k), j j ≤ where f is an arbitrary computable function, and p a polynomial. -
Matroid Partitioning Algorithm Described in the Paper Here with Ray’S Interest in Doing Ev- Erything Possible by Using Network flow Methods
Chapter 7 Matroid Partition Jack Edmonds Introduction by Jack Edmonds This article, “Matroid Partition”, which first appeared in the book edited by George Dantzig and Pete Veinott, is important to me for many reasons: First for per- sonal memories of my mentors, Alan J. Goldman, George Dantzig, and Al Tucker. Second, for memories of close friends, as well as mentors, Al Lehman, Ray Fulker- son, and Alan Hoffman. Third, for memories of Pete Veinott, who, many years after he invited and published the present paper, became a closest friend. And, finally, for memories of how my mixed-blessing obsession with good characterizations and good algorithms developed. Alan Goldman was my boss at the National Bureau of Standards in Washington, D.C., now the National Institutes of Science and Technology, in the suburbs. He meticulously vetted all of my math including this paper, and I would not have been a math researcher at all if he had not encouraged it when I was a university drop-out trying to support a baby and stay-at-home teenage wife. His mentor at Princeton, Al Tucker, through him of course, invited me with my child and wife to be one of the three junior participants in a 1963 Summer of Combinatorics at the Rand Corporation in California, across the road from Muscle Beach. The Bureau chiefs would not approve this so I quit my job at the Bureau so that I could attend. At the end of the summer Alan hired me back with a big raise. Dantzig was and still is the only historically towering person I have known. -
Computing Algebraic Matroids
COMPUTING ALGEBRAIC MATROIDS ZVI ROSEN Abstract. An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit poly- nomial attached to each circuit, and the degree of the projection map to each base, called the base degree. Decorated algebraic matroids can be computed via symbolic computation using Gr¨obnerbases, or through linear algebra in the space of differentials (with decora- tions calculated using numerical algebraic geometry). Both algorithms are developed here. Failure of the second algorithm occurs on a subvariety called the non-matroidal or NM- locus. Decorated algebraic matroids have widespread relevance anywhere that coordinates have combinatorial significance. Examples are computed from applied algebra, in algebraic statistics and chemical reaction network theory, as well as more theoretical examples from algebraic geometry and matroid theory. 1. Introduction Algebraic matroids have a surprisingly long history. They were studied as early as the 1930's by van der Waerden, in his textbook Moderne Algebra [27, Chapter VIII], and MacLane in one of his earliest papers on matroids [20]. The topic lay dormant until the 70's and 80's, when a number of papers about representability of matroids as algebraic ma- troids were published: notably by Ingleton and Main [12], Dress and Lovasz [7], the thesis of Piff [24], and extensively by Lindstr¨om([16{19], among others). In recent years, the al- gebraic matroids of toric varieties found application (e.g. in [22]); however, they have been primarily confined to that setting. Renewed interest in algebraic matroids comes from the field of matrix completion, starting with [14], where the set of entries of a low-rank matrix are the ground set of the algebraic matroid associated to the determinantal variety. -
Lecture 13 — February, 1 2014 1 Overview 2 Matroids
Advanced Graph Algorithms Jan-Apr 2014 Lecture 13 | February, 1 2014 Lecturer: Saket Saurabh Scribe: Sanjukta Roy 1 Overview In this lecture we learn what is Matroid, the connection between greedy algorithms and matroids. We also look at some examples of Matroids e.g., Linear Matroids, Graphic Matroids etc. 2 Matroids 2.1 A Greedy Approach Let G = (V, E) be a connected undirected graph and let w : E ! R≥0 be a weight function on the edges. For MWST Kruskal's so-called greedy algorithm works. Consider Maximum Weight Matching problem. 1 a b 3 3 d c 4 Application of the greedy algorithm gives (d,c) and (a,b). However, (d,c) and (a,b) do not form a matching of maximum weight. It is obviously not true that such a greedy approach would lead to an optimal solution for any combinatorial optimization problem. It turns out that the structures for which the greedy algorithm does lead to an optimal solution, are the matroids. 2.2 Matroids Definition 1. A pair M = (E, I), where E is a ground set and I is a family of subsets (called independent sets) of E, is a matroid if it satisfies the following conditions: (I1) φ 2 IorI = ø: 1 (I2) If A0 ⊆ A and A 2 I then A0 2 I. (I3) If A, B 2 I and jAj < jBj, then 9e 2 (B n A) such that A [feg 2 I: The axiom (I2) is also called the hereditary property and a pair M = (E, I) satisfying (I1) and (I2) is called hereditary family or set-family.