相关论文: Set maps, umbral calculus, and the chromatic polyn…
An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…
In this papier, by the classical umbral calculus method, we establish identities involving the Appell polynomials and extend some existing identities.
Cumulant mapping employs a statistical reconstruction of the whole by sampling its parts. The theory developed in this work formalises and extends ad hoc methods of `multi-fold' or `multi-dimensional' covariance mapping. Explicit formulae…
In this paper, by the umbral calculus method, we give a remarkable congruence involving Appell polynomials. Some applications on derangement polynomials are also presented.
We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.
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.
In this paper, we investigate some properties of several Sheffer sequences of several polynomials arising from umbral calculus. From our investigation, we can derive many interesting identities of several polynomials
In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…
In the paper, we search for monochromatic infinite additive structures involving polynomials over $\mathbb{N}$. It is proved that for any $r\in \mathbb{N}$, any two distinct natural numbers $a,b$, and any $2$-coloring of $\mathbb{N}$, there…
An umbral calculus over local fields of positive characteristic is developed on the basis of a relation of binomial type satisfied by the Carlitz polynomials. Orthonormal bases in the space of continuous $\mathbb F_q$-linear functions are…
A new method of algebraic nature is proposed for the study of the asymptotic properties of special polynomials. The technique we foresee is based on the use of umbral operators, allowing a unified treatment of a large body of polynomial…
In a rather straightforward manner, we develop the well-known formula for the Stirling numbers of the first kind in terms of the (exponential) complete Bell polynomials where the arguments include the generalised harmonic numbers. We also…
The use of the umbral formalism allows a significant simplification of the derivation of sum rules involving products of special functions and polynomials. We rederive in this way known sum rules and addition theorems for Bessel functions.…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
Using random variables as motivation, this paper presents an exposition of the formalisms developed by Rota and Taylor for the classical umbral calculus. A variety of examples are presented, culminating in several descriptions of sequences…
In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the…
This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…
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…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…