Related papers: Deletion-Contraction and the Surface Tutte Polynom…

The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…

The classical Tutte polynomial is a two-variate polynomial $T_G(x,y)$ associated to graphs or more generally, matroids. In this paper, we introduce a polynomial $\widetilde{T}_H(x,y)$ associated to a bipartite graph $H$ that we call the…

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

Two families of d-orthogonal polynomials related to su(2) are identified and studied. The algebraic setting allows their full characterization (explicit expressions, recurrence relations, difference equations, generating functions, etc.) of…

We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…

We introduce a family of graphs, which we call down-left graphs, and study their combinatorial and algebraic properties. We show that members of this family are well-covered, $C_5$-free, and vertex decomposable. By applying a result of…

Following an idea of Ishida, we develop polynomial equations for certain unramified double covers of surfaces with p_g=q=1 and K^2=2. Our first main result provides an explicit surface surface X with these invariants defined over Q that has…

We extend the construction of the DAHA-Jones polynomials for any reduced root systems and DAHA-superpolynomials in type A from the iterated torus knots (our previous paper) to links, including arbitrary algebraic links. Such a passage…

We describe a family of polynomials discovered via a particular recursion relation, which have connections to Chebyshev polynomials of the first and the second kind, and the polynomial version of Pell's equation. Many of their properties…

Tutte's dichromate T(x,y) is a well known graph invariant. Using the original definition in terms of internal and external activities as our point of departure, we generalize the valuations T(x,1) and T(1,y) to hypergraphs. In the…

The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…

Let S be a connected, compact and orientable surface of genus two having exactly one boundary component. We study automorphisms of the Torelli complex for S, and describe any isomorphism between finite index subgroups of the Torelli group…

We analyse the topological (knot-theoretic) features of a certain codimension-one bifurcation of a partially hyperbolic fixed point in a flow on $\real^3$ originally described by Shil'nikov. By modifying how the invariant manifolds wrap…

We define sets of orthogonal polynomials satisfying the additional constraint of a vanishing average. These are of interest, for example, for the study of the Hohenberg-Kohn functional for electronic or nucleonic densities and for the study…

Given a complex Coble surface $X$ with irreducible boundary $C$, we consider a specific automorphism $T : X \to X$, initially defined by Pompilj. We show that there are two families of Coble surfaces satisfying the condition $T|_C =…

The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be defined on an arbitrary finite graph G, or more generally on an arbitrary matroid M, and encodes much important combinatorial information…

We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…

Area-preserving diffeomorphisms of a 2-disc can be regarded as time-1 maps of (non-autonomous) Hamiltonian flows on solid tori, periodic flow-lines of which define braid (conjugacy) classes, up to full twists. We examine the dynamics…

We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.

Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…