Counting Matroids. Rudi Pendavingh. 6 July, Rudi Pendavingh Counting Matroids 6 July, / 23
|
|
- Asher Doyle
- 5 years ago
- Views:
Transcription
1 Counting Matroids Rudi Pendavingh 6 July, 2015 Rudi Pendavingh Counting Matroids 6 July, / 23
2 First steps Definitions [n] := {1,..., n} m n := #{M matroid : E(M) = [n]} m n,r := #{M matroid : E(M) = [n], r(m) = r} Rudi Pendavingh Counting Matroids 6 July, / 23
3 First steps A naive upper bound A matroid on E = [n] is determined by its set of independent sets I 2 E. Hence m n # of subsets of 2 E 2 2n In other words: log m n 2 n (log = logarithm to the base 2) Rudi Pendavingh Counting Matroids 6 July, / 23
4 First steps A better upper bound A matroid on E = [n] of rank r is determined by bases B ( E r ) := {X E : X = r}, so m n,r # of subsets of ( ) E 2 (n r) 2 ( n/2 ) n r Therefore m n = r m n,r (n + 1)2 ( n/2 ) n, hence ( ) ( ) n 1 log m n log(n + 1) + O n 2 n n/2 as n Rudi Pendavingh Counting Matroids 6 July, / 23
5 Bounds of Piff and Knuth Piff s upper bound Lemma The following are equivalent for a matroid M = (E, B) and a set X E X is a dependent set of M there is a circuit C of M so that C X there is a circuit C of M so that X cl M (C) > r M (C) Each matroid M on ground set E is completely determined by K(M) := {(cl M (C), r M (C)) : C a circuit of M} Rudi Pendavingh Counting Matroids 6 July, / 23
6 Bounds of Piff and Knuth Piff s upper bound Each matroid M on ground set E is determined by K(M) := {(cl M (C), r M (C)) : C a circuit of M} Lemma If M is a matroid on n elements, then K(M) 2 n+1 /(n + 1). Proof. The map X cl M (X ) sends C e to cl M (C) for each e C, so Hence K(M) = i<n ( n i #{(cl M (C), r M (C)) : C a circuit of M, r M (C) = i} ( ) n /(i + 1). i ) ( /(i + 1) = n+1 i<n i+1) /(n + 1) = 2 n+1 /(n + 1). Rudi Pendavingh Counting Matroids 6 July, / 23
7 Bounds of Piff and Knuth Piff s upper bound Theorem (Piff, 1973) ( ) log(n) log m n O 2 n as n n Proof. m n is at most # of K 2 E [n + 1] of size K 2 n+1 /(n + 1), so m n 2 n+1 /(n+1) j=0 ( 2 n ) (n + 1) i The theorem follows using k j=0 ( ) N j ( ) en k k Rudi Pendavingh Counting Matroids 6 July, / 23
8 Bounds of Piff and Knuth How to (not) find a lower bound Piff: log m n O(2 n log(n)/n) as n class upper bound log u.b. ( graphic matroids n+1 ) n 2 O(n log n) binary matroids (2 n ) n n 2 GF(q)-representable matroids (q n ) n n 2 log q transversal matroids (2 n ) n n 2 real-representable matroids (Alon, 1986) 2 n3 n 3 Not even close. Rudi Pendavingh Counting Matroids 6 July, / 23
9 Bounds of Piff and Knuth Paving matroids Definition A matroid M is paving if C r(m) for each circuit C of M. Crapo and Rota (1970) consider it likely that paving matroids... would actually predominate in any asymptotic enumeration of geometries based on the enumeration of matroids up to 8 elements (Blackburn, Crapo, and Higgs). Definition A matroid M is sparse paving if both M and M are paving. If almost all matroids are paving, then almost all matroids are sparse paving. Rudi Pendavingh Counting Matroids 6 July, / 23
10 Bounds of Piff and Knuth The Johnson graph J(E, r) is the undirected graph with vertices: ( ) E := {X E : X = r} r and edges: X Y : X Y = 2 We write J(n, r) := J([n], r). J(4, 2) Lemma S is a stable set of J(E, r) M = (E, ( ) E \ S) is a sparse paving matroid r Rudi Pendavingh Counting Matroids 6 July, / 23
11 Bounds of Piff and Knuth Definitions s n := #{M sparse paving matroid : E(M) = [n]} s n,r := #{M sparse paving matroid : E(M) = [n], r(m) = r} s n,r equals the number of stable sets of J(n, r) Rudi Pendavingh Counting Matroids 6 July, / 23
12 Bounds of Piff and Knuth Knuth s lower bound on the number of matroids Let α(g) := max{ S : S V (G) a stable set of G}. Theorem (Knuth, 1974) log s n,r α(j(n, r)) Proof. J(n, r) has a stable set S 0 of size α(j(n, r)). Each S S 0 is a stable set of J(n, r), so that s n,r 2 S 0 = 2 α(j(n,r)) In 1974, this gave the lower bound log m n log s n log s n,n/2 α(j(n, n/2)) 1 ( ) n 2n n/2 Rudi Pendavingh Counting Matroids 6 July, / 23
13 Bounds of Piff and Knuth An improvement of Knuth s bound Theorem (Graham & Sloane, 1980) J(n, r) has a stable set of size ( n r) /n. Proof. For each k Z, the set ( ) [n] S(n, r, k) := {X : x = k mod n} r x X is stable in J(n, r). Since n k=1 S(n, r, k) = ( ) ( [n] r, we have S(n, r, k) > n ) r /n for some k. And so we obtain log m n log s n,n/2 α(j(n, n/2)) 1 n ( ) n. n/2 Rudi Pendavingh Counting Matroids 6 July, / 23
14 Recent work Three recent bounds By counting certain compressed, faithful descriptions of matroids: Theorem (Bansal, P., van der Pol, 2014) ( log 2 ( )) (n) n log m n O n n/2 Using Shearer s Entropy Lemma: Theorem (Bansal, P., van der Pol, 2014) ( ( )) log(n) n log m n O n n/2 Adapting a counting method for stable sets in graphs: Theorem (Bansal, P., van der Pol, 2014) log m n 2 + o(1) n as n as n ( ) n as n n/2 Rudi Pendavingh Counting Matroids 6 July, / 23
15 Recent work Compressed matroid descriptions Bounding by compression By Piff, Knuth, Graham&Sloane: ( ) 1 n log s n log m n O( log(n) 2 n ) as n n n/2 n Theorem (Bansal, P., van der Pol, 2014) ( log 2 ( )) (n) n log m n O n n/2 as n Proof outline: a cover of a matroid M gives a compressed description of M each matroid on n elements has a cover of size k n O ( log(n) n ( n ) ) n/2 # of matroids on n elements of rank r is the # of covers of size k n Rudi Pendavingh Counting Matroids 6 July, / 23
16 Recent work Compressed matroid descriptions Matroid covering A flat F such that F X > r(f ) certifies that X is dependent. Definition A set of flats Z covers a set U 2 E if F X > r(f ) for each dependent X U If Z covers ( E r ), then {(F, rm (F )) : F Z} is a faithful description of M of rank r. Lemma Each matroid M on n elements has a cover Z such that Z 10 log(n) n Proof. ( n ) n/2 J(n, r) is d = r(n r)-regular, so has a dominating set D of size D ln(d+1)+1 d+1 For each X D there is a set Z X covering N(X ) {X } of size Z X min{r, n r}. Then Z := X D Z X covers ( E r ), and Z min{r, n r} ln(d+1)+1 d+1 ( n r ). ( n ) r. Rudi Pendavingh Counting Matroids 6 July, / 23
17 Recent work Entropy Entropy counting Let W 2 U. For T U, put W T := {W T : W W}. If T 1,..., T m partitions U, then: W W T1 W Tm The following is a consequence of Shearers Entropy Lemma: Theorem If T 1,..., T m U and each u U occurs in at least k of the sets T i, then Lemma (Bansal, P., van der Pol) W k W T1 W Tm If m n,r counts the number of matroids in a contraction-closed class, then log(1 + m n,r ) ( n r ) log(1 + m n t,r t) ) U := ( ) E r, W := {sets B satisfying base exchange}, TS := {X ( ) ( E r : S X } for S E ) t. ( n t r t Rudi Pendavingh Counting Matroids 6 July, / 23
18 Recent work Entropy Bounding by entropy Lemma (Bansal, P., van der Pol) If m n,r counts the number of matroids in a contraction-closed class, then log(1 + m n,r ) ( n r Theorem (Bansal, P., van der Pol, 2014) ) log(1 + m n t,r t) ) log m n O( log(n) n ( n t r t ( ) n ) as n n/2 Proof. log(1 + m n,r ) ( n r ) log(1 + m n r+2,2) ) ( n r log(n + 1) n Rudi Pendavingh Counting Matroids 6 July, / 23
19 Recent work Conjectures Conjectures on matroid asymptotics We say that asymptotically almost all matroids have property P if #{M M n : M has property P} lim = 1 n #M n Here M n denotes the set of matroids with ground set {1,..., n}. Conjecture (Mayhew, Newman, Welsh and Whittle, 2011) If N is a fixed sparse paving matroid, then a.a.a. matroids have N as a minor. Let k N. Asymptotically almost all matroids are k-connected. Asymptotically almost all matroids are sparse paving. Asymptotically almost all matroids M on n elements have n 2 r(m) n 2. Rudi Pendavingh Counting Matroids 6 July, / 23
20 Recent work Conjectures Size of minor-closed classes Conjecture (Mayhew, Newman, Welsh and Whittle, 2011) If N is a fixed sparse paving matroid, then a.a.a. matroids have N as a minor. Theorem (P., van der Pol, 2013) U 2,k U 3,6 P 6 Q 6 R 6 True if N = U 2,k for some k 2, or if N is one of U 3,6, P 6, Q 6 or R 6. Theorem (P., van der Pol, 2014) The number s n of sparse paving matroids on n elements without M(K 4 )-minor satisfies log s n 1 ( ) n (1 o(1)) as n n n/2 Rudi Pendavingh Counting Matroids 6 July, / 23
21 Recent work Conjectures Connectivity Conjecture (Mayhew, Newman, Welsh and Whittle, 2011) Let k N. Asymptotically almost all matroids are k-connected. Theorem (Mayhew, Newman, Welsh and Whittle, 2011) Asymptotically almost all matroids are connected. Theorem (Oxley, Semple, Warshauer, Welsh, 2013) Asymptotically almost all matroids are 3-connected. Using Entropy: Theorem (P., van der Pol, 2014) Let k N. There is a c such that a.a.a matroids on n elements have no (< k)-separation {A, B} with min{ A, B } c log 2 (n). Rudi Pendavingh Counting Matroids 6 July, / 23
22 Recent work Conjectures Sparse paving matroid vs. matroid Conjecture (Mayhew, Newman, Welsh and Whittle, 2011) Asymptotically almost all matroids are sparse paving. So far: ( ) 1 n log s n log m n O n n/2 ( log n n ( )) n n/2 as n Theorem (Bansal, P., van der Pol, 2014) Theorem (P., van der Pol, 2015) log m n 2 + o(1) n ( ) n as n n/2 log m n = (1 + o(1)) log s n as n Rudi Pendavingh Counting Matroids 6 July, / 23
23 Recent work Conjectures The rank of a typical matroid Conjecture (Mayhew, Newman, Welsh and Whittle, 2011) Asymptotically almost all matroids M on n elements have n 2 r(m) n 2 Theorem (Oxley, Semple, Warshauer, and Welsh, 2013) For all ɛ > 0, asymptotically almost all matroids M on n elements have Theorem (P., van der Pol, 2015) 1 2 n ɛn < r(m) < 1 2 n + ɛn If β > , then asymptotically all matroids M on n elements have 1 2 n β n r(m) 1 2 n + β n Rudi Pendavingh Counting Matroids 6 July, / 23
Eindhoven University of Technology MASTER. Counting matroids. van der Pol, J.G. Award date: Link to publication
Eindhoven University of Technology MASTER Counting matroids van der Pol, J.G. Award date: 2013 Link to publication Disclaimer This document contains a student thesis (bachelor's or master's), as authored
More informationMATROID THEORY, Second edition
MATROID THEORY, Second edition James Oxley Oxford University Press, New York, 2011 Errata and Update on Conjectures, Problems, and References Latest update: August 16, 2016 The reader is encouraged to
More informationDetermining a Binary Matroid from its Small Circuits
Determining a Binary Matroid from its Small Circuits James Oxley Department of Mathematics Louisiana State University Louisiana, USA oxley@math.lsu.edu Charles Semple School of Mathematics and Statistics
More informationA MATROID EXTENSION RESULT
A MATROID EXTENSION RESULT JAMES OXLEY Abstract. Adding elements to matroids can be fraught with difficulty. In the Vámos matroid V 8, there are four independent sets X 1, X 2, X 3, and X 4 such that (X
More informationRelaxations of GF(4)-representable matroids
Relaxations of GF(4)-representable matroids Ben Clark James Oxley Stefan H.M. van Zwam Department of Mathematics Louisiana State University Baton Rouge LA United States clarkbenj@myvuw.ac.nz oxley@math.lsu.edu
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. In our quest to find a splitter theorem for internally 4-connected binary
More informationAn Introduction to Transversal Matroids
An Introduction to Transversal Matroids Joseph E Bonin The George Washington University These slides and an accompanying expository paper (in essence, notes for this talk, and more) are available at http://homegwuedu/
More informationCharacterizing binary matroids with no P 9 -minor
1 2 Characterizing binary matroids with no P 9 -minor Guoli Ding 1 and Haidong Wu 2 1. Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, USA Email: ding@math.lsu.edu 2. Department
More informationWHAT IS A MATROID? JAMES OXLEY
WHAT IS A MATROID? JAMES OXLEY Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Whitney s definition embraces a surprising diversity of combinatorial
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS VII
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS VII CAROLYN CHUN AND JAMES OXLEY Abstract. Let M be a 3-connected binary matroid; M is internally 4- connected if one side of every
More informationOn Maximum-Sized Golden-Mean Matroids
On Maximum-Sized Golden-Mean Matroids Michael Welsh VICTORIA UNIVERSITY OF WELLINGTON Te Whare Wananga o te Upoko o te Ika a Maui School of Mathematics, Statistics and Operations Research Te Kura Matai
More informationON CONTRACTING HYPERPLANE ELEMENTS FROM A 3-CONNECTED MATROID
ON CONTRACTING HYPERPLANE ELEMENTS FROM A 3-CONNECTED MATROID RHIANNON HALL Abstract. Let K 3,n, n 3, be the simple graph obtained from K 3,n by adding three edges to a vertex part of size three. We prove
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. This paper proves a preliminary step towards a splitter theorem for internally
More informationHamilton Circuits and Dominating Circuits in Regular Matroids
Hamilton Circuits and Dominating Circuits in Regular Matroids S. McGuinness Thompson Rivers University June 1, 2012 S. McGuinness (TRU) Hamilton Circuits and Dominating Circuits in Regular Matroids June
More informationModularity and Structure in Matroids
Modularity and Structure in Matroids by Rohan Kapadia A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Doctor of Philosophy in Combinatorics and
More informationPROJECTIVE GEOMETRIES IN EXPONENTIALLY DENSE MATROIDS. II
PROJECTIVE GEOMETRIES IN EXPONENTIALLY DENSE MATROIDS. II PETER NELSON Abstract. We show for each positive integer a that, if M is a minor-closed class of matroids not containing all rank-(a + 1) uniform
More informationMATROIDS DENSER THAN A PROJECTIVE GEOMETRY
MATROIDS DENSER THAN A PROJECTIVE GEOMETRY PETER NELSON Abstract. The growth-rate function for a minor-closed class M of matroids is the function h where, for each non-negative integer r, h(r) is the maximum
More informationTUTTE POLYNOMIALS OF GENERALIZED PARALLEL CONNECTIONS
TUTTE POLYNOMIALS OF GENERALIZED PARALLEL CONNECTIONS JOSEPH E. BONIN AND ANNA DE MIER ABSTRACT. We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel connections
More informationON THE HIGHLY CONNECTED DYADIC, NEAR-REGULAR, AND SIXTH-ROOT-OF-UNITY MATROIDS
ON THE HIGHLY CONNECTED DYADIC, NEAR-REGULAR, AND SIXTH-ROOT-OF-UNITY MATROIDS BEN CLARK, KEVIN GRACE, JAMES OXLEY, AND STEFAN H.M. VAN ZWAM arxiv:1903.04910v1 [math.co] 9 Mar 2019 Abstract. Subject to
More informationRota s Conjecture. Jim Geelen, Bert Gerards, and Geoff Whittle
Rota s Conjecture Jim Geelen, Bert Gerards, and Geoff Whittle Rota s Conjecture For each finite field field F, there are at most a finite number of excluded minors for F-representability. Ingredients of
More informationCyclic Flats, Sticky Matroids, and Intertwines
Cyclic Flats, Sticky Matroids, and Intertwines Joseph E. Bonin The George Washington University Part I Essential Matroid Background and Cyclic Flats Matroids via Flats There are many equivalent formulations
More informationRemoving circuits in 3-connected binary matroids
Discrete Mathematics 309 (2009) 655 665 www.elsevier.com/locate/disc Removing circuits in 3-connected binary matroids Raul Cordovil a, Bráulio Maia Junior b, Manoel Lemos c, a Departamento de Matemática,
More informationMatroids/1. I and I 2 ,I 2 > I 1
Matroids 1 Definition A matroid is an abstraction of the notion of linear independence in a vector space. See Oxley [6], Welsh [7] for further information about matroids. A matroid is a pair (E,I ), where
More informationPublications of James G. Oxley. Books and edited books
Books and edited books Publications of James G. Oxley 1. Matroid Theory, Oxford University Press, New York, 1992 (532 pages). 2. Matroid Theory (edited with J.E. Bonin and B. Servatius), Proc. AMS- IMS-SIAM
More informationWhat Do Lattice Paths Have To Do With Matrices, And What Is Beyond Both?
What Do Lattice Paths Have To Do With Matrices, And What Is Beyond Both? Joseph E. Bonin The George Washington University These slides are available at blogs.gwu.edu/jbonin Some ideas in this talk were
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationMATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT
MATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT MANOEL LEMOS AND JAMES OXLEY Abstract. In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum
More informationPage Line Change 80-5 Replace by Adjoin or delete a zero row Omit non-zero before column Replace the sentence beginning Clearly
MATROID THEORY James G. Oxley Oxford University Press, New York, 1992 Errata and Update on Conjectures, Problems, and References Latest update: December 10, 2005 The comments below apply to all printings
More informationTHE CRITICAL NUMBER OF DENSE TRIANGLE-FREE BINARY MATROIDS
THE CRITICAL NUMBER OF DENSE TRIANGLE-FREE BINARY MATROIDS JIM GEELEN AND PETER NELSON Abstract. We show that, for each real number ε > 0 there is an integer c such that, if M is a simple triangle-free
More informationON SIZE, CIRCUMFERENCE AND CIRCUIT REMOVAL IN 3 CONNECTED MATROIDS
ON SIZE, CIRCUMFERENCE AND CIRCUIT REMOVAL IN 3 CONNECTED MATROIDS MANOEL LEMOS AND JAMES OXLEY Abstract. This paper proves several extremal results for 3-connected matroids. In particular, it is shown
More informationIndependence numbers of locally sparse graphs and a Ramsey type problem
Independence numbers of locally sparse graphs and a Ramsey type problem Noga Alon Abstract Let G = (V, E) be a graph on n vertices with average degree t 1 in which for every vertex v V the induced subgraph
More informationAlgorithms for Computing Network Coding Rate Regions via Single Element Extensions of Matroids
Algorithms for Computing Network Coding Rate Regions via Single Element Extensions of Matroids Jayant Apte, Congduan Li, John MacLaren Walsh Drexel University, Dept. of ECE, Philadelphia, PA 19104, USA
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationCounting bases of representable matroids
Counting bases of representable matroids Michael Snook School of Mathematics, Statistics and Operations Research Victoria University of Wellington Wellington, New Zealand michael.snook@msor.vuw.ac.nz Submitted:
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS II
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS II CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. Let M and N be internally 4-connected binary matroids such that M has a proper
More informationCHARACTERISTIC POLYNOMIALS WITH INTEGER ROOTS
CHARACTERISTIC POLYNOMIALS WITH INTEGER ROOTS Gordon Royle School of Mathematics & Statistics University of Western Australia Bert s Matroid Jamboree Maastricht 2012 AUSTRALIA PERTH WHERE EVERY PROSPECT
More informationA survey of Tutte-Whitney polynomials
A survey of Tutte-Whitney polynomials Graham Farr Faculty of IT Monash University Graham.Farr@infotech.monash.edu.au July 2007 Counting colourings proper colourings Counting colourings proper colourings
More informationUNAVOIDABLE CONNECTED MATROIDS RETAINING A SPECIFIED MINOR
UNAVOIDABLE CONNECTED MATROIDS RETAINING A SPECIFIED MINOR CAROLYN CHUN, GUOLI DING, DILLON MAYHEW, AND JAMES OXLEY Abstract. A sufficiently large connected matroid M contains a big circuit or a big cocircuit.
More informationOn Rota s conjecture and excluded minors containing large projective geometries
Journal of Combinatorial Theory, Series B 96 (2006) 405 425 www.elsevier.com/locate/jctb On Rota s conjecture and excluded minors containing large projective geometries Jim Geelen a, Bert Gerards b,c,
More informationA Dual Fano, and Dual Non-Fano Matroidal Network
California State University, San Bernardino CSUSB ScholarWorks Electronic Theses, Projects, and Dissertations Office of Graduate Studies 6-2016 A Dual Fano, and Dual Non-Fano Matroidal Network Stephen
More informationTHE STRUCTURE OF 3-CONNECTED MATROIDS OF PATH WIDTH THREE
THE STRUCTURE OF 3-CONNECTED MATROIDS OF PATH WIDTH THREE RHIANNON HALL, JAMES OXLEY, AND CHARLES SEMPLE Abstract. A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a
More informationRegular matroids without disjoint circuits
Regular matroids without disjoint circuits Suohai Fan, Hong-Jian Lai, Yehong Shao, Hehui Wu and Ju Zhou June 29, 2006 Abstract A cosimple regular matroid M does not have disjoint circuits if and only if
More informationh-vectors OF SMALL MATROID COMPLEXES
h-vectors OF SMALL MATROID COMPLEXES JESÚS A. DE LOERA, YVONNE KEMPER, STEVEN KLEE Abstract. Stanley conjectured in 1977 that the h-vector of a matroid simplicial complex is a pure O-sequence. We give
More informationExtremal Matroid Theory and The Erdös-Pósa Theorem
Extremal Matroid Theory and The Erdös-Pósa Theorem Kasper Kabell Department of Mathematical Sciences University of Aarhus, Denmark PhD Thesis January 2006 This thesis is submitted to the Faculty of Science
More informationNegative Correlation Properties for Matroids
Negative Correlation Properties for Matroids by Alejandro Erickson A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Combinatorics
More informationRayleigh Property of Lattice Path Matroids
Rayleigh Property of Lattice Path Matroids by Yan Xu A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of Mathemeatics in Combinatorics and
More informationAN ALGORITHM FOR CONSTRUCTING A k-tree FOR A k-connected MATROID
AN ALGORITHM FOR CONSTRUCTING A k-tree FOR A k-connected MATROID NICK BRETTELL AND CHARLES SEMPLE Dedicated to James Oxley on the occasion of his 60th birthday Abstract. For a k-connected matroid M, Clark
More informationTUTTE POLYNOMIALS OF q-cones
TUTTE POLYNOMIALS OF q-cones JOSEPH E. BONIN AND HONGXUN QIN ABSTRACT. We derive a formula for the Tutte polynomial t(g ; x, y) of a q-cone G of a GF (q)-representable geometry G in terms of t(g; x, y).
More informationA CHAIN THEOREM FOR MATROIDS
A CHAIN THEOREM FOR MATROIDS JAMES OXLEY, CHARLES SEMPLE, AND GEOFF WHITTLE Abstract. Tutte s Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a wheel or a whirl, then M has
More informationTemplates for Representable Matroids
Louisiana State University LSU Digital Commons LSU Doctoral Dissertations Graduate School 6-12-2018 Templates for Representable Matroids Kevin Manuel Grace Louisiana State University and Agricultural and
More informationA Decomposition Theorem for Binary Matroids with no Prism Minor
DOI 10.1007/s00373-013-1352-6 ORIGINAL PAPER A Decomposition Theorem for Binary Matroids with no Prism Minor S. R. Kingan Manoel Lemos Received: 21 March 2012 / Revised: 13 January 2013 Springer Japan
More informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
More informationIf the [T, Id] automorphism is Bernoulli then the [T, Id] endomorphism is standard
If the [T, Id] automorphism is Bernoulli then the [T, Id] endomorphism is standard Christopher Hoffman Daniel Rudolph September 27, 2002 Abstract For any - measure preserving map T of a probability space
More informationHypergraph Turán Problems (IPAM Tutorial)
(IPAM Tutorial) Peter Keevash School of Mathematical Sciences, Queen Mary, University of London. p.keevash@qmul.ac.uk Introduction: From graphs to hypergraphs Mantel s Theorem (1907) The largest graph
More informationFinite connectivity in infinite matroids
Finite connectivity in infinite matroids Henning Bruhn Paul Wollan Abstract We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid,
More informationTHE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS
THE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS JOSEPH E. BONIN AND JOSEPH P. S. KUNG ABSTRACT. We show that when n is greater than 3, the number of points in a combinatorial
More informationTHE MINIMALLY NON-IDEAL BINARY CLUTTERS WITH A TRIANGLE 1. INTRODUCTION
THE MINIMALLY NON-IDEAL BINARY CLUTTERS WITH A TRIANGLE AHMAD ABDI AND BERTRAND GUENIN ABSTRACT. It is proved that the lines of the Fano plane and the odd circuits of K 5 constitute the only minimally
More informationOn the interplay between graphs and matroids
On the interplay between graphs and matroids James Oxley Abstract If a theorem about graphs can be expressed in terms of edges and circuits only it probably exemplifies a more general theorem about matroids.
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler Michael Wilhelmi: Sticky matroids and Kantor s Conjecture Technical Report feu-dmo044.17 Contact: {Winfried.Hochstaettler, Michael.Wilhelmi}@fernuni-hagen.de
More informationPERFECT BINARY MATROIDS
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT PERFECT BINARY MATROIDS Allan Mills August 1999 No. 1999-8 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookeville, TN 38505 PERFECT BINARY MATROIDS ALLAN D. MILLS Abstract.
More informationRamsey theory. Andrés Eduardo Caicedo. Graduate Student Seminar, October 19, Department of Mathematics Boise State University
Andrés Eduardo Department of Mathematics Boise State University Graduate Student Seminar, October 19, 2011 Thanks to the NSF for partial support through grant DMS-0801189. My work is mostly in set theory,
More informationComputability of 0-1 Laws
Computability of 0-1 Laws Nate Ackerman University of California, Berkeley Stanford Logic Seminar December 7, 2010 0-1 Law For First Order Logic Lets begin by reviewing what the 0-1 law for first order
More informationNetworks and Matroids
Adaptive Signal Processing and Information Theory Research Group ECE Department, Drexel University June 1, 2012 Outline 1 Mappings and Definitions Source Mapping: S : V 2 µ, µ is message set. Message Assignment:
More informationHAMMING DISTANCE FROM IRREDUCIBLE POLYNOMIALS OVER F Introduction and Motivation
HAMMING DISTANCE FROM IRREDUCIBLE POLYNOMIALS OVER F 2 GILBERT LEE, FRANK RUSKEY, AND AARON WILLIAMS Abstract. We study the Hamming distance from polynomials to classes of polynomials that share certain
More informationSpanning cycles in regular matroids without M (K 5 ) minors
Spanning cycles in regular matroids without M (K 5 ) minors Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao Abstract Catlin and Jaeger proved that the cycle matroid of a 4-edge-connected graph has a spanning
More informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 12, 2017 Outline Mathematical Induction Simple POMI Examples
More informationThe Catalan matroid.
The Catalan matroid. arxiv:math.co/0209354v1 25 Sep 2002 Federico Ardila fardila@math.mit.edu September 4, 2002 Abstract We show how the set of Dyck paths of length 2n naturally gives rise to a matroid,
More informationJAMES OXLEY, CHARLES SEMPLE, AND GEOFF WHITTLE
WILD TRIANGLES IN 3-CONNECTED MATROIDS JAMES OXLEY, CHARLES SEMPLE, AND GEOFF WHITTLE Abstract. Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative
More informationTHE MAXIMUM SIZE OF COMBINATORIAL GEOMETRIES EXCLUDING WHEELS AND WHIRLS AS MINORS DISSERTATION. Presented to the Graduate Council of the
ziq /VQfd THE MAXIMUM SIZE OF COMBINATORIAL GEOMETRIES EXCLUDING WHEELS AND WHIRLS AS MINORS DISSERTATION Presented to the Graduate Council of the University of North Texas in Partial Fulfillment of the
More informationOn the Length of a Partial Independent Transversal in a Matroidal Latin Square
On the Length of a Partial Independent Transversal in a Matroidal Latin Square Daniel Kotlar Department of Computer Science Tel-Hai College Upper Galilee 12210, Israel dannykot@telhai.ac.il Ran Ziv Department
More informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 2, 207 Outline Mathematical Induction 2 Simple POMI Examples
More informationMatroid intersection, base packing and base covering for infinite matroids
Matroid intersection, base packing and base covering for infinite matroids Nathan Bowler Johannes Carmesin June 25, 2014 Abstract As part of the recent developments in infinite matroid theory, there have
More informationAN INTRODUCTION TO TRANSVERSAL MATROIDS
AN INTRODUCTION TO TRANSVERSAL MATROIDS JOSEPH E BONIN October 26, 2010 CONTENTS 1 Prefatory Remarks 1 2 Several Perspectives on Transversal Matroids 2 21 Set systems, transversals, partial transversals,
More informationDISKRETE MATHEMATIK UND OPTIMIERUNG
DISKRETE MATHEMATIK UND OPTIMIERUNG Immanuel Albrecht and Winfried Hochstättler: Lattice Path Matroids Are 3-Colorable Technical Report feu-dmo039.15 Contact: immanuel.albrechtfernuni-hagen.de, winfried.hochstaettler@fernuni-hagen.de
More informationMatroid Secretary for Regular and Decomposable Matroids
Matroid Secretary for Regular and Decomposable Matroids Michael Dinitz Johns Hopkins University mdinitz@cs.jhu.edu Guy Kortsarz Rutgers University, Camden guyk@camden.rutgers.edu Abstract In the matroid
More informationSpanning trees on the Sierpinski gasket
Spanning trees on the Sierpinski gasket Shu-Chiuan Chang (1997-2002) Department of Physics National Cheng Kung University Tainan 70101, Taiwan and Physics Division National Center for Theoretical Science
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationA loosely Bernoulli counterexample machine
A loosely Bernoulli counterexample machine Christopher Hoffman September 7, 00 Abstract In Rudolph s paper on minimal self joinings [7] he proves that a rank one mixing transformation constructed by Ornstein
More informationSubmodular Functions, Optimization, and Applications to Machine Learning
Submodular Functions, Optimization, and Applications to Machine Learning Spring Quarter, Lecture http://www.ee.washington.edu/people/faculty/bilmes/classes/eeb_spring_0/ Prof. Jeff Bilmes University of
More informationThe Tutte polynomial of some matroids
The Tutte polynomial of some matroids arxiv:203.0090v [math.co] Mar 22 Criel Merino, Marcelino Ramírez-Ibañez Guadalupe Rodríguez-Sánchez March 2, 22 Abstract The Tutte polynomial of a graph or a matroid,
More informationAn Introduction of Tutte Polynomial
An Introduction of Tutte Polynomial Bo Lin December 12, 2013 Abstract Tutte polynomial, defined for matroids and graphs, has the important property that any multiplicative graph invariant with a deletion
More informationOn zeros of the characteristic polynomial of matroids of bounded tree-width
On zeros of the characteristic polynomial of matroids of bounded tree-width By Carolyn Chun, Rhiannon Hall, Criel Merino, Steven Noble Birkbeck Pure Mathematics Preprint Series Preprint Number 26 www.bbk.ac.uk/ems/research/pure/preprints
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationSubmodular Functions, Optimization, and Applications to Machine Learning
Submodular Functions, Optimization, and Applications to Machine Learning Spring Quarter, Lecture http://www.ee.washington.edu/people/faculty/bilmes/classes/ee_spring_0/ Prof. Jeff Bilmes University of
More informationQuasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets Raphael Yuster 1 Department of Mathematics, University of Haifa, Haifa, Israel raphy@math.haifa.ac.il
More informationThe Tutte Polynomial for Matroids of Bounded Branch-Width
Combinatorics, Probability and Computing 9XX 00, 000 000. c 9XX Cambridge University Press DOI: 0.07/S0000000000000000 Printed in the United Kingdom The Tutte Polynomial for Matroids of Bounded Branch-Width
More informationCOUNTING AND ENUMERATING SPANNING TREES IN (di-) GRAPHS
COUNTING AND ENUMERATING SPANNING TREES IN (di-) GRAPHS Xuerong Yong Version of Feb 5, 9 pm, 06: New York Time 1 1 Introduction A directed graph (digraph) D is a pair (V, E): V is the vertex set of D,
More informationAN UPGRADED WHEELS-AND-WHIRLS THEOREM FOR 3-CONNECTED MATROIDS. 1. Introduction
AN UPGRADED WHEELS-AND-WHIRLS THEOREM FOR 3-CONNECTED MATROIDS JAMES OXLEY, CHARLES SEMPLE, AND GEOFF WHITTLE Abstract. Let M be a 3-connected matroid that is not a wheel or a whirl. In this paper, we
More informationProduct of P-polynomial association schemes
Product of P-polynomial association schemes Ziqing Xiang Shanghai Jiao Tong University Nov 19, 2013 1 / 20 P-polynomial association scheme Definition 1 P-polynomial association scheme A = (X, {A i } 0
More informationThe (extended) rank weight enumerator and q-matroids
The (extended) rank weight enumerator and q-matroids Relinde Jurrius Ruud Pellikaan Vrije Universiteit Brussel, Belgium Eindhoven University of Technology, The Netherlands Conference on Random network
More information< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1
List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question
More informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationOn families of anticommuting matrices
On families of anticommuting matrices Pavel Hrubeš December 18, 214 Abstract Let e 1,..., e k be complex n n matrices such that e ie j = e je i whenever i j. We conjecture that rk(e 2 1) + rk(e 2 2) +
More informationHigh dimensional ising model selection using l 1 -regularized logistic regression
High dimensional ising model selection using l 1 -regularized logistic regression 1 Department of Statistics Pennsylvania State University 597 Presentation 2016 1/29 Outline Introduction 1 Introduction
More informationarxiv: v1 [math.co] 3 Aug 2009
GRAPHS WHOSE FLOW POLYNOMIALS HAVE ONLY INTEGRAL ROOTS arxiv:0908.0181v1 [math.co] 3 Aug 009 JOSEPH P.S. KUNG AND GORDON F. ROYLE Abstract. We show if the flow polynomial of a bridgeless graph G has only
More informationInductive bounds, cubes, trees and matroids
Chapter 8 Inductive bounds, cubes, trees and matroids The spectral gap of a MC can sometimes be bounded by a direct inductive argument. Given its conceptual simplicity, this inductive approach seems surprising
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
More informationUpper Bounds for Partitions into k-th Powers Elementary Methods
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 9, 433-438 Upper Bounds for Partitions into -th Powers Elementary Methods Rafael Jaimczu División Matemática, Universidad Nacional de Luján Buenos Aires,
More informationTheorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More information