Some Symmetric Identities Involving Fubini Polynomials and Euler Numbers

The aim of this paper is to use elementary methods and the recursive properties of a special sequence to study the computational problem of one kind symmetric sums involving Fubini polynomials and Euler numbers, and give an interesting computational formula for it. At the same time, we also give a recursive calculation method for the general case.


Introduction
For any integer n ≥ 0, the Fubini polynomials {F n (y)} are defined by the coefficients of the generating function where F 0 (y) = 1, F 1 (y) = y, and so on.F n (1) = F n are called Fubini numbers.These polynomials and numbers are closely connected with the Stirling numbers.Some contents and propertities of Stirling numbers can be found in reference [1].T. Kim et al. [2] proved the identity where S 2 (n, k) are the Stirling numbers of the second kind.It not only associated Fubini polynomials with Stirling numbers, but also stressed the importance of researching Fubini polynomials.Please note that the identity (see [3,4]) where E n (x) signifies the Euler polynomials.
It is distinct that if taking y = − 1 2 in (1) and x = 0 in (2), then from (1) and ( 2) we can get the identity where E n (0) = E n is the Euler number (see [5] for related contents).On the other hand, two variable Fubini polynomials are defined by means of the following (see [2,6]) and F n (y) = F n (0, y) for all integers n ≥ 0.About the properties of F n (x, y), several scholars have also researched it, especially T. Kim and others have done a large amount of vital works.For instance, they proved a series of identities linked to F n (x, y) (see [2,7]), one of which is These polynomials occupy indispensable positions in the theory and application of mathematics.In particular, they are widely used in combinatorial mathematics.Therefore, several scholars have researched their various properties, and acquired a series of vital results.Some involved contents can be found in references [5,[7][8][9][10][11][12][13][14][15][16][17].
The goal of this paper is to use elementary methods and recursive properties of a special sequenc to research the computational problem of the sums where the summation is over all k-tuples with non-negative integer coordinates (a 1 , About this content, it seems there is no valid method to solve the computational problem of (4).However, this problem is significant, it can reveal the structure of Fubini polynomials itself and its internal relations, at least it can reflect the combination properties of Fubini polynomials.
In this paper, we will take elementary methods and the properties of F n (y) to obtain a fascinating computational formula for (4).Simultaneously, we can also acquire a recursive calculation method for the general case.That is, we are going to prove the following major result: Theorem 1.For any positive integers n and k, we have the identity where the sequence {C(k, i)} is defined as follows: For any positive integer k and integers The characteristic of this theorem is to represent a complex sum of Fubini polynomials as a linear combination of a single Fubini polynomial.Of course, our method can also be further generalized, provided a corresponding results for F n (x, y).It is just that its form is not so pretty, so we are not listing it here.If taking k = 3, 4 and 5, then from our theorem we may instantly deduce the following several corollaries: Corollary 1.For any positive integer n, we have the identity Corollary 2. For any positive integer n, we have the identity Corollary 3.For any positive integer n, we have the identity If taking y = − 1 2 in our theorem, then from (3) we can also infer the following: Corollary 4. For any positive integers n and k ≥ 2, we have the identity If n = p is an odd prime, then taking y = 1 in Corollarys 1 and 2, we also have the following congruences.
Corollary 5.For any odd prime p, we have the congruence Corollary 6.For any odd prime p, we have the congruence

A Simple Lemma
For purpose of proving our theorem, we need a uncomplicated lemma.As a matter of convenience, we first present a new sequence {C(k, i)} as follows.For any positive integer k and integers 0 For clarity, for 1 ≤ k ≤ 9, we list values of C(k, i) in the Table 1.Obviously, the values of C(k, i) can be easily calculated by using a computer program.Hence, for any positive integer k, the computational problem of (4) can be solved fully.
In this table of numerical values, we also find that for prime p = 3, 5 and 7, we have the congruence For all prime p > 7 is true?This is an enjoyable open problem.If this congruence is true, then we can also deduce that for any positive integer n and odd prime p, one has the congruence where f (0) (t) = f (t), f (r) (t) denotes the r-order derivative of f (t) for variable t.
Proof.Now we prove this lemma by induction.From the definition of the derivative we acquire or Please note that C(1, 0) = 1 and C(1, 1) = 1, so the lemma is true for k = 1.Suppose that the lemma is true for all integer k ≥ 1.That is, Then take the derivative for t in (7) and applying ( 5) and ( 7) we obtain It is evident that (8) implies where we have used the identities C(k, 0) = 1 and C(k, k) = k!.Now the lemma follows from ( 9) and mathematical induction.

Proof of the Theorem
In this section, the proof of our theorem will be completed.Firstly, for any positive integer k, from the definition of f (t) and the properties of the power series we obtain and From ( 10), (11) and Lemma we acquire Comparing the coefficients of t n in (12) we have the identity

1 1 −Lemma 1 .
y(e t −1) .Then we have the following For any positive integer k, we have the identity k