相关论文: Partial-twuality polynomials of delta-matroids

Tetravalent graphs admitting a half-arc-transitive subgroup of automorphisms, that is a subgroup acting transitively on its vertices and its edges but not on its arcs, are investigated. One of the most fruitful approaches for the study of…

The classical Buscher rules describe T-duality for metrics and B-fields in a topologically trivial setting. On the other hand, topological T-duality addresses aspects of non-trivial topology while neglecting metrics and B-fields. In this…

The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ of a ribbon graph $G$ is the generating function that enumerates all partial duals of $G$. In this paper, we give a categorification for this polynomial. The key ingredient of…

Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…

We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We…

We generalize the 1/3-2/3 conjecture from partially ordered sets to antimatroids: we conjecture that any antimatroid has a pair of elements x,y such that x has probability between 1/3 and 2/3 of appearing earlier than y in a uniformly…

We consider a net of *-algebras, locally around any point of observation, equipped with a natural partial order related to the isotony property. Assuming the underlying manifold of the net to be a differentiable, this net shall be…

We explore various aspects of implementing the full M-theory U-duality group E_{d+1}, and thus Lorentz invariance, in the finite N matrix theory (DLCQ of M-theory) on d-tori: (1) We generalize the analysis of U-duality orbits of BPS states…

In recent joint work (2021), we introduced a novel multivariate polynomial attached to every metric space - in particular, to every finite simple connected graph $G$ - and showed it has several attractive properties. First, it is…

Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…

The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…

Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…

This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…

We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…

In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article we show that the conjecture generalized to matroids holds for the large class of all split matroids by…

We show that via the Grassmann-Pl\"ucker relations, the various apparent unrelated concepts, such as duality, matroids, qubits, twistors and surreal numbers are, in fact, deeply connected. Moreover, we conjecture the possibility that these…

We generalize the natural duality of graphs embedded into a surface to a duality with respect to a subset of edges. The dual graph might be embedded into a different surface. We prove a relation between the signed Bollobas-Riordan…

We define a new topological polynomial extending the Bollobas-Riordan one, which obeys a four-term reduction relation of the deletion/contraction type and has a natural behavior under partial duality. This allows to write down a completely…

This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…