Related papers: The Interlace Polynomial
The interior polynomial and the exterior polynomial are generalizations of valuations on $(1/\xi,1)$ and $(1,1/\eta)$ of the Tutte polynomial $T_G(x,y)$ of graphs to hypergraphs, respectively. The pair of hypergraphs induced by a connected…
The Tutte polynomial is an important invariant of graphs and matroids. Chen and Guo \emph{[Adv. in Appl. Math. 166 (2025) 102868.]} proved that for a $(k+1)$-edge connected graph $G$ and for any $i$ with $0\leq i <\frac{3(k+1)}{2}$,…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We establish a relation between the Bollobas-Riordan polynomial of a ribbon graph with the relative Tutte polynomial of a plane graph obtained from the ribbon graph using its projection to the plane in a nontrivial way. Also we give a…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recursively by deleting and contracting edges. We generalize this invariant to any class of combinatorial objects with deletion and contraction…
Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…
The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…
We take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
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…
In this work the interplay between matrix biorthogonal polynomials with respect to a matrix of linear functionals, the $k$-th associated matrix polynomials and the second kind matrix functions, is studied in terms of quasideterminants. A…
In this paper, we find recursive formulas for the Tutte polynomial of a family of small-world networks: Farey graphs, which are modular and have an exponential degree hierarchy. Then, making use of these formulas, we determine the number of…
We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…
We study the spectrum of the join of several circulant matrices. We apply our results to compute explicitly the spectrum of certain graphs obtained by joining several circulant graphs.
The classical relationship between the Tutte polynomial of graph theory and the Potts model of statistical mechanics has resulted in valuable interactions between the disciplines. Unfortunately, it does not include the external magnetic…
It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann {\zeta} function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from…
Delta-matroid theory is often thought of as a generalization of topological graph theory. It is well-known that an orientable embedded graph is bipartite if and only if its Petrie dual is orientable. In this paper, we first introduce the…