# Dendriform structures for restriction-deletion and restriction-contraction matroid Hopf algebras.

1 IntroductionIt is widely acknowledged that major recent progress in combinatorics stems from the construction of algebraic structures associated to combinatorial objects, and from the design of algebraic invariants for those objects. For over three decades, numerous Hopf algebras with distinguished bases indexed by families of permutations, words, posets, graphs, tableaux, or variants thereof, have been brought to light (see, for example, [6] and references within). The study of such combinatorial Hopf algebras (a class of free or cofree, connected, finitely graded bialgebras thoroughly characterized by Loday and Ronco [9]) has grown into an active research area; many connections with other mathematical domains and, perhaps more surprisingly, to theoretical physics (see, for example, [14, 15] and references therein) have been uncovered and tightened.

Since Schmitt's pioneering work [13], matroids have also been the subject of algebraic structural investigations, though to a much lesser extent than other familiar combinatorial species. In the present paper, we aim to carry the study of Hopf algebras on matroids one step forward by providing an alternative coproduct on matroids and by exploring their dendriform structures.

Let us now outline the paper's contents. After a short reminder of the basic theory of matroids and a review of Schmitt's restriction-contraction Hopf algebra (section 2), we define a new coproduct, relying on two standard operations on matroids, namely restriction and deletion, and show that the set of isomorphic classes of matroids can be endowed with a new commutative and cocommutative Hopf algebra structure, different from the one introduced by Schmitt (section 3). We then prove that Schmitt's coproduct as well as ours can be adequately split into two pieces so as to give rise to two dendriform coalgebras (section 4). To the best of our knowledge, it is the first time that such an analysis has been carried out for matroids. Finally, we define a polynomial invariant of matroids which satisfy an identity which is the restriction-deletion analog of the more classical convolution identity satisfied by the Tutte p olynomial for matroids (section 5). Although that polynomial turns out to be a monomial, its definition exemplifies the usefulness of the theory of Hopf algebra characters in our context.

2 Matroid theory; a restriction-contraction CHA

2.1 Matroid theory reminder

In this subsection we recall the definition and some basic properties of matroids (see, for example, J. Oxley's book [11] or review article [12]).

Definition 2.1 A matroid M is a pair (E, I) consisting of a finite set E and a collection of subsets ofE satisfying the following set of axioms: I is non-empty, every subset of every member of I is also in I and, finally, if X and Y are in I and |X| = |Y| + 1, then there is an element x in X - Y such that Y [union] {x} is in I.

One calls the set E the ground set. The elements of the set I are the independent sets of the matroid. A subset of E that is not in I is called dependent.

A particular class of matroids is the graphic matroids (or cyclic matroids), for whom the ground set is the set of edges of the graph and for whom the collection of independent sets is given by the sets of edges which do not contain all the edges of a cycle of the graph.

Let E be an n--element set and let I be the collection of subsets of E with at most r elements, 0 [less than or equal to] r [less than or equal to] n. The pair (E, I) is a matroid - the uniform matroid [U.sub.r,n]. The smallest (with respect to the cardinal of the edge set) non-graphic matroid is [U.sub.2,4].

The bases of a matroid are the maximal independent sets of the respective matroid. Note that bases have all the same cardinality. By relaxing this condition one then has delta-matroids [1].

Let M = (E, I) be a matroid and let B = {B} be the collection of bases of M. Let B* = {E - B: B [member of] B}. Then B* is the collection of bases of a matroid M* on E, the dual of M.

Let M = (E, I) be a matroid. The rank r(A) of A [subset] E is given by the following formula:

r(A)= ma,x{\B\ s.t. B [member of] I, B c A}. (1)

Lemma 2.2 (Lemma 1.3.1 [11]) The rank function r of a matroid M on a set E satisfies the following condition: If X and Y are subsets of E, then

r(X [union] Y)+ r(X [intersection] Y) [less than or equal to] r(X)+ r(Y). (2)

Lemma 2.3 (Proposition 1.3.5 [11]) Let M = (E, I) be a matroid with rank function r and suppose that X [??] E. Then X is independent if and only if |X| = r(X).

Let M = (E, I) be a matroid. The element e [member of] E is a loop if and only if {e} is a minimal dependent set of the matroid. The element e [member of] E is a coloop if and only if, for any basis B, e [member of] B.

Note that loops and coloops correspond, in graph theory, to bridges and self-loops, respectively.

Let M be a matroid (E,I) and T be a subset of E. Let I[|.sub.T] be the set {I [??] T s. t. I [member of] I}. The pair (T, I[|.sub.T]) is a matroid, which is denoted by M[|.sub.T] - the restriction of M to T.

Let I' = {I [??] E - T : I [member of] I}. The pair (E - T, I') is again a matroid. We denote this matroid by M\T; we call this matroid the deletion of T from M.

Lemma 2.4 Let M be a matroid (E, I) and T be a subset of E. One has:

M [|.sub.T] = M[\.sub.E-T]. (3)

2.2 A restriction-contraction matroid Hopf algebra

In this subsection we recall the restriction-contraction matroid Hopf algebra introduced in [13] (see also [2] for details).

Let us first give the following definition:

Definition 2.5 Let Mi = ([E.sub.1], [I.sub.1]) and [M.sub.2] = ([E.sub.2], [I.sub.2]) be two matroids s. t. Ei and E2 are disjoint. Let [mathematical expression not reproducible]. Then [M.sub.1] [direct sum] [M.sub.2] is a matroid - the direct sum of [M.sub.1] and [M.sub.2].

If a matroid N is obtained from a matroid M by any combination of restrictions and contractions or deletions, we call the matroid N a minor of M. We write that a family of matroids is minor-closed if it is closed under formation of minors and direct sums. If M is a minor-closed family of matroids, we denote by M the set of isomorphic classes of matroids belonging to M. Direct sums induce a product on M (see [13] for details). We denote by [mathematical expression not reproducible] the monoid algebra of M over some commutative ring k with unit.

One has

Proposition 2.6 (Proposition 2.1 of [2]) If M is a minor-closed family of matroids then k(M) is a coalgebra, with coproduct [DELTA] and counit e respectively determined by

[mathematical expression not reproducible] (4)

and by [mathematical expression not reproducible] for all M = (E, I) [member of] M. If, furthermore, the family M is closed under formation of direct sums, then [mathematical expression not reproducible] is a Hopf algebra, with product induced by direct sum.

In the rest of the paper, we follow [2] and, by a slight abuse of notation, we denote in the same way a matroid and its isomorphic class, since the distinction will be clear from the context (as it is already in Proposition 2.6). This is the same for the restriction-deletion matroid Hopf algebra that we will introduce in the following section.

The empty matroid (or [U.sub.0,0]) is the unit of this Hopf algebra and is denoted by 1.

Example 2.7 (Example 2.4 of [2]) Let M = [U.sub.k,n] be a uniform matroid with rank k. Its coproduct is given by

[mathematical expression not reproducible]

3 A restriction-deletion matroid Hopf algebra

Let us define the following restriction-deletion map:

[mathematical expression not reproducible] (5)

[mathematical expression not reproducible]

Example 3.1 One has

1) If 2k [less than or equal to] n,

[mathematical expression not reproducible] (6)

2) If n < 2k,

[mathematical expression not reproducible] (7)

One has:

Lemma 3.2 (Proposition 3.1.26 of [11]) Let M = (E, I) be a matroid.

1) Let X' be a subset of X which is a subset of the ground set E. One has

(M | X) | X' = M | X', (8a)

(M | X)\X' = M | (X - X'). (8b)

2) Let X and Y be subsets of E such that X and Y are disjoint, one has

(M\X) | Y = M | Y, (9a)

(M\X)\Y = M\(X [union] Y). (9b)

Proof: These identities follow directly from the definitions of restriction and deletion for matroids (see previous section).

Proposition 3.3 The coproduct in (5) is coassociative.

Proof: Let M = (E, I) be a matroid. Let us calculate the left hand side (LHS) and right hand side (RHS) of the coassociativity identity. One has

[mathematical expression not reproducible] (10)

and

[mathematical expression not reproducible] (11)

Equations (10) and (11) lead to the conclusion.

Let us explicitly check the coassociativity of [[DELTA].sup.(II)] on [U.sub.2,4].

[mathematical expression not reproducible] (12)

Proposition 3.4 The coproduct in (5) is cocommutative.

Proof: Let [tau] be a map [mathematical expression not reproducible] defined by [mathematical expression not reproducible]. Using Lemma 2.4, for [mathematical expression not reproducible], one has

[mathematical expression not reproducible] (13)

Proposition 3.5 k(M) is a cocommutative coalgebra with coproduct [[DELTA].su.(II)] and counit e given by

[mathematical expression not reproducible] (14)

Proof: The proof follows directly from the definition (14).

Lemma 3.6 (Proposition 4.2.23 [11]) Let [M.sub.1] and [M.sub.2] be two matroids. Let [A.sub.1] and [A.sub.2] be subset of [E.sub.1] and [E.sub.2], respectively. One then has

1)

[mathematical expression not reproducible] (15)

2)

[mathematical expression not reproducible] (16)

Proof: One can check these identities directly from the definitions of direct sum, restriction and deletion for matroids (see again the previous section).

Let [mathematical expression not reproducible] denote [mathematical expression not reproducible] where [[tau].sub.23] is the map [mathematical expression not reproducible] defined by [mathematical expression not reproducible].

Proposition 3.7 Let [M.sub.1] and [M.sub.2] be two matroids. One has

(17) [mathematical expression not reproducible]

Proof: Lemma 3.6 leads to:

[mathematical expression not reproducible] (18)

which concludes the proof.

Let us now explicitly check this identity on the matroids [M.sub.1] = ({1,2}, {0, {1}, {2}}) and [M.sub.2] = ({3,4, 5}, {0, {3}, {4}, {5}}) ([U.sub.1,2] and respectively [U.sub.1,3]). One has:

[mathematical expression not reproducible] (19)

which further leads to:

[M.sub.1] [direct sum] [M.sub.2] = ({1, 2, 3,4, 5}, {0, {1}, {2}, {3}, {4}, {5}, {1, 3}, {1, 4}, {1, 5}, {2, 3}, {2, 4}, {2, 5}}).

Thus, one gets

[mathematical expression not reproducible] (20)

Proposition 3.8 The triplet [mathematical expression not reproducible] is a commutative and cocommutative bialgebra.

Proof: The claim follows directly from Proposition 3.7 and the results above.

The main result of this section is:

Theorem 3.9 The triplet [mathematical expression not reproducible] is a commutative and cocommutative Hopf algebra. The antipode S of this Hopf algebra is given by

[mathematical expression not reproducible] (21)

Proof: The bialgebra is graded by the cardinal of the ground set of matroids. Moreover, [mathematical expression not reproducible] is connected, i. e. [mathematical expression not reproducible]. This leads to the conclusion.

Let us end this section with the following example:

Example 3.10 One has:

[mathematical expression not reproducible] (22)

4 Dendriform matroid coalgebras

Let us first recall that a dendriform algebra [8, 9, 10, 5] is a family [mathematical expression not reproducible] such that A is a vector space and [mathematical expression not reproducible] are two products on A, satisfying three axioms. Dually, one has a dendriform coalgebra [mathematical expression not reproducible].

Definition 4.1 (Definition 2 of [5]) A dendriform coalgebra is a family (C, [DELTA]_<, [DELTA]>_) such that:

1. C is a k-vector space and one has:

[mathematical expression not reproducible] (23)

2. For all a [member of] C, one has:

[mathematical expression not reproducible] (24)

[mathematical expression not reproducible] (25)

[mathematical expression not reproducible] (26)

If C is a coalgebra, one defines

[mathematical expression not reproducible] (27)

4.1 The restriction-deletion case

Let us now define two maps on [mathematical expression not reproducible] by:

[mathematical expression not reproducible] (28)

[mathematical expression not reproducible] (29)

If A [??] E, then r(A) [less than or equal to] |A|. This directly leads to:

[mathematical expression not reproducible] (30)

From Lemma 2.3, one can see that the coproduct [DELTA](II) in Equation (5) is split into two parts: [mathematical expression not reproducible] sums on the dependent sets of the matroid and [mathematical expression not reproducible] sums on the independent sets of the matroid.

Let [mathematical expression not reproducible] be the augmentation ideal of [mathematical expression not reproducible]. We can now state the main result of this section:

Proposition 4.2 The triplet [mathematical expression not reproducible] is a dendriform coalgebra.

Proof: Let M be the matroid (E, I). Let us first prove identity (24). Its LHS writes:

[mathematical expression not reproducible] (31)

On the other hand, the RHS of identity (24) can be rewritten as follows:

[mathematical expression not reproducible] (32)

From Lemma 2.2, one has:

r(X [union] Y) [less than or equal to] r(X) + r(Y) < |X| + |Y| = |X [union] Y|. (33)

Setting X = B and X [union] Y = A in equation (32) one now gets that identity (24) holds.

Let us now prove identity (25). Its LHS writes:

[mathematical expression not reproducible] (34)

The RHS of identity (25) writes:

[mathematical expression not reproducible]

[mathematical expression not reproducible] (35)

As above, we can now set X = B and X [union] Y = A in the previous equation. One then concludes that identity (25) also holds.

Finally, identity (26) holds because of the coassociativity of [mathematical expression not reproducible] and since identities (24) and (25) also hold. This concludes the proof.

We end this section by the following remark. The triplet [mathematical expression not reproducible] is not a codendriform bialgebra. Indeed, the necessary compatibilities for the dendriform coalgebra [mathematical expression not reproducible] to be a codendriform bialgebra [5] write:

[mathematical expression not reproducible] (36)

[mathematical expression not reproducible] (37)

where [mathematical expression not reproducible]. In our case, one gets the identity

[mathematical expression not reproducible] (38)

which is different of the identity (36) above.

4.2 The restriction-contraction case

As in the case of the restriction-deletion coproduct analyzed in the previous subsection, one can use the coproduct [[DELTA].sup.(I)] to define a restriction-contraction dendriform coalgebra structure.

One defines two maps on [mathematical expression not reproducible] by:

[mathematical expression not reproducible] (39)

[mathematical expression not reproducible] (40)

One has

[mathematical expression not reproducible] (41)

One has

Proposition 4.3 The triplet [mathematical expression not reproducible] is a dendriform coalgebra.

Proof: The proof of Proposition 4.2 applies for this case as well.

This dendriform coalgebra is not a codendriform bialgebra for the same reasons as in the case of the dendriform restriction-deletion matroid coalgebra of the previous subsection.

5 A matroid polynomial

In this section we use an appropriate character of the restriction-deletion matroid Hopf algebra in order to define a certain matroid polynomial.

Definition 5.1 Let M = (E, I) be a matroid. Let A [??] E. One defines

c(A) := #{e [member of] A | {e} [member of] I}, (42)

l(A) := #{e [member of] A |{e}GI}. (43)

Example 5.2 Let M be a matroid on the ground set {1, 2, 3, 4} and the collection ofindependent sets be given by I = {0, {1}, {2}, {3}}. One has /(E) = 3 and c(E) = 1. Let A = {1,2,4}. One then has /(A) = 2 and c(A) = 1.

Remark 5.3 For graphs, l counts the number of self-loops and c counts the number of edges which are not self-loops.

Note that the matroid of Example 5.2 is a graphic matroid, see Fig. 1. One has, as already noted above l(E) =3 and c(E) = 1.

Remark 5.4 1) If {e} [member of] I, then M | e = [U.sub.1,1].

2) If {e} G I, then M | e = [U.sub.0,1].

Let M = (E, I) be a matroid. Let us define the following polynomial:

[mathematical expression not reproducible] (44)

Remark 5.5 Note that the definition above mimics the definition of the Tutte polynomial, where the role of the rank and of the nullity are played by the parameters c and l, respectively.

Example 5.6 One has:

[mathematical expression not reproducible] (45)

As in [3], we now define:

[mathematical expression not reproducible] (46)

and

[mathematical expression not reproducible] (47)

It is easy to check that these maps are infinitesimal characters of the restriction-deletion matroid Hopf algebra.

Following [3] again, we define the map:

[mathematical expression not reproducible] (48)

Using the definition of a Hopf algebra character one can directly check that the map (48) defined above is a character.

Let us now show the relation between the map [alpha] and the polynomial in (44).

Lemma 5.7 One has

[mathematical expression not reproducible] (49)

Proof: The proof of Lemma 4.1 of [3] for the restriction-contraction matroid Hopf algebra applies for the restriction-deletion matroid Hopf algebra as well (where one takes again into consideration that the role of the rank and of the nullity are played by the parameters c and l).

Proposition 5.8 One has

[mathematical expression not reproducible] (50)

Proof: The proof of Proposition 4.3 of [3] for the restriction-contraction matroid Hopf algebra applies for the restriction-deletion matroid Hopf algebra as well (where one takes again into consideration that the role of the rank and of the nullity are played by the parameters c and l).

One further has:

Corollary 5.9 Let Mi and M2 be two matroids. One has

[mathematical expression not reproducible] (51)

Proof: The conclusion follows directly from the definition of a Hopf algebra character and from Proposition 5.8 above.

One then has:

[mathematical expression not reproducible] (52)

One has:

Corollary 5.10 The polynomial in Equation (44) satisfies

[mathematical expression not reproducible] (53)

Proof: The proof of Corollary 4.5 of [3] applies for the polynomial P.

Remark 5.11 The identity above is the analog of a convolution identity for the Tutte polynomial proved initially in [4] and [7]. The difference comes from replacing the matroid contraction, in the Tutte polynomial case, with the matroid deletion, in the last factor ofthe identity.

Note that [mathematical expression not reproducible] where e is neither a loop nor a coloop.

Let us now give the recursive relations satisfied by the polynomial [P.sub.M](x, y).

Proposition 5.12 One has

[mathematical expression not reproducible] (54)

[mathematical expression not reproducible] (55)

Proof: If e is a loop, then c(E - e) = c(E). One now has

[mathematical expression not reproducible] (56)

Similarly, if e is not a loop, one then has [P.sub.M](x, y) = x[P.sub.M\e](x, y).

Corollary 5.13 One has

[mathematical expression not reproducible] (57)

Finally, one notices that [P.sub.M](x, y) = [P.sub.M*] (x, y), and [P.sub.M](x, y) [not equal to] [P.sub.M*] (y, x). This follows, for example, from analyzing the cases of the matroids [mathematical expression not reproducible] and [mathematical expression not reproducible].

Acknowledgements

The authors kindly acknowledge G. Duchamp and G. Koshevoy for discussions on positroids, discussions which have eventually led to our work on matroids.

References

[1] A. Bouchet, Greedy algorithm and symmetric matroids, Math. Program., 38 (1987) 147-159.

[2] H. Crapo and W. Schmitt, A free subalgebra of the algebra of matroids, Europ. J. Combin., 26 (2005) 1066-1085.

[3] G. Duchamp, N. Hoang-Nghia, T. Krajewski and A. Tanasa, Recipe theorem for the Tutte polynomial for matroids, renormalization group-like approach, Advances in Applied Mathematics, 51 (2013) 345-358.

[4] G. Etienne and M. Las Vergnas, External and internal elements of a matroid basis, Discrete Math., 179 (1998) 111-119.

[5] L. Foissy, Bidendriform bialgebras, trees, and free quasi-symmetric functions, J. Pure Appl. Algebra, 209 (2007) 439-459.

[6] L. Foissy, J.-C. Novelli and J.-Y. Thibon, Polynomial realizations of some combinatorial Hopf algebras, Journal of Noncommutative Geometry, 8(1) (2014) 141-162. DOI: 10.4171/JNCG/151

[7] W. Kook, V. Reiner and D. Stanton, A convolution formula for the Tutte polynomial, J. Combin. Theory Ser. B, 76 (1999) 297-300.

[8] J.-L. Loday, Dialgebras, in Dialgebras and related operads, vol. 1763 of Lecture Notes in Math., pages 7-66, Springer, 2001.

[9] J.-L. Loday and M. Ronco, Combinatorial Hopf Algebras, in Quanta of Maths, vol. 11 of Clay Math. Proc., pages 347-383, Amer. Math. Soc., 2010.

[10] J.-L. Loday and M. Ronco, Hopf algebra of planar binary trees, Adv. Math., 139 (1998) 293-309.

[11] J. Oxley, Matroid theory, Oxford Univ. Press, 1992.

[12] J. Oxley, What is a matroid?, Cubo Mat. Educ., 5 (2003) 179-218.

[13] W. Schmitt, Incidence Hopf algebras, J. Pure Appl. Algebra, 96 (1994) 299-330.

[14] A. Tanasa, Some combinatorial aspects of quantum field theory, Seminaire Lotharingien de Combinatoire, B65g (2012) [arXiv:1102.4231 [math.CO]].

[15] A. Tanasa, Combinatorial Hopf Algebras in (Noncommutative) Quantum Field Theory, Rom. J. Phys., 55 (2010) 1142 [arXiv:1008.1471 [math.CO]].

Nguyen Hoang-Nghia (1) Adrian Tanasa (2 3 4 *) Christophe Tollu (1)

(1) Univ. Paris 13 Sorbonne Paris Cite, France

(2) Univ. Bordeaux, France

(3) NIPNE Magurele, Romania

(4) IUF Paris, France

received 2014-10-13, revised 2016-01-07, accepted 2016-01-07.

(*) A. T. is partially funded by the grants ANR JCJC "CombPhysMat2Tens" and PN 09 37 01 02.

Printer friendly Cite/link Email Feedback | |

Author: | Hoang-Nghia, Nguyen; Tanasa, Adrian; Tollu, Christophe |
---|---|

Publication: | Discrete Mathematics and Theoretical Computer Science |

Article Type: | Report |

Geographic Code: | 4EUFR |

Date: | Nov 1, 2015 |

Words: | 3570 |

Previous Article: | Arithmetic completely regular codes. |

Next Article: | Determining Genus From Sandpile Torsor Algorithms. |

Topics: |