Related papers: Laurent polynomials of planar graphs
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
The use of tools from analysis to approach problems in graph theory has become an active area of research. Usually such methods are applied to problems involving dense graphs and hypergraphs; here we give the an extension of such methods to…
Our primary motivation is existence and uniqueness for the obstacle problem on graphs. That is, we look for unique solutions to the problem $Lu = \chi_{\{u>0\}}$, where $L$ is the Laplacian matrix associated to a graph, and $u$ is a…
Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…
In this paper, we provide a new method to find all zeros of polynomials with quaternionic coefficients located on only one side of the powers of the variable (these polynomials are called simple polynomials). This method is much more…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
In a field of Laurent series, we construct a subring which has a module structure over a Weyl algebra. Identities of Bernoulli numbers and polynomials are obtained from these algebraic structures.
We extend recent work by Howie, Mathews and Purcell to simplify the calculation of A-polynomials for any family of hyperbolic knots related by twisting. The main result follows from the observation that equations defining the deformation…
We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…
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 give the path model solution for the cluster algebra variables of the $A_r$ $T$-system with generic boundary conditions. The solutions are partition functions of (strongly) non-intersecting paths on weighted graphs. The graphs are the…
In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…
This paper proves that if $G$ is a planar graph without 4-cycles and $l$-cycles for some $l\in\{5, 6, 7\}$, then there exists a matching $M$ such that $AT(G-M)\leq 3$. This implies that every planar graph without 4-cycles and $l$-cycles for…
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…
We give a general criterion for two toric varieties to appear as fibers in a flat family over the projective line. We apply this to show that certain birational transformations mapping a Laurent polynomial to another Laurent polynomial…
Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete bipartite graphs with bounded weights…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
We establish a correspondence between one-parameter deformations of an affine Gorenstein toric pair $(X_P, \partial X_P)$, defined by a polytope $P$, and mutations of a Laurent polynomial $f$ with Newton polytope $\newt(f) = P$. For a…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…