Interlace polynomials for multimatroids and delta-matroids

DOI10.1016/J.EJC.2014.03.005MaRDI QIDQ402472zbMATH OpenOpenAlexFDO

Authors Robert Brijder, Hendrik Jan Hoogeboom

Publication date 28 August 2014

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1010.4678

zbMATH Keywords

tight 3-matroidsvf-safe delta-matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph polynomials (05C31)

Abstract: We provide a unified framework in which the interlace polynomial and several related graph polynomials are defined more generally for multimatroids and delta-matroids. Using combinatorial properties of multimatroids rather than graph-theoretical arguments, we find that various known results about these polynomials, including their recursive relations, are both more efficiently and more generally obtained. In addition, we obtain several interrelationships and results for polynomials on multimatroids and delta-matroids that correspond to new interrelationships and results for the corresponding graphs polynomials. As a tool we prove the equivalence of tight 3-matroids and delta-matroids closed under the operations of twist and loop complementation, called vf-safe delta-matroids. This result is of independent interest and related to the equivalence between tight 2-matroids and even delta-matroids observed by Bouchet.

Recommendations

• Orienting transversals and transition polynomials of multimatroids
• Interlacement and activities in delta-matroids
• Twist polynomials of delta-matroids
• Multimatroids. III: Tightness and fundamental graphs
• On the interplay between embedded graphs and delta-matroids

Cites work

• A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
• A bracket polynomial for graphs. I
• A generalization of Tutte's characterization of totally unimodular matrices
• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• A Tutte Polynomial for Coloured Graphs
• A two-variable interlace polynomial
• Bicycle dimension and special points of the Tutte polynomial
• Coverings and delta-coverings
• Graph polynomials and their applications. I: The Tutte polynomial
• Graph polynomials and their applications. II: Interrelations and interpretations
• Graph polynomials derived from Tutte-Martin polynomials
• scientific article; zbMATH DE number 3156382 (Why is no real title available?)
• scientific article; zbMATH DE number 4214039 (Why is no real title available?)
• scientific article; zbMATH DE number 4162893 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 1445310 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• Interlace polynomials
• Multimatroids I. Coverings by Independent Sets
• Multimatroids. II: Orthogonality, minors and connectivity
• Multimatroids. III: Tightness and fundamental graphs
• Nullity and loop complementation for delta-matroids
• Nullity invariance for pivot and the interlace polynomial
• On the Principal Edge Tripartition of a Graph
• Parametrized Tutte Polynomials of Graphs and Matroids
• Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
• Strong Tutte Functions of Matroids and Graphs
• The excluded minors for GF(4)-representable matroids
• The group structure of pivot and loop complementation on graphs and set systems
• The interlace polynomial of a graph
• The interlace polynomial of graphs at \(-1\)
• The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
• The Penrose polynomial of binary matroids
• Tutte-Martin polynomials and orienting vectors of isotropic systems

Cited in

(32)

• How many delta-matroids are there?
• Hopf algebras and Tutte polynomials
• The excluded 3-minors for vf-safe delta-matroids
• A characterization of circle graphs in terms of multimatroid representations
• Matroids, delta-matroids and embedded graphs
• Interlacing networks: birational RSK, the octahedron recurrence, and Schur function identities
• Inductive tools for connected delta-matroids and multimatroids
• Interlacement and activities in delta-matroids
• Twist polynomials of delta-matroids
• scientific article; zbMATH DE number 4200218 (Why is no real title available?)
• The adjacency matroid of a graph
• Binary matroids and local complementation
• The universal valuation of Coxeter matroids
• Transition polynomial as a weight system for binary delta-matroids
• On the interplay between embedded graphs and delta-matroids
• The interlace polynomial and the Tutte–Martin polynomial
• Multimatroids. III: Tightness and fundamental graphs
• Delta-matroids whose twist polynomials are monomials
• Signed permutohedra, delta‐matroids, and beyond
• Multimatroids and rational curves with cyclic action
• K-classes of delta-matroids and equivariant localization
• Orienting transversals and transition polynomials of multimatroids
• A primer on delta-matroids and multimatroids
• (Delta-)matroid polytopes and valuative invariants
• An activities expansion of the transition polynomial of a multimatroid
• The interlace polynomial of binary delta-matroids and link invariants
• Rank functions and invariants of delta-matroids
• Polynomial graph invariants induced from the \(\mathfrak{gl} \)-weight system
• Introducing a vertex polynomial invariant for embedded graphs
• Isotropic matroids. I: Multimatroids and neighborhoods
• Isotropic matroids. II: Circle graphs
• Recombination faults in gene assembly in ciliates modeled using multimatroids

This page was built for publication: Interlace polynomials for multimatroids and delta-matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402472)