相关论文: Colorings and flows on CW complexes, Tutte quasi-p…

We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…

The multivariate quantum $q$-Krawtchouk polynomials are shown to arise as matrix elements of "$q$-rotations" acting on the state vectors of many $q$-oscillators. The focus is put on the two-variable case. The algebraic interpretation is…

For a polymatroid $P$ over $[n]$, Bernardi, K\'{a}lm\'{a}n and Postnikov [\emph{Adv. Math.} 402 (2022) 108355] introduced the polymatroid Tutte polynomial $\mathscr{T}_{P}$ relying on the order $1<2<\cdots<n$ of $[n]$, which generalizes the…

In this paper we give a new proof of the universality of the Tutte polynomial for matroids. This proof uses appropriate characters of Hopf algebra of matroids, algebra introduced by Schmitt (1994). We show that these Hopf algebra characters…

Let G be a graph with adjacency matrix A(G). Consider the matrix IA(G)=(I | A(G)), where I is the identity matrix, and let M(IA(G)) be the binary matroid represented by IA(G). Then suitably parametrized versions of the Tutte polynomial of…

We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions $v,w$ -- biaxial double $(\beta,q)$-Grothendieck polynomials -- which specialize at $q=0$ and $v=1$ to double $\beta$-Grothendieck polynomials…

We prove quasi-polynomiality for monotone and strictly monotone orbifold Hurwitz numbers. The second enumerative problem is also known as enumeration of a special kind of Grothendieck's dessins d'enfants or $r$-hypermaps. These statements…

In [Trace identities and $\bf {Z}/2\bf {Z}$-graded invariants, {\it Trans. Amer. Math. Soc. \bf309} (1988), 581--589] we generalized the first and second fundamental theorems of invariant theory from the general linear group to the general…

Alexander polynomial arises in the leading term of a semi-classical Melvin-Morton-Rozansky expansion of colored knot polynomials. In this work, following the opposite direction, we propose how to reconstruct colored HOMFLY-PT polynomials,…

We begin with a review of Tutte's homotopy theory, which concerns the structure of certain graph associated to a matroid (together with some extra data). Concretely, Tutte's path theorem asserts that this graph is connected, and his…

In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…

George Birkhoff proved in 1912 that the number of proper colorings of a finite graph G with n colors is a polynomial in n, called the chromatic polynomial of G. Read conjectured in 1968 that for any graph G, the sequence of absolute values…

To every matroid, we associate a class in the K-theory of the Grassmannian. We study this class using the method of equivariant localization. In particular, we provide a geometric interpretation of the Tutte polynomial. We also extend…

A k-edge-weighting of a graph G is a function w: E(G)->{1,2,...,k}. An edge-weighting naturally induces a vertex coloring c, where for every vertex v in V(G), c(v) is sum of weights of the edges that are adjacent to vertex v. If the induced…

Let G be a connected bipartite graph with color classes E and V and root polytope Q. Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is…

In this paper, we consider multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomials is defined in terms of a deletion-contraction-extraction recurrence, previously…

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…

We prove that for every $t\in \mathbb{N}$ there is a constant $\gamma_t$ such that every graph with twin-width at most $t$ and clique number $\omega$ has chromatic number bounded by $2^{\gamma_t \log^{4t+3} \omega}$. In other words, we…

We develop an equivariant version of the non-archimedean Arakelov theory of [BGS95] in the case of toric varieties. We define the equivariant analogues of the non-archimedean differential forms and currents appearing in \emph{loc.~cit.} and…

By considering Tutte polynomials of Hopf algebras, we show how a Tutte polynomial can be canonically associated with combinatorial objects that have some notions of deletion and contraction. We show that several graph polynomials from the…