Twist monomials of binary delta-matroids
Abstract
Recently, we introduced the twist polynomials of delta-matroids and gave a characterization of even normal binary delta-matroids whose twist polynomials have only one term and posed a problem: what would happen for odd binary delta-matroids? In this paper, we show that a normal binary delta-matroid whose twist polynomials have only one term if and only if each connected component of the intersection graph of the delta-matroid is either a complete graph of odd order or a single vertex with a loop.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.