Related papers: A Whitney polynomial for hypermaps

We explore several generalizations of Whitney's theorem -- a classical formula for the chromatic polynomial of a graph. Following Stanley, we replace the chromatic polynomial by the chromatic symmetric function. Following Dohmen and Trinks,…

We describe the topology of a general polynomial mapping $F=(f, g):X\to\Bbb C^2$, where $X$ is a complex plane or a complex sphere.

We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an…

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…

In the present note we show, via the connection between chromatic polynomial and Potts model, that the Whitney Broken circuit theorem is in fact a special case of a more general identity relating the chromatic polynomial of a graph G=(V,E)…

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

We describe the topology of a general polynomial mapping $f:\Bbb C^2\to\Bbb C^2.$

We give polynomial-time algorithms for obtaining hamilton circuits in random graphs, G, and random directed graphs, D. If n is finite, we assume that G or D contains a hamilton circuit. If G is an arbitrary graph containing a hamilton…

The method of Whitney interpolation is used to construct, for any real or complex projective algebraic variety, a stratified submersive family of self-maps that yields stratified general position and transversality theorems for…

We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.

We describe new algorithms to compute Whitney stratifications of real algebraic varieties. Using either conormal or polar techniques, these algorithms stratify a complexification of a given real variety. We then show that the resulting…

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.

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

We establish a broad generalization of Whitney's broken circuit theorem on the chromatic polynomial of a graph to sums of type $\sum_{A\subseteq S} f(A)$ where $S$ is a finite set and $f$ is a mapping from the power set of $S$ into an…

The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the…

In this paper, we introduce the partial-dual polynomial for hypermaps, extending the concept from ribbon graphs. We discuss the basic properties of this polynomial and characterize it for hypermaps with exactly one hypervertex containing a…