Related papers: On an ordering-dependent generalization of Tutte p…

This paper introduces a novel method for approximating the dynamics of a large autonomous system projected onto a fixed subspace. The core contribution is a novel recursive algorithm to construct an effective time-dependent generator that…

Tutte has described in the book "Connectivity in graphs" a canonical decomposition of any graph into 3-connected components. In this article we translate (using the language of symbolic combinatorics) Tutte's decomposition into a general…

We show that the Poincare polynomial associated with the orbifold cell decomposition of the moduli space of smooth algebraic curves with distinct marked points satisfies a topological recursion formula of the Eynard-Orantin type. The…

We study the field equations of extensions of General Relativity formulated within a metric-affine formalism setting torsion to zero (Palatini approach). We find that different (second-order) dynamical equations arise depending on whether…

We derive explicit formulas for the normal ordering of powers of arbitrary monomials of boson operators. These formulas lead to generalisations of conventional Bell and Stirling numbers and to appropriate generalisations of the Dobinski…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

Let f be an entire function that has only finitely many critical and asymptotic values. Up to topological equivalence, the function $f$ is determined by combinatorial information, more precisely by an infinite graph known as a…

We prove the complete monotonicity on $(0,\infty)^n$ for suitable inverse powers of the spanning-tree polynomials of graphs and, more generally, of the basis generating polynomials of certain classes of matroids. This generalizes a result…

In this work, we obtain an a-posteriori theorem for the existence of partly hyperbolic invariant tori in analytic Hamiltonian systems: autonomous, periodic, and quasi-periodic. The method of proof is based on the convergence of a KAM…

A graph $G$ is said to be $p$-periodic, if the automorphism group $Aut(G)$ contains an element of order $p$ which preserves no edges. In this paper, we investigate the behavior of graph polynomials (Negmai and Tutte) with respect to graph…

It is be shown that the sequence of Bernstein polynomials for a function of several variables converges to this function uniformly along with every partial derivative of any order, provided that the latter derivative is well defined and…

Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…

Polynomial reduction is one of the main tools in computational algebra with innumerable applications in many areas, both pure and applied. Since many years both the theory and an efficient design of the related algorithm have been solidly…

To a pair $(A,s)$ consisting of a smooth, cyclic $A_\infty$-algebra $A$ and a splitting $s$ of the Hodge filtration on its Hochschild homology Costello (2005) associates an invariant which conjecturally generalizes the total descendant…

In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.

We introduce the concept of a relative Tutte polynomial of colored graphs. We show that this relative Tutte polynomial can be computed in a way similar to the classical spanning tree expansion used by Tutte in his original paper on this…

The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…

We prove that the two-variable Tutte polynomial of hypergraphs can be defined via embedding activities. We also prove that embedding activities of hypergraphs yield a Crapo-style decomposition of $\mathbb{Z}^E$, thus generalizing Bernardi's…

INTRODUCTION This papers deals with partial differential equations of second order, linear, with constant and not constant coefficients, in two variables, which admit real characteristics. I face the study of PDEs with the mentality of the…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…