*Guest post by Carolyn Chun.*

In a previous post, Dr. Pivotto posted about multimatroids. Her post includes a definition of delta-matroid, and a natural way that delta-matroids arise in the context of multimatroid theory. I recommend her post to readers interested in multimatroids, which generalize delta-matroids. I will discuss delta-matroids in this post, their discovery and natural ways that a mathematician may innocently stumble into their wonderful world.

Delta-matroids were first studied by Andre Bouchet [BG]. I use $X\bigtriangleup Y$ to denote symmetric difference of sets $X$ and $Y$, which is equal to $(X\cup Y)-(X\cap Y)$. To get a delta-matroid, take a finite set $E$ and a collection of subsets $\mathcal{F}$, called feasible sets, satisfying the following.

I) $\mathcal{F}\neq \emptyset$.

II) If $F,F’\in \mathcal{F}$ and $e\in F\bigtriangleup F’$, then there exists $f\in F\bigtriangleup F’$ such that $F\bigtriangleup \{e,f\}$ is in $\mathcal{F}$.

Then $D=(E,\mathcal{F})$ is a delta-matroid.

It is worth noting that the feasible sets of a delta-matroid can have different cardinalities. Taking all of the feasible sets of smallest cardinality gives the bases of a matroid, namely the lower matroid for $D$. Likewise the feasible sets with maximum cardinality give the bases of the upper matroid of $D$. No other collections of feasible sets of a given size are guaranteed to comprise the bases of a matroid.

Taking minors in delta-matroids is modeled well by considering the bases of a matroid minor. Take $e\in E$. As long as $e$ is not in every feasible set (that is, $e$ is not a coloop), the deletion of $e$ from $D$, written $D\backslash e$, is the delta-matroid $(E-e,\{F \mid F\in\mathcal{F}\text{ and }e\notin F\}).$ As long as $e$ is not in no feasible set (that is, $e$ is not a loop), then contracting $e$ from $D$, written $D/e$, is the delta-matroid $(E-e,\{F-e \mid F\in \mathcal{F}\text{ and }e\in F\})$. If $e$ is a loop or coloop, then $D\backslash e=D/e$.

There are several natural ways to get to delta-matroids. They keep showing up, like the page where you die in a choose-your-own-adventure book. *The stairs grow dimmer and dimmer as you walk down the stone staircase into darkness. You hear what may be screams in the distance. You finally reach a closed door and hold your candle up to read the label, scrawled in blood.* The label on the door in this metaphor is “delta-matroids,” and they are not as scary as I portrayed them in that story.

0) Choose your own adventure by preceding to the appropriate section.

1) “I studied embedded graphs and now I see delta-matroids everywhere.”

2) “Partial duality brings me to delta-matroids.”

3) “I left out a basis axiom when defining matroids. Ahoy, delta-matroids!”

4) “Circle graphs seemed like fun. Until they hatched into delta-matroids.”

5) “C’mon, skew symmetric matrices. This can’t end in delta-matroids. Or can it?”

6) “DNA recombination in ciliates is my cup of tea. Who knew I was brewing delta-matroids?”

7) “I abandon this quest and run away.”

1) *“I studied embedded graphs and now I see delta-matroids everywhere.” *

One way to arrive at delta-matroids is by considering cellularly embedded graphs, which I like to think of as ribbon graphs, following [EMM].

To get a cellularly embedded graph, start with a surface (compact, connected 2-manifold), then put vertices (points) and edges (curves between vertices) onto the surface so that no edges cross and each face (unbroken piece of the surface enclosed by edges and vertices) is basically a disk. That is, no face contains a handle or cross-cap.

The particular embedding of a graph encodes more information than the abstract graph, which just encodes adjacencies. There’s an order to the edges incident with a vertex as you circumnavigate the vertex in the embedding, but not in the abstract graph. If you take the matroid of an embedded graph, then you lose the extra information stored in the embedding and you wind up with the matroid of the abstract graph. For example, a pair of loops is indistinguishable from a pair of loops, even though the first pair of loops are embedded in a sphere so that the graph has three faces, and the second pair of loops is embedded in a torus so that the graph has one face. By looking at the matroid of an embedded graph, you can’t even tell if the graph is embedded in an orientable surface or a non-orientable surface. So matroids are the wrong object to model embedded graphs.

Here is a figure by Steven Noble, where $\mathcal{R}$ is the set of ribbon graphs. The correspondence between graphs and matroids is akin to the correspondence between ribbon graphs and question mark. Likewise, graphs are to embedded graphs as matroids are to question mark. Andre Bouchet showed that delta-matroids are the question mark.

To get a ribbon graph, begin with a cellularly embedded graph, cut around the vertices and edges, and throw away the faces. The vertices have become disks, and the edges have become ribbons connecting disks. Each missing face counts as a boundary component in the ribbon graph. We have not lost any of the information from our embedding, since the faces were just disks and can be glued back along the boundary components to return to the original presentation. Spanning forests in a ribbon graph are exactly what you expect, and the edge sets of spanning forests of a ribbon graph give the bases of a matroid. To get a quasi-tree, we are allowed to delete edges (remove ribbons) from our ribbon graph so that we leave behind a ribbon graph with exactly as many boundary components as the original graph had connected components. Note that each spanning forest is a quasi-tree. The edge sets of quasi-trees are the feasible sets of a delta-matroid. The reader may take a break to draw a ribbon graph with quasi-trees of multiple sizes. For more information along these lines, I refer you to [CMNR1] or [CMNR2].

You may be familiar with the mutually enriching relationship between graphs and matroids. There appears to be a similar mutually enriching relationship between ribbon graphs and delta-matroids. Tutte said, “If a theorem about graphs can be expressed in terms of edges and circuits only it probably exemplifies a more general theorem about matroids.” To alter this quote for our purposes, we say, “If a theorem about ribbon graphs can be expressed in terms of edges and quasi-trees only it probably exemplifies a more general theorem about delta-matroids.”

Protip: Not every delta-matroid can be represented by a ribbon graph. Geelen and Oum gave an excluded minor characterization for ribbon-graphic delta-matroids in [GO].

2) *“Partial duality brings me to delta-matroids.”*

A planar graph has a nice, well-defined dual. Not all graphs have well-defined duals. A graph that is not planar that is cellularly embedded in a surface has a well-defined dual, but the dual depends on the surface. The matroid of a graph has a well-defined dual, as do all matroids. Matroids are nice and general in that sense. The notion of partial duality was developed by Chmutov [CG] in the context of embedded graphs, which can be viewed as ribbon graphs, as discussed in ending (1). To get the dual from a ribbon graph, replace the boundary components with vertices, and the vertices with boundary components. Now the ribbons still link up the vertices, but they are short and thick, rather than being long and ribbony. In fact, one way to look at taking a dual is to focus on the ribbon edges, and simply switch the parts of each edge that are incident with vertices with the parts of the edge that are incident with boundary components. Furthermore, there’s nothing particularly special about switching parts of the ribbon edges for the entire ribbon graph, rather than just a subset of the edges. We use $G^A$ to denote the partial dual of a ribbon-graph, $G$, with respect to the edge set $A$.

Here is a drawing of a partial dual for a ribbon graph that Iain Moffatt drew. Actually, it is a slide from a talk by Steven Noble using Iain Moffatt’s figures, with a dash of copyright infringement. Luckily, this is being used for educational purposes and I’m not being paid for this. Unless Spielberg buys the movie rights to this. Then I will cut Noble and Moffatt in on the profits.

Partial duality is also natural enough in matroids, but the partial dual of a matroid is rarely a matroid. Recall that $X\bigtriangleup Y$ denotes symmetric difference of sets $X$ and $Y$, which is equal to $(X\cup Y)-(X\cap Y)$. A matroid $M=(E,\mathcal{B})$ defined in terms of its bases has a dual that may be written $(E,\{E\bigtriangleup B \mid B\in\mathcal{B}\})$. The dual of a matroid is a matroid. Now, for a set $A\subseteq E$, the entity $(E,\{A\bigtriangleup B\mid B\in\mathcal{B}\}):=M*A$ is the partial dual with respect to $A$. There is a way to make sure that the partial dual with respect to $A$ is a matroid. The following result is Theorem 3.10 in [CMNR2].

*Theorem.* *Let $M=(E,\mathcal{B})$ be a matroid and $A$ be a subset of $E$. Then $M*A$ is a matroid if and only if $A$ is separating or $A\in\{\emptyset,E\}$.*

Whenever $A$ is not empty or the ground set of a component of the matroid, then the partial dual with respect to $A$ is *(scrawled in blood)* a delta-matroid! Matroids may be too abstract for most human beings, but they are not quite abstract enough to accommodate partial duality, which is a natural notion generalizing from ribbon graphs. Delta-matroids are the right object, and we tend to view the set of partial duals of a delta-matroid as all belonging to the same equivalence class, just as matroid theorists often view a matroid and its dual as belonging to one equivalence class.

3) *“I left out a basis axiom when defining matroids. Ahoy, delta-matroids!”*

For a set $E$ and a collection $\mathcal{B}$ of subsets of $E$, the set $\mathcal{B}$ form the bases of matroid $(E,\mathcal{B})$ exactly when the following hold.

I) $\mathcal{B}\neq \emptyset$.

II) If $B,B’\in \mathcal{B}$ and $e\in B\bigtriangleup B’$, then there exists $f\in B\bigtriangleup B’$ such that $B\bigtriangleup \{e,f\}$ is in $\mathcal{B}$.

III) The sets in $\mathcal{B}$ are equicardinal.

Omit (III) and hello, sailor! You have the definition of a delta-matroid! Just change the word “bases” to the phrase “feasible sets.”

4) *“Circle graphs seemed like fun. Until they hatched into delta-matroids.”*

You approach the nest full of circle graphs with the stealth and speed of a mongoose, only to discover they are cracking open, each containing an even delta-matroid, where even will be defined in a moment. You should have known that a circle graph is a ribbon-graph in disguise, and a ribbon-graph is, in turn, just a dressed-up delta-matroid. Geelen and Oum used this relationship in [GO] to find an excluded-minor characterization for ribbon-graphic delta-matroids.

A delta-matroid is even exactly when all of its feasible sets have the same parity. They do not all have to have even parity, odd parity is also fine in an even delta-matroid, as long as the parity is exclusive. Maybe a better title would be a monogamous delta-matroid, but maybe not. A circle graph is easy to view as a ribbon-graph. To get a circle graph, you start with a circle, and draw chords (straight lines) across it, and then you check to see which ones cross each other. Your circle graph has a vertex for each chord, and an edge between each pair of vertices corresponding to chords that cross. Go back to the chord diagram and fatten up your chords into ribbons, which cross each other. Where two chords cross, just let one ribbon go over the other, we don’t restrict ourselves to two-dimensions. It doesn’t matter which ribbon is higher than the other, but don’t put any twists into the edges. Now view the circle as a big vertex. Your chord diagram has become a ribbon-graph. It is worth noting that the ribbon-graph corresponds to a graph embedded in an orientable surface.

The edges in your circle graph now correspond to pairs of intertwined loops in your ribbon-graph. By intertwined, I mean that two loops, $a$ and $b$, incident with a single vertex so that, when you circumnavigate the vertex they share, you hit $a$, $b$, $a$, and then $b$; rather than $a$, $a$, $b$, and $b$. Now the feasible sets of your delta-matroid include the empty set (because your vertex has a single boundary component), no single-element sets, and each pair $\{v,w\}$ where $vw$ is an edge in your circle graph. Check this by drawing a big vertex and two interlaced ribbon-graph loops and tracing around the boundary components. You will find there’s only one boundary component. The rest of the feasible sets of the delta-matroid come from the remaining quasi-trees in the ribbon-graph, but you’ll find that, mysteriously, there are no quasi-trees with an odd number of edges. Ribbon-graphs from orientable surfaces give even delta-matroids. Bouchet showed that even ribbon-graph delta-matroids also come naturally from 4-regular directed graphs. For more information along these lines, see Section 4.2 and Section 5.2 of [CMNR1].

Bouchet and Duchamp showed in [BD] that ribbon-graphs correspond to a subset of binary delta-matroids, which will be considered in (5). They did this by giving an excluded minor characterization for binary delta-matroids. In [GO], Geelen and Oum built on the work of Bouchet [BC] in the area of circle graphs and found pivot-minor-minimal non-circle-graphs. As an application of this they obtained the excluded minors for ribbon-graphic delta-matroids.

5) *“C’mon, skew symmetric matrices. This can’t end in delta-matroids. Or can it?”*

A lot of matroid theorists enjoy representable matroids, which have matrix representations. Delta-matroids do not disappoint. Take an $E$x$E$ skew-symmetric matrix over your favorite field. For $A\subseteq E$, consider the $A$x$A$ submatrix obtained by restricting to the rows and columns labeled by elements in $A$. If this submatrix is non-singular, then put $A$ into the collection $\mathcal{F}$. Guess what $(E,\mathcal{F})$ is. A delta-matroid! Every ribbon-graphic delta-matroid has a partial dual that has a binary matrix representation. If you pick a field with characteristic other than two, then your delta-matroids representable over that field will be even. This follows from the nature of skew-symmetric matrices. For more information along these lines, see Section 5.7 in [CMNR1]

6) *“DNA recombination in ciliates is my cup of tea. Who knew I was brewing delta-matroids?”*

The title to this section may sound like a good pick-up line, but I have had no success with it. Ciliates (phylum Ciliophora) are single-celled organisms that experience nuclear dimorphism. Their cells each contain two nuclei, which contain different, but related, genomes. The DNA reconstruction in ciliates has something to do with 4-regular graphs, which can be thought of as medial graphs of ribbon graphs. I’m out of my depth here, so I will refer you to the amazing work of people who know more about this subject. Jonoska and Saito put together a book on biomathematics that is on my reading list. I’ll highlight in particular an article by Brijder and Hoogeboom [BH] in this book for more delta-matroids. While you’re waiting for your local library to order that book, I suggest checking out [AJS] by Angeleska, Jonoska, and Saito.

7) *“I abandon this quest and run away.”*

Very well, you decide to abandon this quest and run away. You drop your axe. You put down your boomerang. You throw away your ninja stars. You retire the commander of your armies, and donate your blowtorches to charity. You turn from the Siren-like call of the delta-matroids, but what is that sound? Is the song growing stronger even as you run away? Yes, delta-matroids seem to be in front of you every direction you face. After a meltdown or two, you pull yourself together and return to (0), resolved to pick a different course of action.

***

[AJS] A. Angeleska, N. Jonoska, and M. Saito. DNA recombination through assembly graphs. *Discrete Applied Mathematics*. **157:14** (2009) 3020–3037.

[BC] A. Bouchet, Circle graph obstructions, *J. Combin. Theory Ser. B.* **60** (1994) 107–144.

[BG] A. Bouchet, Greedy algorithm and symmetric matroids, *Math. Program.* **38** (1987) 147– 159.

[BD] A. Bouchet and A. Duchamp, Representability of delta-matroids over GF(2), *Linear Algebra Appl.* **146** (1991) 67–78.

[BH] R. Brijder and H. Hoogeboom, The algebra of gene assembly in ciliates. In: N. Jonoska and M. Saito (eds.) *Discrete and Topological Models in Molecular Biology.* Natural Computing Series, Springer, Heidelberg (2014) 289—307.

[CG] S. Chmutov, Generalized duality for graphs on surfaces and the signed Bollobás–Riordan polynomial, *J. Combin. Theory Ser. B.* **99** (2009) 617–638.

[CMNR1] C. Chun, I. Moffatt, S. Noble, and R. Rueckriemen, Matroids, delta-matroids, and embedded graphs, arXiv:1403.0920.

[CMNR2] C. Chun, I. Moffatt, S. Noble, and R. Rueckriemen, On the interplay between embedded graphs and delta-matroids, arXiv:1602.01306.

[EMM] J. Ellis-Monaghan and I. Moffatt, *Graphs on surfaces: Dualities, Polynomials, and Knots*, Springer, (2013).

[GO] J. Geelen, S. Oum, Circle graph obstructions under pivoting. *J. Graph Theory.* **61** (2009) 1–11.