Related papers: Laurent polynomials of planar graphs

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

In this paper we consider an appropriate ordering of the Laurent monomials $x^{i}y^{j}$, $i,j \in \mathbb{Z}$ that allows us to study sequences of orthogonal Laurent polynomials of the real variables $x$ and $y$ with respect to a positive…

Let $(G,\sigma)$ be any signed planar graph. We show that the Alon-Tarsi number of $(G,\sigma)$ is at most 5, generalizing a recent result of Zhu for unsigned case. In addition, if $(G,\sigma)$ is $2$-colorable then $(G,\sigma)$ has the…

We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.

We consider general linear superalgebra (type A) and tensor with Laurent polynomial ring in several variables. We then consider the universal central extension of this Lie superalgebra which we call toroidal superalgebra. We give a faithful…

We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…

We define sets of orthogonal polynomials satisfying the additional constraint of a vanishing average. These are of interest, for example, for the study of the Hohenberg-Kohn functional for electronic or nucleonic densities and for the study…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

The Burau representation of the braid group can be used to recover the Alexander polynomial of the closure of a braid. We define twisted Burau maps and use them to compute twisted Alexander polynomials.

Using the addition technique, we present polynomial identities for the Betti and Poincar\'e polynomials of reduced plane curves.

We prove that two horizontal-strip LLT polynomials are equal if the associated weighted graphs defined by the author in a previous paper are isomorphic. This provides a sufficient condition for equality of horizontal-strip LLT polynomials…

In this article, we extend some results about algebra $A$ with the group of units $U(A)$ having a special polynomial identity, Laurent polynomial. And we present a new version of B. Hartley Conjecture with these identities.

Normal forms allow the use of a restricted class of coordinate transformations (typically homogeneous polynomials) to put the bifurcations found in nonlinear dynamical systems into a few standard forms. We investigate here the consequences…

In this paper, we use two-variable Laurent polynomials attached to matrices to encode properties of compositions of sequences. The Lagrange identity in the ring of Laurent polynomials is then used to give a short and transparent proof of a…

A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.

In recent years, the notion of characteristic polynomial of representations of Lie algebras has been widely studied. This paper provides more properties of these characteristic polynomials. For simple Lie algebras, we characterize the…

We establish Bernstein Theorems for Lagrangian graphs which are Hamiltonian minimal or have conformal Maslov form. Some known results of minimal (Lagrangian) submanifolds are generalized.

Differential resultant formulas are defined, for a system $\mathcal{P}$ of $n$ ordinary Laurent differential polynomials in $n-1$ differential variables. These are determinants of coefficient matrices of an extended system of polynomials…

Alon et al. introduced the concept of non-repetitive colourings of graphs. Here we address some questions regarding non-repetitive colourings of planar graphs. Specifically, we show that the faces of any outerplanar map can be…

We generalize both the Fibonacci and Lucas numbers to the context of graph colorings, and prove some identities involving these numbers. As a corollary we obtain new proofs of some known identities involving Fibonacci numbers such as…