Related papers: On the constant partial-dual polynomials of hyperm…

Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an…

This is an expository paper extending the tutorial talk at the MATRIX Workshop on Uniqueness and Discernment in Graph Polynomials in October 2023. The explanation is mainly based on the paper "Partial Duality of Hypermaps" by S.Chmutov and…

Hexagon relations are algebraic realizations of four-dimensional Pachner moves. `Constant' -- not depending on a 4-simplex in a triangulation of a 4-manifold -- hexagon relations are proposed, and their polynomial-valued cohomology is…

We introduce partial duality of hypermaps, which include the classical Euler-Poincar\'e duality as a particular case. Combinatorially, hypermaps may be described in one of three ways: as three involutions on the set of flags (bi-rotation…

We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…

We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of distinct monomials for dimensions 2 and 3. We study the connection with monomial CR maps of hyperquadrics and prove similar bounds in this setup…

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

The concept of partial duality in hypermaps was introduced by Chmutov and Vignes-Tourneret, and Smith independently. This notion serves as a generalization of the concept of partial duality found in maps. In this paper, we first present an…

The permanental polynomial of a graph $G$ is $\pi(G,x)\triangleq\mathrm{per}(xI-A(G))$. From the result that a bipartite graph $G$ admits an orientation $G^e$ such that every cycle is oddly oriented if and only if it contains no even…

A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…

Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…

Recently, Gross, Mansour and Tucker introduced the partial-dual genus polynomial of a ribbon graph as a generating function that enumerates the partial duals of the ribbon graph by genus. It is analogous to the extensively-studied…

Let $G$ be a graph and $A$ the adjacency matrix of $G$. The permanental polynomial of $G$ is defined as $\mathrm{per}(xI-A)$. In this paper some of the results from a numerical study of the permanental polynomials of graphs are presented.…

We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…

We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several graph invariants.

Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A}…

This paper continues our investigation of the dynamics of polynomial diffeomorphisms of C^2. We introduce a dynamical property of polynomial diffeomorphisms that generalizes hyperbolicity in the way that semi-hyperbolicity generalizes…

The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph $G$, a connected subgraph $H$ of $G$ and a drawing $\mathcal{H}$ of $H$,…

Previously, the graph permanent was introduced as a single-valued invariant for graphs $G$ with $|E(G)| = k(|V(G)|-1)$ for some $k \in \mathbb{Z}_{>0}$. Herein, we construct the extended graph permanent, an infinite sequence for all graphs.…

Let $G^\sigma$ be an orientation of a simple graph $G$. In this paper, the permanental polynomial of an oriented graph $G^\sigma$ is introduced. The coefficients of the permanental polynomial of $G^\sigma$ are interpreted in terms of the…