English
Related papers

Related papers: On the Tutte-Krushkal-Renardy polynomial for cell …

200 papers

The generalized degree polynomial $\mathbf{G}_T(x,y,z)$ of a tree $T$ is an invariant introduced by Crew that enumerates subsets of vertices by size and number of internal and boundary edges. Aliste-Prieto et al. proved that $\mathbf{G}_T$…

Combinatorics · Mathematics 2026-01-15 Ricky Ini Liu , Michael Tang

Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid $M$. Our main result is that these polynomials are determined by Betti numbers associated with graded…

Combinatorics · Mathematics 2015-11-13 Trygve Johnsen , Jan Roksvold , Hugues Verdure

This article introduces a finite piecewise Euclidean cell complex homeomorphic to the space of monic centered complex polynomials of degree $d$ whose critical values lie in a fixed closed rectangular region. We call this the branched…

Geometric Topology · Mathematics 2024-10-07 Michael Dougherty , Jon McCammond

We give a fine-grained classification of evaluating the Tutte polynomial $T(G;x,y)$ on all integer points on graphs with small treewidth and cutwidth. Specifically, we show for any point $(x,y) \in \mathbb{Z}^2$ that either - can be…

Computational Complexity · Computer Science 2023-07-04 Isja Mannens , Jesper Nederlof

Let $T_G(x,y)$ be the Tutte polynomial of a graph $G$. In this paper we show that if $(G_n)_n$ is a sequence of $d$-regular graphs with girth $g(G_n)\to \infty$, then for $x\geq 1$ and $0\leq y\leq 1$ we have $$\lim_{n\to…

Combinatorics · Mathematics 2021-05-17 Ferenc Bencs , Péter Csikvári

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

Combinatorics · Mathematics 2014-05-12 Aaron Dall , Julian Pfeifle

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. The Bollob\'as-Riordan-Tutte polynomial is a three-variable polynomial that extends the Tutte polynomial to oriented ribbon graphs. A quasi-tree of a ribbon…

Combinatorics · Mathematics 2016-08-02 Abhijit Champanerkar , Ilya Kofman , Neal Stoltzfus

The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov…

Geometric Topology · Mathematics 2009-04-22 Abhijit Champanerkar , Ilya Kofman

It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollob\'as and Riordan, we introduce a…

Geometric Topology · Mathematics 2007-05-23 Y. Diao , G. Hetyei , K. Hinson

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

Combinatorics · Mathematics 2017-11-21 Rafael S. González D'León

Multimatroids generalize matroids, delta-matroids, and isotropic systems, and transition polynomials of multimatroids subsume various polynomials for these latter combinatorial structures, such as the interlace polynomial and the…

Combinatorics · Mathematics 2017-08-18 Robert Brijder

This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…

Combinatorics · Mathematics 2026-01-13 Medet Jumadildayev

Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected…

Combinatorics · Mathematics 2011-08-10 Matjaz Konvalinka , Igor Pak

We provide a full classification of all families of matroids that are closed under duality and minors, and for which the Tutte polynomial is a universal valuative invariant. There are four inclusion-wise maximal families, two of which are…

Combinatorics · Mathematics 2025-02-10 Luis Ferroni , Benjamin Schröter

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…

Combinatorics · Mathematics 2021-01-01 Alan D. Sokal

In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic…

Combinatorics · Mathematics 2008-07-03 Dongseok Kim , Hye Kyung Kim , Jaeun Lee

We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…

Combinatorics · Mathematics 2009-09-15 Joseph P. S. Kung

In this study, we present two results that relate Tutte polynomials. First, we provide new and complete polynomial invariants for graphs. We note that the number of variables of our polynomials is one. Second, let L_1 and L_2 be two…

Combinatorics · Mathematics 2020-10-06 Misaki Kume , Tsuyoshi Miezaki , Tadashi Sakuma , Hidehiro Shinohara

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…

Combinatorics · Mathematics 2010-11-02 Clark Butler , Sergei Chmutov

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

Combinatorics · Mathematics 2025-09-23 Alexander Dunaykin , Vyacheslav Zhukov
‹ Prev 1 3 4 5 6 7 10 Next ›