Cyclic Flats, Sticky Matroids, and Intertwines
|
|
- Neal Carter
- 5 years ago
- Views:
Transcription
1 Cyclic Flats, Sticky Matroids, and Intertwines Joseph E. Bonin The George Washington University
2 Part I Essential Matroid Background and Cyclic Flats
3 Matroids via Flats There are many equivalent formulations of the notion of a matroid. One formulation from flats... A matroid is a pair (S, F) where S is a finite set and F 2 S with 1. S F, 2. if X,Y F, then X Y F, and 3. if X F and y S X, then there is a (unique) Y F with a. X y Y and b. if Z F with X Z Y, then Z = Y. The sets in F are called flats.
4 Matroids via Flats The flats form a geometric (i.e., atomic and semimodular) lattice. {a, b, c, d, e, f} c {a, b, c} {b, d} {c, d, e} {a, e} {a, d, f} {c, f} {b, e, f} b d a f M e {a} {b} {c} {d} {e} {f} The lattice of flats of M 1. S F, 2. if X,Y F, then X Y F, and 3. if X F and y S X, then there is a (unique) Y F with a. X y Y and b. if Z F with X Z Y, then Z = Y.
5 Matroids via Rank A matroid is a pair (S,r) where S is a finite set and r is a function from 2 S to Z with 1. 0 r(x) X for all X S, 2. if X Y S, then r(x) r(y ), and 3. if X,Y S, then r(x) + r(y ) r(x Y ) + r(x Y ). We call r(x) the rank of the set X. The rank r(m) of a matroid M = (S,r) is r(s).
6 Matroids via Rank A matroid is a pair (S,r) where S is a finite set and r is a function from 2 S to Z with 1. 0 r(x) X for all X S, 2. if X Y S, then r(x) r(y ), and 3. if X,Y S, then r(x) + r(y ) r(x Y ) + r(x Y ). We call r(x) the rank of the set X. The rank r(m) of a matroid M = (S,r) is r(s). How (S, F) gives (S,r)... Intersections of flats are flats, so, given (S, F), for any X S there is a least flat cl(x) (the closure of X) with X cl(x); r(x) is the rank of cl(x) in the geometric lattice of flats.
7 Flats to Rank {a, b, c, d, e, f} c {a, b, c} {b, d} {c, d, e} {a, e} {a, d, f} {c, f} {b, e, f} b d a f M e {a} {b} {c} {d} {e} {f} The lattice of flats of M E.g., cl(b,d,f ) = {a,b,c,d,e,f }, so r(b,d,f ) = 3; cl(a,b) = {a,b,c}, so r(a,b) = 2; cl(c,d,e) = {c,d,e}, so r(c,d,e) = 2.
8 Rank to Flats The description of getting ranks from flats shows that flats are the sets for which no proper superset has the same rank, so... Given (S,r), let F consist of the sets X with r(x y) > r(x) for all y S X.
9 Other Fundamental Matroid Concepts Hyperplanes are flats of rank r(m) 1. E.g., {a,b,c}, {c,f }. b c d Each flat is an intersection of hyperplanes. a f e A set X is independent if r(x) = X. E.g.,, {a}, {a,e,f }. Circuits are minimal dependent sets. E.g., {a,b,c}, {a,b,d,e}.
10 Deletion, Contraction, and Minors Consider a matroid M = (S, F) and X S. The deletion M\X, or restriction M (S X), is the matroid (S X, {F X : F F}). c c b d b d c d a f M e f M\a e b f M/a e The contraction M/X is (S X, {F X : F F, X F }). Combining deletion and contraction gives the minors of M.
11 Direct Sums Given M 1 = (S 1, F 1 ) and M 2 = (S 2, F 2 ) with S 1 S 2 =, the direct sum M 1 M 2 is the matroid (S 1 S 2, {F 1 F 2 : F 1 F 1, F 2 F 2 }).. The direct sum of a 3-point line and a 4-point line, which has rank 4.
12 Cyclic Flats A set in M is cyclic if it is a (possibly empty) union of circuits. An element x in a flat F of M is an isthmus of F if F x is a flat. Cyclic flats are the flats that have no isthmuses. Let Z(M) be the set of cyclic flats of M. Ordered by containment, Z(M) is a lattice.. {a, b, c, d, e, f, g, h} c a d b g e h f {a, b, c, d} {e, f, g, h} e a f b g c h d
13 Cyclic Flats and their Ranks A matroid is determined by its cyclic flats and their ranks. (Brylawski, 1975). {a, b, c, d, e, f, g, h} c a d b M g e h f {a, b, c, d} {e, f, g, h} 3 2 e a g f c b N h d
14 Axioms for Matroids via Cyclic Flats Theorem For Z 2 S and r : Z Z, there is a matroid M on S with Z = Z(M) and r = r M Z iff (Z0) Z is a lattice under inclusion, (Z1) r(0 Z ) = 0, where 0 Z is the least element of Z, (Z2) 0 < r(y ) r(x) < Y X for all X,Y Z with X Y, (Z3) for all pairs of incomparable sets X,Y Z, r(x) + r(y ) r(x Y ) + r(x Y ) + (X Y ) (X Y ). (Sims, 1980; Bonin and de Mier, 2008)
15 The Aim of this Talk The point of this talk is to demonstrate how this axiom scheme can be useful in certain matroid construction problems. Illustrations: 1. progress on the sticky matroid conjecture and 2. a construction of infinitely many intertwines for most pairs of matroids. The moral is that cyclic flats let you effectively deal with certain key geometric information.
16 Part II The Sticky Matroid Conjecture
17 Amalgams An amalgam of matroids M 1 on S 1 and M 2 on S 2 is a matroid M on S 1 S 2 with M S 1 = M 1 and M S 2 = M 2. M 1 c b d f a e M 2 c d y x e z b f a c y d x e z b f a c y d x e z b a f c y d x z e rank 4 rank 3 rank 3 A necessary (but not sufficient) condition for having an amalgam: M 1 S 1 S 2 = M 2 S 1 S 2.
18 Amalgams Need Not Exist The matroid M 1 below is the Vámos matroid; each set {x,x,y,y } except {a,a,b,b } is coplanar. a a b b d d d d z d d c c M 1 c c M 2 c c M 1 S 1 S 2 = M 2 S 1 S 2 A pair M 1, M 2 with M 1 S 1 S 2 = M 2 S 1 S 2, yet with no amalgam.
19 Amalgams Need Not Exist d d c c z
20 Amalgams Need Not Exist d d c c z
21 Amalgams Need Not Exist d d c c z
22 Amalgams Need Not Exist d d c c z
23 Amalgams Need Not Exist a a b b d d d d z d d c c M 1 c c M 2 c c M 1 S 1 S 2 = M 2 S 1 S 2 A pair M 1, M 2 with M 1 S 1 S 2 = M 2 S 1 S 2, yet with no amalgam.
24 Amalgams Need Not Exist a a b b d d d d z d d c c M 1 c c M 2 c c M 1 S 1 S 2 = M 2 S 1 S 2 A pair M 1, M 2 with M 1 S 1 S 2 = M 2 S 1 S 2, yet with no amalgam. A matroid N is sticky if, whenever M 1 on S 1 and M 2 on S 2 satisfy M 1 S 1 S 2 = M 2 S 1 S 2 N, then M 1 and M 2 have an amalgam.
25 Modular Matroids A flat X in a matroid M is modular if, for all flats Y of M, r(x) + r(y ) = r(x Y ) + r(x Y ). A matroid is modular if all of its flats are modular d d. c c No lines are modular. All flats are modular. Theorem Modular matroids are precisely the direct sums of projective geometries.
26 The Sticky Matroid Conjecture Theorem Modular matroids are sticky. (Ingleton, 1970s) The Sticky Matroid Conjecture Sticky matroids are modular. (Poljak and Turzík, 1982)
27 More on Modular Flats Theorem Intersections of modular flats are modular. (Brylawski, 1975) Corollary A matroid is modular iff each of its hyperplanes is modular. Theorem A hyperplane is modular iff it intersects each line (rank-2 flat) in at least a point (rank-1 flat).
28 Earlier Progress on the Conjecture The conjecture holds in rank 3. Theorem A rank-3 matroid that has a pair of disjoint lines is not sticky. (Poljak and Turzík, 1982) Theorem Contractions of sticky matroids are sticky. (Bachem and Kern, 1988) Corollary A matroid of rank r 3 is not sticky if it has a pair of hyperplanes whose intersection has rank r 3. Theorem The sticky matroid conjecture is true if and only if it is true for rank-4 matroids. (Bachem and Kern, 1988)
29 Part of the Recent Progress Theorem A rank-4 matroid that has a pair of disjoint planes is not sticky. (Bonin, 2009) The rank-4 case is of most interest, but the counterpart holds for all ranks three or greater.
30 A Proof of the Rank-3 Case A rank-3 matroid N that has disjoint lines L 1,L 2 is not sticky.. L 1 L 2 N N L 1 L 2 M1 a a b b S A B L 1 A L 1 B S L 2 A L 2 B L 1 L 2 } 4 } 3 } 2. N L 1 L 2 Z(N) B = {b, b } A = {a, a } M 2
31 Sketch of the Proof for the Rank-4 Case A rank-4 matroid N that has disjoint planes P 1,P 2 is not sticky. Extend N, on S, to M 1 by adding independent elements p and q only to P 1, P 2, and S.
32 Sketch of the Proof for the Rank-4 Case A rank-4 matroid N that has disjoint planes P 1,P 2 is not sticky. Extend N, on S, to M 1 by adding independent elements p and q only to P 1, P 2, and S. P 1 A P 1 B S A B S P 1 P 2 Z(N). P 2 A P 2 B } } } WLOG, assume P 1 and P 2 are cyclic. Let A and B be disjoint 3-sets, also disjoint from S. Modify Z(N) as shown. Check (Z0) (Z3). This gives M 2.
33 Sketch of the Proof for the Rank-4 Case A rank-4 matroid N that has disjoint planes P 1,P 2 is not sticky. Extend N, on S, to M 1 by adding independent elements p and q only to P 1, P 2, and S. P 1 A P 1 B S A B S P 1 P 2 Z(N). P 2 A P 2 B } } } WLOG, assume P 1 and P 2 are cyclic. Let A and B be disjoint 3-sets, also disjoint from S. Modify Z(N) as shown. Check (Z0) (Z3). This gives M 2. If M were an amalgam of M 1 and M 2, then p,q are in cl M (P 1 A) and cl M (P 2 A) (both of rank 4); this yields p,q cl M (A). Similarly, p,q cl M (B). Semimodularity applied to A {p, q} and B {p, q} gives r(p,q) 1, contrary to {p,q} being independent in M 1.
34 Additional Recent Progress Related ideas can be used to prove a result that gives the following theorem of Bachem and Kern (1988). (Their proof was flawed.) Theorem The sticky matroid conjecture holds for rank-4 matroids that satisfy the bundle condition:. given four lines in rank 4 with no three coplanar, if five of the six pairs of lines are coplanar, then so is the sixth pair....
35 Status of the Conjecture It now suffices to prove the conjecture in rank 4 when (a) each pair of planes intersects in a line and (b) the bundle condition fails. It is conjectured that no rank-4 matroids satisfy (a) and (b).
36 Status of the Conjecture It now suffices to prove the conjecture in rank 4 when (a) each pair of planes intersects in a line and (b) the bundle condition fails. It is conjectured that no rank-4 matroids satisfy (a) and (b). This would follow from the rank-4 case of Kantor s conjecture: for sufficiently large r, if, in a finite rank-r matroid M, each pair of hyperplanes intersects in a flat of rank r 2, then some extension of M is modular. (Having a modular extension implies that the bundle condition holds.)
37 Part III Intertwines
38 Motivation and Definition If classes C and C of matroids are minor-closed, then so is C C. Any excluded minor M for C C has a minor that is an excluded minor for C and another that is an excluded minor for C. Also, no proper minor of M has two such minors.
39 Motivation and Definition If classes C and C of matroids are minor-closed, then so is C C. Any excluded minor M for C C has a minor that is an excluded minor for C and another that is an excluded minor for C. Also, no proper minor of M has two such minors. A matroid M is an intertwine of matroids M 1 and M 2 if M has a minor isomorphic to M 1 and a minor isomorphic to M 2, and no proper minor of M has both M 1 - and M 2 -minors. We may assume the ground sets of M 1 and M 2 are disjoint.
40 Examples An intertwine is a minor-minimal matroid having both M 1- and M 2-minors. Some minors of M 1 M 2 and their (various) parallel connections are intertwines of M 1 and M 2.. M 1.. M 2 The rank-3 intertwines of M 1 and M 2. (Contract the blue point to get M 1.)
41 The Basic Problem of Intertwines Problem Can two matroids have infinitely many intertwines? (Brylawski, 1986; Robertson; Welsh; Oxley, Problem )
42 The Basic Problem of Intertwines Problem Can two matroids have infinitely many intertwines? (Brylawski, 1986; Robertson; Welsh; Oxley, Problem ) Yes. (Vertigan, mid-1990 s, unpublished)
43 The Basic Problem of Intertwines Problem Can two matroids have infinitely many intertwines? (Brylawski, 1986; Robertson; Welsh; Oxley, Problem ) Yes. (Vertigan, mid-1990 s, unpublished) Our goal: construct and explore infinite sets of intertwines.
44 Background Free Extension and Free Coextension Fix a set X that is disjoint from the ground set S of M. The free extension of M by X is the matroid M + X on S X whose cyclic flats and ranks are 1. the proper cyclic flats F of M, with rank r M (F), and 2. S X, of rank r(m). The free coextension of M by X is the matroid M X on S X whose cyclic flats and ranks are 1. the sets F X, of rank r M (F) + X, for F Z(M) with F, and 2. the empty set, of rank 0.
45 Examples of Free Extension and Free Coextension a b c f M 1 d e a a b b M 2 (rank 2) c c a b b a c p M 2 p (rank 3) c p b c d q a q b b c a f M 1 + {p, q} e a p c M 2 {p, q} (rank 4)
46 Free Coextension a b c f M d e {a, b, c} 2 {a, b, c, d, e, f} 3 {c, d, e} 2 0 {a, d, f} 2 Z(M) {b, e, f} 2 {a, b, c, d, e, f} X 3 + X {a, b, c} X {c, d, e} X {a, d, f} X {b, e, f} X 2 + X 2 + X 2 + X 2 + X Z(M X) 0 Free coextension preserves the nullity of corresponding proper, nonempty cyclic flats: η M (F) = F r M (F) = η M X (F X).
47 The Construction of Intertwines We will use cyclic flats to define a particular amalgam of certain free coextensions of M 1 and M 2. Let Z (M) be the set of proper, nonempty cyclic flats of M. Let the ground sets of the matroids M 1 and M 2 be S 1 and S 2, respectively, with S 1 S 2 =.
48 The Construction of Intertwines Let Z = Z ( M 1 (T 1 S 2) ) Z ( M 2 (T 2 S 1) ) {,S 1 S 2 T 1 T 2 } for some S 1 S 1 and S 2 S 2, and where, for some integer k r(m 1 ) + η 1 (S 1 ) + r(m 2) + η 2 (S 2 ), T 1 and T 2 are sets with k = r(m 1 ) + S 2 + T 1 and k = r(m 2 ) + S 1 + T 2 with T 1, T 2, and S 1 S 2 disjoint.
49 The Construction of Intertwines Let Z = Z ( M 1 (T 1 S 2) ) Z ( M 2 (T 2 S 1) ) {,S 1 S 2 T 1 T 2 } for some S 1 S 1 and S 2 S 2, and where, for some integer k r(m 1 ) + η 1 (S 1 ) + r(m 2) + η 2 (S 2 ), T 1 and T 2 are sets with k = r(m 1 ) + S 2 + T 1 and k = r(m 2 ) + S 1 + T 2 with T 1, T 2, and S 1 S 2 disjoint. Define r : Z Z by 1. r( ) = 0, 2. r(s 1 S 2 T 1 T 2 ) = k, 3. r(f T 1 S 2 ) = r 1(F) + T 1 + S 2 for F Z (M 1 ), and 4. r(f T 2 S 1 ) = r 2(F) + T 2 + S 1 for F Z (M 2 ).
50 An Example S 1 u v w M 1 y x S 1 S 2 T 1 T 2 k b c d {x, y, a} T 1 k 1 {a, b, c, u, v, w} T 2 {c, d, e, u, v, w} T 2 k 1 k 1 S 2 a M 2 e 0 T 1 = k 2 1 = k 3, T 2 = k 3 3 = k 6
51 This Defines a Matroid Theorem The pair (Z,r) satisfies axioms (Z0)-(Z3). The resulting rank-k matroid M on S 1 S 2 T 1 T 2 (i) is an amalgam of M 1 (T 1 S 2 ) and M 2 (T 2 S 1 ), and (ii) η 1 (F) = η M (F T 1 S 2 ) for F Z (M 1 ) and η 2 (F) = η M (F T 2 S 1 ) for F Z (M 2 ).
52 The Main Result Theorem Assume neither M 1 nor M 2 arises, up to isomorphism, from the other by any combination of minors, free extension, and free coextension. For i {1,2}, fix S i with FI(M i ) S i S i FI(M i ). If k 4max{ S 1, S 2 }, then the matroid M defined above is an intertwine of M 1 and M 2. FI(M): the set of elements in no proper cyclic flat of M. (free elements and isthmuses) FI(M ): the intersection of all nonempty cyclic flats of M. (cofree elements and loops)
53 A Sketch of the Proof Duality simplifies the proof. Theorem With k = S 1 + S 2 + T 1 + T 2 k, we have ( Mk (M 1,S 1,T 1;M 2,S 2,T 2) ) = Mk (M 1,S 1 S 1,T 2;M 2,S 2 S 2,T 1). It suffices to show that no single-element deletion M\a has both an M 1 - and an M 2 -minor. By symmetry, it suffices to treat a S 1 T 1.
54 A Sketch of the Proof (continued) The inequality on k implies that if M\a\X/Y M i, then either X T 1 η(m 1 ) or Y T 1 r(m 2 ).
55 A Sketch of the Proof (continued) The inequality on k implies that if M\a\X/Y M i, then either X T 1 η(m 1 ) or Y T 1 r(m 2 ). The first implies (1) M\(X T 1 ) = ( M 2 (T 2 S 1 )) + ( (S 1 S 1 ) (T 1 X) ), (2) M\(X T 1 ) has no M 1 -minor, and (3) η 2 (F) = η M\(X T1 )(F T 2 S 1 ) for F Z (M 2 ).
56 A Sketch of the Proof (continued) The inequality on k implies that if M\a\X/Y M i, then either X T 1 η(m 1 ) or Y T 1 r(m 2 ). The first implies (1) M\(X T 1 ) = ( M 2 (T 2 S 1 )) + ( (S 1 S 1 ) (T 1 X) ), (2) M\(X T 1 ) has no M 1 -minor, and (3) η 2 (F) = η M\(X T1 )(F T 2 S 1 ) for F Z (M 2 ). The second implies (1 ) M/(Y T 1 ) = ( M 1 ((T 1 Y ) S 2 )) + ( (S 2 S 2 ) T 2), (2 ) M/(Y T 1 ) has no M 2 -minor, and (3 ) η 1 (F) = η M/(Y T1 )(F (T 1 Y ) S 2 ) for F Z (M 1 ).
57 A Sketch of the Proof (continued) For a (S 1 S 1 ) T 1, assume M\a has a minor M\a\X/Y M 1.
58 A Sketch of the Proof (continued) For a (S 1 S 1 ) T 1, assume M\a has a minor M\a\X/Y M 1. Either (1) M\(X T 1 ) = ( M 2 (T 2 S 1 )) + ( (S 1 S 1 ) (T 1 X) ), (2) M\(X T 1 ) has no M 1 -minor, and X (3) η 2 (F) = η M\(X T1 )(F T 2 S 1 ) for F Z (M 2 ) or (1 ) M/(Y T 1 ) = ( M 1 ((T 1 Y ) S 2 )) + ( (S 2 S 2 ) T 2), (2 ) M/(Y T 1 ) has no M 2 -minor, and (3 ) η 1 (F) = η M/(Y T1 )(F (T 1 Y ) S 2 ) for F Z (M 1 ).
59 A Sketch of the Proof (continued) For a (S 1 S 1 ) T 1, assume M\a has a minor M\a\X/Y M 1. Either (1) M\(X T 1 ) = ( M 2 (T 2 S 1 )) + ( (S 1 S 1 ) (T 1 X) ), (2) M\(X T 1 ) has no M 1 -minor, and X (3) η 2 (F) = η M\(X T1 )(F T 2 S 1 ) for F Z (M 2 ) or (1 ) M/(Y T 1 ) = ( M 1 ((T 1 Y ) S 2 )) + ( (S 2 S 2 ) T 2), (2 ) M/(Y T 1 ) has no M 2 -minor, and (3 ) η 1 (F) = η M/(Y T1 )(F (T 1 Y ) S 2 ) for F Z (M 1 ). By (3 ), since a is in proper cyclic flats, deleting a makes the sum of the nullities of the proper cyclic flats less than that sum in M 1, so M\a\X/Y M 1.
60 A Sketch of the Proof (last step) For a S 1, assume M\a has a minor M\a\X/Y M 2. Either (1) M\(X T 1 ) = ( M 2 (T 2 S 1 )) + ( (S 1 S 1 ) (T 1 X) ), (2) M\(X T 1 ) has no M 1 -minor, and (3) η 2 (F) = η M\(X T1 )(F T 2 S 1 ) for F Z (M 2 ) or (1 ) M/(Y T 1 ) = ( M 1 ((T 1 Y ) S 2 )) + ( (S 2 S 2 ) T 2), (2 ) M/(Y T 1 ) has no M 2 -minor, and X (3 ) η 1 (F) = η M/(Y T1 )(F (T 1 Y ) S 2 ) for F Z (M 1 ). By (3), since a is in proper cyclic flats, deleting a makes the sum of the nullities of the proper cyclic flats less than that sum in M 2, so M\a\X/Y M 2.
61 Knowing More About M 1 and M 2 Lets Us Say More If neither M 1 nor M 2 has circuit-hyperplanes, then we can alter the construction, adding any collection of k-subsets of T 1 T 2 (no two intersecting in k 1 elements) as circuit-hyperplanes; the result is also an intertwine. Thus, in this case, the number of intertwines of M 1 and M 2 grows rapidly (at least exponentially) as a function of the rank.
62 Knowing More About M 1 and M 2 Lets Us Say More If neither M 1 nor M 2 has circuit-hyperplanes, then we can alter the construction, adding any collection of k-subsets of T 1 T 2 (no two intersecting in k 1 elements) as circuit-hyperplanes; the result is also an intertwine. Thus, in this case, the number of intertwines of M 1 and M 2 grows rapidly (at least exponentially) as a function of the rank. Open Problem What can be said about i(k + 1;M 1,M 2 ) i(k;m 1,M 2 ) where i(k;m 1,M 2 ) is the number of rank-k intertwines of M 1 and M 2?
63 Corollaries of the Construction Theorem The matroid M is transversal if and only if M 1 and M 2 are. Corollary If M 1 and M 2 satisfy the conditions in the main theorem and are transversal, then infinitely many of their intertwines are transversal. The same holds for cotransversal matroids, bitransversal matroids, and gammoids. Corollary If M 1 and M 2 satisfy the conditions in the theorem, then, for any integer n, infinitely many of their intertwines 1. are n-connected and 2. have U n,2n -minors.
64 Corollaries of the Construction If S 1 = = S 2, then M = T k( (M 1 T 1 ) (M 2 T 2 ) ) where T k is the k-fold truncation. If S 1 = S 1 and S 2 = S 2, then M = L j( (M 1 + T 1 ) (M 2 + T 2 ) ) where L j is the (k r(m 1 ) r(m 2 ))-fold lift.
65 Corollaries of the Construction If S 1 = = S 2, then M = T k( (M 1 T 1 ) (M 2 T 2 ) ) where T k is the k-fold truncation. If S 1 = S 1 and S 2 = S 2, then M = L j( (M 1 + T 1 ) (M 2 + T 2 ) ) where L j is the (k r(m 1 ) r(m 2 ))-fold lift. Corollary Assume a class C of matroids is closed under direct sums, free extensions, free coextensions, truncations, and lifts. Assume M 1,M 2 C satisfy the hypotheses of the main theorem and either FI(M 1 ) = = FI(M 2 ) or FI(M 1 ) = = FI(M 2 ). Then C contains infinitely many intertwines of M 1 and M 2. This applies to the class of matroids representable over a given infinite field or the class representable over a given characteristic.
66 Open Problems Open Problem Under precisely what conditions do M 1 and M 2 have infinitely many intertwines? Open Problem Can a matroid and a uniform matroid have infinitely many intertwines? (Geelen, Some Open Problems on Excluding a Uniform Matroid) Open Problem What can be said about i(k + 1;M 1,M 2 ) i(k;m 1,M 2 ) where i(k;m 1,M 2 ) is the number of rank-k intertwines of M 1 and M 2?
Diskrete 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 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 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 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 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 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 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 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 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 informationSemimatroids and their Tutte polynomials
Semimatroids and their Tutte polynomials Federico Ardila Abstract We define and study semimatroids, a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We
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 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 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 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 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 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 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 informationHOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID?
HOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID? RAUL CORDOVIL, DAVID FORGE AND SULAMITA KLEIN To the memory of Claude Berge Abstract. Let G be a finite simple graph. From the pioneering work
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 informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler, Robert Nickel: Joins of Oriented Matroids Technical Report feu-dmo009.07 Contact: winfried.hochstaettler@fernuni-hagen.de robert.nickel@fernuni-hagen.de
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 informationGraphs, matroids and the Hrushovski constructions
Graphs, matroids and the Hrushovski constructions David Evans, School of Mathematics, UEA, Norwich, UK Algebra, Combinatorics and Model Theory, Koç University, Istanbul August 2011. ACMT () August 2011
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 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 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 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 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 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 informationLECTURE 3 Matroids and geometric lattices
LECTURE 3 Matroids and geometric lattices 3.1. Matroids A matroid is an abstraction of a set of vectors in a vector space (for us, the normals to the hyperplanes in an arrangement). Many basic facts about
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 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 informationHodge theory for combinatorial geometries
Hodge theory for combinatorial geometries June Huh with Karim Adiprasito and Eric Katz June Huh 1 / 48 Three fundamental ideas: June Huh 2 / 48 Three fundamental ideas: The idea of Bernd Sturmfels that
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 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 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 informationTHE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS
SOOCHOW JOURNAL OF MATHEMATICS Volume 28, No. 4, pp. 347-355, October 2002 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS BY HUA MAO 1,2 AND SANYANG LIU 2 Abstract. This paper first shows how
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 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 informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationCONSTRUCTING A 3-TREE FOR A 3-CONNECTED MATROID. 1. Introduction
CONSTRUCTING A 3-TREE FOR A 3-CONNECTED MATROID JAMES OXLEY AND CHARLES SEMPLE For our friend Geoff Whittle with thanks for many years of enjoyable collaboration Abstract. In an earlier paper with Whittle,
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 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 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 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 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 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 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 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 informationThat is, there is an element
Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is
More informationOn Matroid and Polymatroid Connectivity
Louisiana State University LSU Digital Commons LSU Doctoral Dissertations Graduate School 2014 On Matroid and Polymatroid Connectivity Dennis Wayne Hall II Louisiana State University and Agricultural and
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationRepresenting matroids by polynomials with the half-plane property. Rafael S. González D León Advisor: Petter Brändén
Representing matroids by polynomials with the half-plane property Rafael S. González D León Advisor: Petter Brändén Dept. of Mathematics, Royal Institute of Technology, Sweden E-mail address: rsgd@kth.se
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 informationUnless otherwise specified, V denotes an arbitrary finite-dimensional vector space.
MAT 90 // 0 points Exam Solutions Unless otherwise specified, V denotes an arbitrary finite-dimensional vector space..(0) Prove: a central arrangement A in V is essential if and only if the dual projective
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 informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
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 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 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 informationSELF-DUAL UNIFORM MATROIDS ON INFINITE SETS
SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS NATHAN BOWLER AND STEFAN GESCHKE Abstract. We extend the notion of a uniform matroid to the infinitary case and construct, using weak fragments of Martin s Axiom,
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 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 informationEindhoven 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 informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationTransversal and cotransversal matroids via their representations.
Transversal and cotransversal matroids via their representations. Federico Ardila Submitted: May, 006; Accepted: Feb. 7, 007 Mathematics Subject Classification: 05B5; 05C8; 05A99 Abstract. It is known
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 informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationNon-Recursively Constructible Recursive Families of Graphs
Non-Recursively Constructible Recursive Families of Graphs Colleen Bouey Department of Mathematics Loyola Marymount College Los Angeles, CA 90045, USA cbouey@lion.lmu.edu Aaron Ostrander Dept of Math and
More informationMathematics Review for Business PhD Students
Mathematics Review for Business PhD Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationThe topology of the external activity complex of a matroid
The topology of the external activity complex of a matroid Federico Ardila Federico Castillo José Alejandro Samper Abstract We prove that the external activity complex Act < (M) of a matroid is shellable.
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationMinors and Tutte invariants for alternating dimaps
Minors and Tutte invariants for alternating dimaps Graham Farr Clayton School of IT Monash University Graham.Farr@monash.edu Work done partly at: Isaac Newton Institute for Mathematical Sciences (Combinatorics
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationIsotropic matroids III: Connectivity
Isotropic matroids III: Connectivity Robert Brijder Hasselt University Belgium robert.brijder@uhasselt.be Lorenzo Traldi Lafayette College Easton, Pennsylvania 18042, USA traldil@lafayette.edu arxiv:1602.03899v2
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
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 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 informationChapter One. Affine Coxeter Diagrams
Chapter One Affine Coxeter Diagrams By the results summarized in Chapter VI, Section 43, of [3], affine Coxeter groups can be characterized as groups generated by reflections of an affine space (by which
More informationInfinite Gammoids: Minors and Duality
Infinite Gammoids: Minors and Duality Seyed Hadi Afzali Borujeni a Hiu-Fai Law a,b Malte Müller a,c Submitted: Mar 19, 2015; Accepted: Nov 22, 2015; Published: Dec 11, 2015 Mathematics Subject Classifications:
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationCounting Matroids. Rudi Pendavingh. 6 July, Rudi Pendavingh Counting Matroids 6 July, / 23
Counting Matroids Rudi Pendavingh 6 July, 2015 Rudi Pendavingh Counting Matroids 6 July, 2015 1 / 23 First steps Definitions [n] := {1,..., n} m n := #{M matroid : E(M) = [n]} m n,r := #{M matroid : E(M)
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationPLANES IN 3-MANIFOLDS OF FINITE GENUS AT INFINITY. Bobby Neal Winters. 1. Introduction and Definitions
PLANES IN 3-MANIFOLDS OF FINITE GENUS AT INFINITY Bobby Neal Winters 1. Introduction and Definitions In the study of 3-manifolds, there is a long tradition of cutting up a 3-manifold along embedded 2-manifolds
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 informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
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 informationThe Reduction of Graph Families Closed under Contraction
The Reduction of Graph Families Closed under Contraction Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 November 24, 2004 Abstract Let S be a family of graphs. Suppose
More informationA General Model for Matroids and the Greedy Algorithm
RIMS Preprint No. 1590 A General Model for Matroids and the Greedy Algorithm Ulrich Faigle Mathematisches Institut/ZAIK Universität zu Köln D-50931 Köln, Germany Satoru Fujishige Research Institute for
More informationEQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS
EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) LIOR SILBERMAN Version 1.0 compiled September 9, 2015. 1.1. List of examples. 1. RELATIONS Equality of real numbers: for some x,y R we have x = y. For other pairs
More informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More informationFormal power series rings, inverse limits, and I-adic completions of rings
Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely
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 informationTHE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.
THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT CHRISTOS A. ATHANASIADIS Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229{246] about the \largest" intersection
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More information