Related papers: Graphs, links, and duality on surfaces

A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we…

It has been known since the work of Tutte that the value of the chromatic polynomial of planar triangulations at $(3+\sqrt{5})/2$ has a number of remarkable properties. We investigate to what extent Tutte's relations characterize planar…

We derive an inductive, combinatorial definition of a polynomial-valued regular isotopy invariant of links and tangled graphs. We show that the invariant equals the Reshetikhin-Turaev invariant corresponding to the exceptional simple Lie…

We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…

We introduce a new bivariate polynomial which we call the defensive alliance polynomial and denote it by da(G; x, y). It is a generalization of the alliance polynomial [Carballosa et al., 2014] and the strong alliance polynomial [Carballosa…

For Grassmann varieties, we explain how the duality between the Gelfand-Tsetlin polytopes and the Feigin-Fourier-Littelmann-Vinberg polytopes arises from different positive structures.

We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…

We prove that for any parameter r an r-locally 2-connected graph G embeds r-locally planarly in a surface if and only if a certain matroid associated to the graph G is co-graphic. This extends Whitney's abstract planar duality theorem from…

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

Let $T(G;X,Y)$ be the Tutte polynomial for graphs. We study the sequence $t_{a,b}(n) = T(K_n;a,b)$ where $a,b$ are non-negative integers, and show that for every $\mu \in \N$ the sequence $t_{a,b}(n)$ is ultimately periodic modulo $\mu$…

Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…

Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a…

Some of the most common mathematical models in biology, chemistry, physics, and engineering, are polynomial dynamical systems, i.e., systems of differential equations with polynomial right-hand sides. Inspired by notions and results that…

The Bollob\'as-Riordan polynomial [Math. Ann. 323, 81 (2002)] is a universal polynomial invariant for ribbon graphs. We find an extension of this polynomial for a particular family of combinatorial objects, called rank 3 weakly-colored…

We establish a generalization of Bourgain double recurrence theorem by proving that for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, and for any non-constant polynomials $P, Q$ mapping natural numbers to themselves, for…

We generalize Block-G\"ottsche polynomials, originally defined for toric del Pezzo surfaces, to arbitrary surfaces. To do this, we show that these polynomials arise as special cases of BPS polynomials, defined for any surface $S$ as Laurent…

We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph…

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…

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…