Related papers: Partial-twuality polynomials of delta-matroids
We develop an algebraic framework for ribbon graphs, revealing symmetry properties of (partial) twisted duality. The original ribbon group action of Ellis-Monaghan and Moffatt restricts self-duality, -petriality, or -triality to the…
The twist polynomial of a delta-matroid was recently introduced by Yan and Jin, who proved a characterization of binary delta-matroids with twist monomials. In this paper, we extend this result to all delta-matroids by proving that any…
The ribbon group action extends geometric duality and Petrie duality by defining two embedded graphs as twisted duals precisely when they lie within the same orbit under this group action. Twisted duality yields numerous novel properties of…
In this paper, we introduce the partial-dual polynomial for hypermaps, extending the concept from ribbon graphs. We discuss the basic properties of this polynomial and characterize it for hypermaps with exactly one hypervertex containing a…
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…
We consider symmetric partial exclusion and inclusion processes in a general graph in contact with reservoirs, where we allow both for edge disorder and well-chosen site disorder. We extend the classical dualities to this context and then…
Recently, Chmutov proved that the partial-dual polynomial considered as a function on chord diagrams satisfies the four-term relations. In this paper, we show that this function on framed chord diagrams also satisfies the four-term…
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.
Gaussian and Chiral Beta-Ensembles, which generalise well known orthogonal (Beta=1), unitary (Beta=2), and symplectic (Beta=4) ensembles of random Hermitian matrices, are considered. Averages are shown to satisfy duality relations like…
We introduce partial duality of hypermaps, which include the classical Euler-Poincar\'e duality as a particular case. Combinatorially, hypermaps may be described in one of three ways: as three involutions on the set of flags (bi-rotation…
The geometric dual of a cellularly embedded graph is a fundamental concept in graph theory and also appears in many other branches of mathematics. The partial dual is an essential generalization which can be obtained by forming the…
We prove a splitter theorem for tight multimatroids, generalizing the corresponding result for matroids, obtained independently by Brylawski and Seymour. Further corollaries give splitter theorems for delta-matroids and ribbon graphs.
In the present paper, we provide a cohomology group as a categorification of the characteristic polynomial of matroids. The construction depends on the ``quasi-representation'' of a matroid. For a certain choice of the quasi-representation,…
We introduce and investigate multivariate Tutte polynomials, dichromatic polynomials, subset-corank polynomials, size-corank polynomials, and rank generating polynomials of semimatroids, which generalize the corresponding polynomial…
Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…
For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose vertices are labelled by elements of $\Gamma$. We prove that a certain collection of edge sets of a $\Gamma$-labelled graph forms a delta-matroid, which we call a…
In contrast to matroids, vf-safe delta-matroids have three kinds of minors and are closed under the operations of twist and loop complementation. We show that the delta-matroids representable over GF(4) with respect to the nontrivial…
We show that the symmetric difference distance measure for set systems, and more specifically for delta-matroids, corresponds to the notion of nullity for symmetric and skew-symmetric matrices. In particular, as graphs (i.e., symmetric…
One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…
We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial…