Related papers: On Krawtchouk polynomials
For a simple graph $G$, let $\chi(G,x)$ denote the chromatic polynomial of $G$. This manuscript introduces some polynomials which are related to chromatic polynomial and their relations.
Cauchy summation formula plays a central role in application of character calculus to many problems, from AGT-implied Nekrasov decomposition of conformal blocks to topological-vertex decompositions of link invariants. We briefly review the…
The main objective of this paper is to present recurrence relations for the generalized poly-Cauchy numbers and polynomials. This is accomplished by introducing the concept of generalized m-poly-Cauchy numbers and polynomials. Additionally,…
This is a short review article on invariants of spatial graphs, written for "A Concise Encyclopedia of Knot Theory" (ed. Adams et. al.). The emphasis is on combinatorial and polynomial invariants of spatial graphs, including the Alexander…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…
The Motzkin numbers can be derived as coefficients of hybrid polynomials. Such an identification allows the derivation of new identities for this family of numbers and offers a tool to investigate previously unnoticed links with the theory…
In [J. Phys. A: Math. Theor. 45 (2012)], while looking for spin chains that admit perfect state transfer, Vinet and Zhedanov found an apparently new sequence of orthogonal polynomials, that they called para-Krawtchouk polynomials, defined…
This paper initiates a systematic study of connections between undirected colored graphs and associated two-variable stable polynomials obtained via Cauchy transform-type formulas. Examples of such stable polynomials have played crucial…
Diaconis and Griffiths (2014) study the multivariate Krawtchouk polynomials orthogonal on the multinomial distribution. In this paper we derive the reproducing kernel orthogonal polynomials Q_n(x,y};N,p) on the multinomial distribution…
Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…
A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
It is known that the Ehrhart polynomials of cross-polytopes, as well as of pyramids over them, have positive coefficients. We give a combinatorial proof of this fact by showing that a scaled version of the Ehrhart polynomials are generating…
We tackle the regularisation of a differential system related to generalised Krawtchouk polynomials. We show a straightforward connection between certain auxiliary quantities involving the recurrence coefficients of these polynomials and…
A combinatorial theory for type $R_I$ orthogonal polynomials is given. The ingredients include weighted generalized Motzkin paths, moments, continued fractions, determinants, and histories. Several explicit examples in the Askey scheme are…
The Schur functions play a crucial role in the modern description of HOMFLY polynomials for knots and of topological vertices in DIM-based network theories, which could merge into a unified theory still to be developed. The Macdonald…
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials