Related papers: Laurent polynomials of planar graphs
A finitely generated module over the ring L=Z[t, t^{-1}] of integer Laurent polynomials that has no Z-torsion is determined by a pair of sub-lattices of L^d. Their indices are the absolute values of the leading and trailing coefficients of…
We review properties of confluent functions and the closely related Laguerre polynomials, and determine their bilinear integrals. As is well-known, these integrals are convergent only for a limited range of parameters. However, when one…
In this paper, we shall precise the asymptotic behaviour of Newton polygons of $L$ functions associated to character sums, coming from some $n$ variable Laurent polynomials. In order to do this, we use the free sum on convex polytopes. This…
The complexity class NP of decision problems that can be solved nondeterministically in polynomial time is of great theoretical and practical importance where the notion of polynomial-time reductions between NP-problems is a key concept for…
We generalize the construction of affine polar graphs in two different ways to obtain new partial difference sets and amorphic association schemes. The first generalization uses a combination of quadratic forms and uniform cyclotomy. In the…
We generalize Fomin and Zelevinsky's cluster algebras by allowing exchange polynomials to be arbitrary irreducible polynomials, rather than binomials.
This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…
Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a…
We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…
There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair…
The partition function of a factor graph can sometimes be accurately estimated by Monte Carlo methods. In this paper, such methods are extended to factor graphs with negative and complex factors.
We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.
Matrix valued Laguerre polynomials are introduced via a matrix weight function involving several degrees of freedom using the matrix nature. Under suitable conditions on the parameters the matrix weight function satisfies matrix Pearson…
The purpose of this article is to present, in a simple way, an analytic approach to special numbers and polynomials. The approach is based on the derivative polynomials. The paper is, to some extent, a review article, although it contains…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
We first present a filtration on the ring L of Laurent polynomials such that the direct sum decomposition of its associated graded ring gr L agrees with the direct sum decomposition of gr L, as a module over the complex general linear Lie…
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…
The Eynard-Orantin invariants of a plane curve are multilinear differentials on the curve. For a particular class of genus zero plane curves these invariants can be equivalently expressed in terms of simpler expressions given by polynomials…
In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…
This paper proves that every planar graph $G$ contains a matching $M$ such that the Alon-Tarsi number of $G-M$ is at most $4$. As a consequence, $G-M$ is $4$-paintable, and hence $G$ itself is $1$-defective $4$-paintable. This improves a…