Related papers: Laurent polynomials of planar graphs
We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…
The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.
Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix…
In this paper, we investigated properties of Tribonacci-Lucas polynomials which generalized Tribonacci-Lucas numbers. From this generalization, we also obtain some new algebraic properties on these numbers and polynomials as Binet formula,…
We study tropically planar graphs, which are the graphs that appear in smooth tropical plane curves. We develop necessary conditions for graphs to be tropically planar, and compute the number of tropically planar graphs up to genus $7$. We…
We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…
Gathering different results from singularity theory, geometry and combinatorics, we show that the spectrum at infinity of a tame Laurent polynomial counts lattice points in polytopes and we deduce an effective algorithm in order to compute…
A new kind of deformed calculus was introduced recently in studying of parabosonic coordinate representation. Based on this deformed calculus, a new deformation of Legendre polynomials is proposed in this paper, some properties and…
Algebraic domains are regions in the plane surrounded by mutually disjoint non-singular real algebraic curves. Poincar'e-Reeb Graphs of them are graphs they naturally collapse: such graphs are formally formulated by Sorea, for example,…
Pseudodifferential operators of several variables are formal Laurent series in the formal inverses of $\partial_1, ..., \partial_n$ with $\partial_i = d$ $1 \leq i \leq n$. As in the single variable case, Lax equations can be constructed…
We present a novel approach for graph classification based on tabularizing graph data via new variants of the Weisfeiler-Leman algorithm and then applying methods for tabular data. The variants are obtained by modifying the underlying…
We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…
This is the first one of a series of papers on association of orientations, lattice polytopes, and abelian group arrangements to graphs. The purpose is to interpret the integral and modular tension polynomials of graphs at zero and negative…
We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
In this paper, we consider the degenerate multi-poly-Bernoulli numbers and polynomials which are defined by means of the multiple polylogarithms and degenerate versions of the multi-poly-Bernoulli numbers and polynomials. We investigate…
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic…
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
For a bilinear form obtained by adding a Dirac mass to a positive definite moment functional in several variables, explicit formulas of orthogonal polynomials are derived from the orthogonal polynomials associated with the moment…
The purpose of this paper is to obtain Fourier transforms of multivariate orthogonal polynomials on the cone such as Laguerre polynomials on the cone and Jacobi polynomials on the cone and to define two new families of multivariate…