Using a modified foam evaluation, we give categorification of the Alexander polynomial knot. We also purely algebraic version this knot homology which makes it appear as infinite page spectral sequence starting at reduced triply graded link Khovanov--Rozansky.

­ We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity. The basic idea of our approach is to construct a univariate polynomial equation in x, whose coefficients correspond to the terms of the Sequence. The approa...

Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = ∑ T⊎U=S pT (x)pU (y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any polynomial sequence of binomial type. This leads to several new expansions of the chromatic polynomial. We also describe a set map generalization of Abel polynomials.

‎this paper obtains the exact solutions of the wave equation as a second-order partial differential equation (pde)‎. ‎we are going to calculate polynomial and non-polynomial exact solutions by using lie point symmetry‎. ‎we demonstrate the generation of such polynomial through the medium of the group theoretical properties of the equation‎. ‎a generalized procedure for polynomial solution is pr...

This paper provides an insight into different structures of a special polynomial sequence of binomial type in higher dimensions with values in a Clifford algebra. The elements of the special polynomial sequence are homogeneous hypercomplex differentiable (monogenic) functions of different degrees and their matrix representation allows to prove their recursive construction in analogy to the comp...

A classical result due to Bochner characterizes the classical orthogonal polynomial systems as solutions of a secondorder eigenvalue equation. We extend Bochner’s result by dropping the assumption that the first element of the orthogonal polynomial sequence be a constant. This approach gives rise to new families of complete orthogonal polynomial systems that arise as solutions of second-order e...

the omega polynomial(x) was recently proposed by diudea, based on the length of stripsin given graph g. the sadhana polynomial has been defined to evaluate the sadhana index ofa molecular graph. the pi polynomial is another molecular descriptor. in this paper wecompute these three polynomials for some infinite classes of nanostructures.

in this paper, we show how certain metabelian groups can be found within polynomial evaluation groupoids. we show that every finite abelian group can beobtained as a polynomial evaluation groupoid.

Negami and Kawagoe has already defined a polynomial f(G) associated with each graph G as what discriminates graphs more finely than the polynomial f(G) definedby Negami and the Tutte polynomial. In this paper, we shall show that the polynomial f(G) includes potentially the generating function counting the independent sets and the degree sequence of a graph G, which cannot be recognized from f(G...