switching, local complementation and pointed swaps in ...msdiscretemath.org/2019/singh.pdf ·...
TRANSCRIPT
![Page 1: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/1.jpg)
Switching, Local Complementation andPointed Swaps in Binary matroids
Jagdeep Singh∗, James Oxley
Department of MathematicsLouisiana State University
7th Annual Mississippi Discrete Math Workshop , October2019
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 2: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/2.jpg)
Three Graph Operations
Complementation: Complement inside Kn
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 3: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/3.jpg)
Three Graph Operations
Complementation: Complement inside Kn
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 4: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/4.jpg)
Three Graph Operations
Switching: Complement inside a vertex bond of Kn
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 5: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/5.jpg)
Three Graph Operations
Switching: Complement inside a vertex bond of Kn
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 6: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/6.jpg)
Three Graph Operations
Switching: Complement inside a vertex bond of Kn
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 7: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/7.jpg)
Three Graph Operations
Switching: Complement inside a vertex bond of Kn
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 8: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/8.jpg)
Three Graph Operations
Local Complementation: Complement in theneighbourhood of a vertex
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 9: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/9.jpg)
Three Graph Operations
Local Complementation: Complement in theneighbourhood of a vertex
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 10: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/10.jpg)
Three Graph Operations
Local Complementation: Complement in theneighbourhood of a vertex
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 11: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/11.jpg)
Three Graph Operations
Local Complementation: Complement in theneighbourhood of a vertex
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 12: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/12.jpg)
All Graphs Obtainable
Complementation can be obtained via switchings and localcomplementations.
TheoremAll n-vertex graphs can be obtained from Kn via a sequence ofswitchings and local complementations.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 13: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/13.jpg)
All Graphs Obtainable
Complementation can be obtained via switchings and localcomplementations.
TheoremAll n-vertex graphs can be obtained from Kn via a sequence ofswitchings and local complementations.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 14: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/14.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Consider above over GF (2).
{e1,e2,e3} is independent.Matroids from matrices over GF (2) : Binary.
e2 e3
e4
e1
e7
e5e6
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 15: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/15.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Consider above over GF (2).{e1,e2,e3} is independent.
Matroids from matrices over GF (2) : Binary.
e2 e3
e4
e1
e7
e5e6
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 16: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/16.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Consider above over GF (2).{e1,e2,e3} is independent.Matroids from matrices over GF (2) : Binary.
e2 e3
e4
e1
e7
e5e6
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 17: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/17.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Consider above over GF (2).{e1,e2,e3} is independent.Matroids from matrices over GF (2) : Binary.
e2 e3
e4
e1
e7
e5e6
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 18: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/18.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Binary projective geometries Pr : Vector space over GF(2)having all vectors except zero vector.
r (rank) : size of maximal independent set.Above is P3.All rank r binary matroids : Restrictions of Pr .
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 19: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/19.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Binary projective geometries Pr : Vector space over GF(2)having all vectors except zero vector.r (rank) : size of maximal independent set.
Above is P3.All rank r binary matroids : Restrictions of Pr .
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 20: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/20.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Binary projective geometries Pr : Vector space over GF(2)having all vectors except zero vector.r (rank) : size of maximal independent set.Above is P3.
All rank r binary matroids : Restrictions of Pr .
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 21: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/21.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Binary projective geometries Pr : Vector space over GF(2)having all vectors except zero vector.r (rank) : size of maximal independent set.Above is P3.All rank r binary matroids : Restrictions of Pr .
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 22: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/22.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Cocircuit : Minimal set whose removal decrease the rankby 1.
Columns having 1 as their first entry, {e1,e5,e6,e7}.Columns having 1 as their second entry, {e2,e4,e6,e7}.Closure of a set is the span.cl({e1,e2}) = {e1,e2,e6}.cl({e1,e2,e3}) = All points.
Hyperplane : Closed set of rank r − 1.
Also, complements of cocircuits.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 23: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/23.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Cocircuit : Minimal set whose removal decrease the rankby 1.Columns having 1 as their first entry,
{e1,e5,e6,e7}.Columns having 1 as their second entry, {e2,e4,e6,e7}.Closure of a set is the span.cl({e1,e2}) = {e1,e2,e6}.cl({e1,e2,e3}) = All points.
Hyperplane : Closed set of rank r − 1.
Also, complements of cocircuits.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 24: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/24.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Cocircuit : Minimal set whose removal decrease the rankby 1.Columns having 1 as their first entry, {e1,e5,e6,e7}.
Columns having 1 as their second entry, {e2,e4,e6,e7}.Closure of a set is the span.cl({e1,e2}) = {e1,e2,e6}.cl({e1,e2,e3}) = All points.
Hyperplane : Closed set of rank r − 1.
Also, complements of cocircuits.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 25: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/25.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Cocircuit : Minimal set whose removal decrease the rankby 1.Columns having 1 as their first entry, {e1,e5,e6,e7}.Columns having 1 as their second entry, {e2,e4,e6,e7}.
Closure of a set is the span.cl({e1,e2}) = {e1,e2,e6}.cl({e1,e2,e3}) = All points.
Hyperplane : Closed set of rank r − 1.
Also, complements of cocircuits.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 26: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/26.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Cocircuit : Minimal set whose removal decrease the rankby 1.Columns having 1 as their first entry, {e1,e5,e6,e7}.Columns having 1 as their second entry, {e2,e4,e6,e7}.Closure of a set is the span.
cl({e1,e2}) = {e1,e2,e6}.cl({e1,e2,e3}) = All points.
Hyperplane : Closed set of rank r − 1.
Also, complements of cocircuits.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 27: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/27.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Cocircuit : Minimal set whose removal decrease the rankby 1.Columns having 1 as their first entry, {e1,e5,e6,e7}.Columns having 1 as their second entry, {e2,e4,e6,e7}.Closure of a set is the span.cl({e1,e2}) = {e1,e2,e6}.
cl({e1,e2,e3}) = All points.
Hyperplane : Closed set of rank r − 1.
Also, complements of cocircuits.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 28: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/28.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Cocircuit : Minimal set whose removal decrease the rankby 1.Columns having 1 as their first entry, {e1,e5,e6,e7}.Columns having 1 as their second entry, {e2,e4,e6,e7}.Closure of a set is the span.cl({e1,e2}) = {e1,e2,e6}.cl({e1,e2,e3}) = All points.
Hyperplane : Closed set of rank r − 1.
Also, complements of cocircuits.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 29: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/29.jpg)
Matroid prerequisites
e1 e2 e3 e4 e5 e6 e7
1 0 0 0 1 1 10 1 0 1 0 1 10 0 1 1 1 0 1
Cocircuit : Minimal set whose removal decrease the rankby 1.Columns having 1 as their first entry, {e1,e5,e6,e7}.Columns having 1 as their second entry, {e2,e4,e6,e7}.Closure of a set is the span.cl({e1,e2}) = {e1,e2,e6}.cl({e1,e2,e3}) = All points.
Hyperplane : Closed set of rank r − 1.
Also, complements of cocircuits.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 30: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/30.jpg)
Main Idea
Want all binary matroids of rank at most r starting with Pr .Operations:
ComplementationSwitchingLocal complementation
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 31: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/31.jpg)
Binary Matroid Analogues
Complementation (inside fixed projective geometry Pr )
U2,3 ⊕ U1,1complementation inside P3−−−−−−−−−−−−−−−→ U3,3.
ω(U2,3 ⊕ U1,1) = U3,3.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 32: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/32.jpg)
Binary Matroid Analogues
Complementation (inside fixed projective geometry Pr )
U2,3 ⊕ U1,1complementation inside P3−−−−−−−−−−−−−−−→ U3,3.
ω(U2,3 ⊕ U1,1) = U3,3.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 33: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/33.jpg)
Binary Matroid Analogues
Complementation (inside fixed projective geometry Pr )
U2,3 ⊕ U1,1complementation inside P3−−−−−−−−−−−−−−−→ U3,3.
ω(U2,3 ⊕ U1,1) = U3,3.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 34: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/34.jpg)
Binary Matroid Analogues
Complementation (inside fixed projective geometry Pr )
U2,3 ⊕ U1,1complementation inside P3−−−−−−−−−−−−−−−→ U3,3.
ω(U2,3 ⊕ U1,1) = U3,3.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 35: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/35.jpg)
Binary Matroid Analogues
Complementation (inside fixed projective geometry Pr )
U1,1complementation inside P3−−−−−−−−−−−−−−−→ M(K4).
ω(U1,1) = M(K4).
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 36: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/36.jpg)
Binary Matroid Analogues
Complementation (inside fixed projective geometry Pr )
U1,1complementation inside P3−−−−−−−−−−−−−−−→ M(K4).
ω(U1,1) = M(K4).
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 37: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/37.jpg)
Binary Matroid Analogues
Switching: Complement inside a cocircuit of Pr .
P(U2,3,U2,3)switching−−−−−→ U3,3
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 38: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/38.jpg)
Binary Matroid Analogues
Switching: Complement inside a cocircuit of Pr .
P(U2,3,U2,3)switching−−−−−→ U3,3
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 39: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/39.jpg)
Binary Matroid Analogues
Switching: Complement inside a cocircuit of Pr .
P(U2,3,U2,3)switching−−−−−→ U3,3
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 40: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/40.jpg)
Binary Matroid Analogues
Switching: Complement inside a cocircuit of Pr .
P(U2,3,U2,3)switching−−−−−→ U1,1
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 41: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/41.jpg)
Binary Matroid Analogues
Switching: Complement inside a cocircuit of Pr .
P(U2,3,U2,3)switching−−−−−→ U1,1
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 42: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/42.jpg)
Binary Matroid Analogues
Switching: Complement inside a cocircuit of Pr .
P(U2,3,U2,3)switching−−−−−→ U1,1
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 43: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/43.jpg)
Composition of Switchings
σC∗1(M): matroid on E(M)4 C∗1 .
σC∗1σC∗
2(M): matroid on E(M)4 C∗1 4 C∗2 .
σC∗1σC∗
2(M) same as complementing in C∗1 4 C∗2 .
C∗1 4 C∗2 itself a cocircuit.Composition of switchings is a switching.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 44: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/44.jpg)
Composition of Switchings
σC∗1(M): matroid on E(M)4 C∗1 .
σC∗1σC∗
2(M): matroid on E(M)4 C∗1 4 C∗2 .
σC∗1σC∗
2(M) same as complementing in C∗1 4 C∗2 .
C∗1 4 C∗2 itself a cocircuit.Composition of switchings is a switching.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 45: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/45.jpg)
Composition of Switchings
σC∗1(M): matroid on E(M)4 C∗1 .
σC∗1σC∗
2(M): matroid on E(M)4 C∗1 4 C∗2 .
σC∗1σC∗
2(M) same as complementing in C∗1 4 C∗2 .
C∗1 4 C∗2 itself a cocircuit.Composition of switchings is a switching.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 46: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/46.jpg)
Composition of Switchings
σC∗1(M): matroid on E(M)4 C∗1 .
σC∗1σC∗
2(M): matroid on E(M)4 C∗1 4 C∗2 .
σC∗1σC∗
2(M) same as complementing in C∗1 4 C∗2 .
C∗1 4 C∗2 itself a cocircuit.
Composition of switchings is a switching.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 47: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/47.jpg)
Composition of Switchings
σC∗1(M): matroid on E(M)4 C∗1 .
σC∗1σC∗
2(M): matroid on E(M)4 C∗1 4 C∗2 .
σC∗1σC∗
2(M) same as complementing in C∗1 4 C∗2 .
C∗1 4 C∗2 itself a cocircuit.Composition of switchings is a switching.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 48: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/48.jpg)
Observations about switching and complementation
Commute with each other.
Both have order two.Composition of switchings is a switching.
TheoremMatroids obtainable from Pr using switchings andcomplementation are isomorphic to one of Pr , U0,0, Pr−1 andAr .
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 49: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/49.jpg)
Observations about switching and complementation
Commute with each other.Both have order two.
Composition of switchings is a switching.
TheoremMatroids obtainable from Pr using switchings andcomplementation are isomorphic to one of Pr , U0,0, Pr−1 andAr .
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 50: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/50.jpg)
Observations about switching and complementation
Commute with each other.Both have order two.Composition of switchings is a switching.
TheoremMatroids obtainable from Pr using switchings andcomplementation are isomorphic to one of Pr , U0,0, Pr−1 andAr .
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 51: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/51.jpg)
Local Complementation
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 52: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/52.jpg)
Local Complementation
Edges incident with blue vertex v : Complete vertex bondC∗ ∩G.
Yellow edges : clKn(C∗ ∩ G)− C∗.
Binary Matroids : Complement inside clPr(C∗ ∩ E(M))− C∗.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 53: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/53.jpg)
Local Complementation
Edges incident with blue vertex v : Complete vertex bondC∗ ∩G.Yellow edges : clKn(C
∗ ∩ G)− C∗.
Binary Matroids : Complement inside clPr(C∗ ∩ E(M))− C∗.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 54: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/54.jpg)
Local Complementation
Edges incident with blue vertex v : Complete vertex bondC∗ ∩G.Yellow edges : clKn(C
∗ ∩ G)− C∗.Binary Matroids : Complement inside clPr(C
∗ ∩ E(M))− C∗.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 55: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/55.jpg)
Local Complementation
Local Complementation: Complement insideclPr(C
∗ ∩ E(M))− C∗.
P(U2,3,U2,3)L.C.−−→ M(K4)
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 56: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/56.jpg)
Local Complementation
Local Complementation: Complement insideclPr(C
∗ ∩ E(M))− C∗.
P(U2,3,U2,3)L.C.−−→ M(K4)
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 57: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/57.jpg)
Local Complementation
Local Complementation: Complement insideclPr(C
∗ ∩ E(M))− C∗.
P(U2,3,U2,3)L.C.−−→ M(K4)
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 58: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/58.jpg)
Not all Binary Matroids are obtainable
Theorem (Oxley, Singh; 2019)
For r > 4, not all binary matroids of rank at most r can beobtained from Pr using complementation, switching, and localcomplementation.
For r ≤ 4, we can.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 59: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/59.jpg)
Not all Binary Matroids are obtainable
Theorem (Oxley, Singh; 2019)
For r > 4, not all binary matroids of rank at most r can beobtained from Pr using complementation, switching, and localcomplementation.
For r ≤ 4, we can.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 60: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/60.jpg)
Coloring Notation
Element e of Pr colored green : e is in E(M).Colored red : Not in E(M).
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 61: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/61.jpg)
Proof
(Property 1) : For every two distinct projective cocircuitsC∗ and D∗, red and green elements in (C∗ −D∗) both haverank r − 1.
(Property 2): For any projective C∗, both red and greenelements in C∗ have rank r . Implied by Property 1.
LemmaFor r > 4, there exists a 2-coloring X of Pr having Property 1.
Complementation: does not change the properties.Switching: does not change Property 2.Local Complementation :
Complement inside clPr(green elements of C∗)− C∗ , i.e, aprojective hyperplane.Composition of switching and complementation.does not change Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 62: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/62.jpg)
Proof
(Property 1) : For every two distinct projective cocircuitsC∗ and D∗, red and green elements in (C∗ −D∗) both haverank r − 1.
(Property 2): For any projective C∗, both red and greenelements in C∗ have rank r .
Implied by Property 1.
LemmaFor r > 4, there exists a 2-coloring X of Pr having Property 1.
Complementation: does not change the properties.Switching: does not change Property 2.Local Complementation :
Complement inside clPr(green elements of C∗)− C∗ , i.e, aprojective hyperplane.Composition of switching and complementation.does not change Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 63: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/63.jpg)
Proof
(Property 1) : For every two distinct projective cocircuitsC∗ and D∗, red and green elements in (C∗ −D∗) both haverank r − 1.
(Property 2): For any projective C∗, both red and greenelements in C∗ have rank r . Implied by Property 1.
LemmaFor r > 4, there exists a 2-coloring X of Pr having Property 1.
Complementation: does not change the properties.Switching: does not change Property 2.Local Complementation :
Complement inside clPr(green elements of C∗)− C∗ , i.e, aprojective hyperplane.Composition of switching and complementation.does not change Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 64: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/64.jpg)
Proof
(Property 1) : For every two distinct projective cocircuitsC∗ and D∗, red and green elements in (C∗ −D∗) both haverank r − 1.
(Property 2): For any projective C∗, both red and greenelements in C∗ have rank r . Implied by Property 1.
LemmaFor r > 4, there exists a 2-coloring X of Pr having Property 1.
Complementation: does not change the properties.
Switching: does not change Property 2.Local Complementation :
Complement inside clPr(green elements of C∗)− C∗ , i.e, aprojective hyperplane.Composition of switching and complementation.does not change Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 65: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/65.jpg)
Proof
(Property 1) : For every two distinct projective cocircuitsC∗ and D∗, red and green elements in (C∗ −D∗) both haverank r − 1.
(Property 2): For any projective C∗, both red and greenelements in C∗ have rank r . Implied by Property 1.
LemmaFor r > 4, there exists a 2-coloring X of Pr having Property 1.
Complementation: does not change the properties.Switching: does not change Property 2.
Local Complementation :Complement inside clPr(green elements of C∗)− C∗ , i.e, aprojective hyperplane.Composition of switching and complementation.does not change Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 66: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/66.jpg)
Proof
(Property 1) : For every two distinct projective cocircuitsC∗ and D∗, red and green elements in (C∗ −D∗) both haverank r − 1.
(Property 2): For any projective C∗, both red and greenelements in C∗ have rank r . Implied by Property 1.
LemmaFor r > 4, there exists a 2-coloring X of Pr having Property 1.
Complementation: does not change the properties.Switching: does not change Property 2.Local Complementation :
Complement inside clPr(green elements of C∗)− C∗
, i.e, aprojective hyperplane.Composition of switching and complementation.does not change Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 67: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/67.jpg)
Proof
(Property 1) : For every two distinct projective cocircuitsC∗ and D∗, red and green elements in (C∗ −D∗) both haverank r − 1.
(Property 2): For any projective C∗, both red and greenelements in C∗ have rank r . Implied by Property 1.
LemmaFor r > 4, there exists a 2-coloring X of Pr having Property 1.
Complementation: does not change the properties.Switching: does not change Property 2.Local Complementation :
Complement inside clPr(green elements of C∗)− C∗ , i.e, aprojective hyperplane.
Composition of switching and complementation.does not change Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 68: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/68.jpg)
Proof
(Property 1) : For every two distinct projective cocircuitsC∗ and D∗, red and green elements in (C∗ −D∗) both haverank r − 1.
(Property 2): For any projective C∗, both red and greenelements in C∗ have rank r . Implied by Property 1.
LemmaFor r > 4, there exists a 2-coloring X of Pr having Property 1.
Complementation: does not change the properties.Switching: does not change Property 2.Local Complementation :
Complement inside clPr(green elements of C∗)− C∗ , i.e, aprojective hyperplane.Composition of switching and complementation.
does not change Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 69: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/69.jpg)
Proof
(Property 1) : For every two distinct projective cocircuitsC∗ and D∗, red and green elements in (C∗ −D∗) both haverank r − 1.
(Property 2): For any projective C∗, both red and greenelements in C∗ have rank r . Implied by Property 1.
LemmaFor r > 4, there exists a 2-coloring X of Pr having Property 1.
Complementation: does not change the properties.Switching: does not change Property 2.Local Complementation :
Complement inside clPr(green elements of C∗)− C∗ , i.e, aprojective hyperplane.Composition of switching and complementation.does not change Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 70: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/70.jpg)
Proof (continued)
All colorings obtainable from X using given operationssatisfy Property 2.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 71: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/71.jpg)
Pointed Swaps
Off-Element Swaps
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 72: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/72.jpg)
Pointed Swaps
Off-Element Swaps
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 73: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/73.jpg)
Pointed Swaps
Off-Element Swaps
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 74: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/74.jpg)
Pointed Swaps
Off-Element Swaps
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 75: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/75.jpg)
Pointed Swaps
On-Element Swaps
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 76: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/76.jpg)
Pointed Swaps
On-Element Swaps
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 77: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/77.jpg)
Pointed Swaps
On-Element Swaps
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 78: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/78.jpg)
Pointed Swaps
On-Element Swaps
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 79: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/79.jpg)
Pointed Swaps - matrix viewpoint
[v1, . . . , vk , . . . , vr ]ψ−
w−−→ [v1 + w , . . . , vk + w , . . . , vr + w ].
w : red element (Off-swap).
[v1, . . . , vk , . . . , vr ,w ]ψ+
w−−→ [v1 + w , . . . , vk + w , . . . , vr + w ,w ].
w : green element (On-swap).
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 80: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/80.jpg)
Pointed Swaps - matrix viewpoint
[v1, . . . , vk , . . . , vr ]ψ−
w−−→ [v1 + w , . . . , vk + w , . . . , vr + w ].
w : red element (Off-swap).
[v1, . . . , vk , . . . , vr ,w ]ψ+
w−−→ [v1 + w , . . . , vk + w , . . . , vr + w ,w ].
w : green element (On-swap).
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 81: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/81.jpg)
Same element matroids obtainable via pointed swaps
LemmaLet M be a t-element matroid that is a restriction of Pr . Thenevery t-element restriction of Pr can be obtained from M usingpointed swaps.
Proof.
[v1, . . . , vk , . . . , vr ]ψ−
w−−→ [v1 + w , . . . , vk + w , . . . , vr + w ].
[v1 + w , . . . , vr + w ]ψ+
vk+w−−−−→ [v1 + vk , . . . , vk + w , . . . , vr + vk ].
[v1 + vk , . . . , vk + w , . . . , vr + vk ]ψ−
vk−−→ [v1, . . . ,w , . . . , vr ].
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 82: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/82.jpg)
Same element matroids obtainable via pointed swaps
LemmaLet M be a t-element matroid that is a restriction of Pr . Thenevery t-element restriction of Pr can be obtained from M usingpointed swaps.
Proof.
[v1, . . . , vk , . . . , vr ]ψ−
w−−→ [v1 + w , . . . , vk + w , . . . , vr + w ].
[v1 + w , . . . , vr + w ]ψ+
vk+w−−−−→ [v1 + vk , . . . , vk + w , . . . , vr + vk ].
[v1 + vk , . . . , vk + w , . . . , vr + vk ]ψ−
vk−−→ [v1, . . . ,w , . . . , vr ].
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 83: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/83.jpg)
All Matroids Obtainable
Theorem (Oxley, Singh; 2019)
For r > 1, all binary matroids of rank at most r can be obtainedfrom Pr via :
1 Complementations inside projective hyperplanes2 Pointed Swaps
First operation gives both Complementation and Switching.
Proof.
PrHyp.Comp.−−−−−−→ Ar
Ptd .Swaps−−−−−−→ Pr−1 ⊕ U1,1Hyp.Comp.−−−−−−→ U1,1.
Minimal counterexample M has ≥ 2 elements.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 84: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/84.jpg)
All Matroids Obtainable
Theorem (Oxley, Singh; 2019)
For r > 1, all binary matroids of rank at most r can be obtainedfrom Pr via :
1 Complementations inside projective hyperplanes2 Pointed Swaps
First operation gives both Complementation and Switching.
Proof.
PrHyp.Comp.−−−−−−→ Ar
Ptd .Swaps−−−−−−→ Pr−1 ⊕ U1,1Hyp.Comp.−−−−−−→ U1,1.
Minimal counterexample M has ≥ 2 elements.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 85: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/85.jpg)
All Matroids Obtainable
Theorem (Oxley, Singh; 2019)
For r > 1, all binary matroids of rank at most r can be obtainedfrom Pr via :
1 Complementations inside projective hyperplanes2 Pointed Swaps
First operation gives both Complementation and Switching.
Proof.
PrHyp.Comp.−−−−−−→ Ar
Ptd .Swaps−−−−−−→ Pr−1 ⊕ U1,1Hyp.Comp.−−−−−−→ U1,1.
Minimal counterexample M has ≥ 2 elements.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 86: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/86.jpg)
All Matroids Obtainable
Theorem (Oxley, Singh; 2019)
For r > 1, all binary matroids of rank at most r can be obtainedfrom Pr via :
1 Complementations inside projective hyperplanes2 Pointed Swaps
First operation gives both Complementation and Switching.
Proof.
PrHyp.Comp.−−−−−−→ Ar
Ptd .Swaps−−−−−−→ Pr−1 ⊕ U1,1Hyp.Comp.−−−−−−→ U1,1.
Minimal counterexample M has ≥ 2 elements.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 87: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/87.jpg)
Proof (continued)
C∗
x
yz
Ptd .Swap−−−−−−→x
yz
Switch.C∗−−−−−−→
x
yz
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 88: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/88.jpg)
Proof (continued)
C∗
x
yz
Ptd .Swap−−−−−−→x
yz
Switch.C∗−−−−−−→
x
yz
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 89: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/89.jpg)
Proof (continued)
C∗
x
yz
Ptd .Swap−−−−−−→x
yz
Switch.C∗−−−−−−→
x
yz
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 90: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/90.jpg)
Proof (continued)
x
yz
Ptd .Swap−−−−−−→x
yz
Switch.C∗−−−−−−→
x
yz
Decreased the size of M.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 91: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/91.jpg)
Proof (continued)
x
yz
Ptd .Swap−−−−−−→x
yz
Switch.C∗−−−−−−→
x
yz
Decreased the size of M.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 92: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/92.jpg)
Proof (continued)
x
yz
Ptd .Swap−−−−−−→x
yz
Switch.C∗−−−−−−→
x
yz
Decreased the size of M.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 93: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/93.jpg)
Don’t need both on-swaps and off-swaps
On-swaps and off-swaps are complementary.
Complementation inside hyperplanes and on-swaps areenough.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 94: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/94.jpg)
Don’t need both on-swaps and off-swaps
On-swaps and off-swaps are complementary.Complementation inside hyperplanes and on-swaps areenough.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 95: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/95.jpg)
Local Complementation and Pointed Swaps
Theorem (Oxley, Singh; 2019)
All binary matroids of rank at most r with ≥ 2 elements can beobtained from Pr using local complementation and pointedswaps.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 96: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/96.jpg)
Proof (Sketch)
If M has 2 coloops, then we can get M ′ with one moreelement using local complementation.
All matroids with size in [2,2r−2 + 2] are obtainable fromU2,2. Call them M1.
PrL.C.−−→ Ar . B be a basis inside Ar . Pick k− elements each
of Ar − B and Pr − Ar and swap their colors.L.C. w.r.t C∗ = Ar gives a matroid with (2r − 1)− 2kelements. Note k ∈ [0,2r−1 − r ].All matroids of odd size between 2r − 1 and 2r − 1 areobtainable from Pr . Call them M2.M1 intersects M2.All matroids with odd size > 1 are obtainable from Pr .Similar argument for even size.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 97: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/97.jpg)
Proof (Sketch)
If M has 2 coloops, then we can get M ′ with one moreelement using local complementation.All matroids with size in [2,2r−2 + 2] are obtainable fromU2,2. Call them M1.
PrL.C.−−→ Ar . B be a basis inside Ar . Pick k− elements each
of Ar − B and Pr − Ar and swap their colors.L.C. w.r.t C∗ = Ar gives a matroid with (2r − 1)− 2kelements. Note k ∈ [0,2r−1 − r ].All matroids of odd size between 2r − 1 and 2r − 1 areobtainable from Pr . Call them M2.M1 intersects M2.All matroids with odd size > 1 are obtainable from Pr .Similar argument for even size.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 98: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/98.jpg)
Proof (Sketch)
If M has 2 coloops, then we can get M ′ with one moreelement using local complementation.All matroids with size in [2,2r−2 + 2] are obtainable fromU2,2. Call them M1.
PrL.C.−−→ Ar . B be a basis inside Ar . Pick k− elements each
of Ar − B and Pr − Ar and swap their colors.L.C. w.r.t C∗ = Ar gives a matroid with (2r − 1)− 2kelements. Note k ∈ [0,2r−1 − r ].All matroids of odd size between 2r − 1 and 2r − 1 areobtainable from Pr . Call them M2.M1 intersects M2.All matroids with odd size > 1 are obtainable from Pr .Similar argument for even size.
Jagdeep Singh∗, James Oxley Constructing Binary Matroids
![Page 99: Switching, Local Complementation and Pointed Swaps in ...msdiscretemath.org/2019/singh.pdf · Jagdeep Singh , James Oxley Constructing Binary Matroids. All Graphs Obtainable Complementation](https://reader033.vdocument.in/reader033/viewer/2022050201/5f54ac572affe13365122fac/html5/thumbnails/99.jpg)
Thank You for your attention!
Jagdeep Singh∗, James Oxley Constructing Binary Matroids