Multiparameter Higher Order Daehee and Bernoulli Numbers and Polynomials

This paper gives a new generalization of higher order Daehee and Bernoulli numbers and polynomials. We define the multiparameter higher order Daehee numbers and polynomials of the first and second kind. Moreover, we derive some new results for these numbers and polynomials. The relations between these numbers and Stirling and Bernoulli numbers are obtained. Furthermore, some interesting special cases of the generalized higher order Daehee and Bernoulli numbers and polynomials are deduced.

Some Identities Involving the Higher-Order Changhee Numbers and Polynomials

In this paper, by the classical method of Riordan arrays, establish several general involving higher-order Changhee numbers and polynomials, which are related to special polynomials and numbers. From those numbers, we derive some interesting and new identities.

The Powers Sums, Bernoulli Numbers, Bernoulli Polynomials Rethinked

Utilizing translation operators we get the powers sums on arithmetic progressions and the Bernoulli polynomials of order munder the form of differential operators acting on monomials. It follows that (d/dn-d/dz) applied on a power sum has a meaning and is exactly equal to the Bernoulli polynomial of the same order. From this new property we get the formula giving powers sums in term of sums of successive derivatives of Bernoulli polynomial multiplied withprimitives of the same order of n. Then by changing the two arguments z,n into Z=z(z-1), λ where λ designed the 1st order power sums and proving that Bernoulli polynomials of odd order vanish for arguments equal to 0, 1/2, 1, we obtain easily the Faulhaber formula for powers sums in term of polynomials in λ having coefficients depending on Z. These coefficients are found to be derivatives of odd powers sums on integers expressed in Z. By the way we obtain the link between Faulhaber formulae for powers sums on integers and on arithmetic progressions. To complete the work we propose tables for calculating in easiest manners possibly the Bernoulli numbers, the Bernoulli polynomials, the powers sums and the Faulhaber formula for powers sums.

Some Properties of Degenerate r-Dowling Polynomials and Numbers of the Second Kind

The generating functions of special numbers and polynomials have various applications in many fields as well as mathematics and physics.In recent years,some mathematicians have studied degenerate version of them and obtained many interesting results.With this in mind,in this paper,we introduce the degenerate r-Dowling polynomials and numbers associated with the degenerate r-Whitney numbers of the second kind.We derive many interesting properties and identities for them including generating functions,Dobinski-like formula,integral representations,recurrence relations,differential equation and various explicit expressions.In addition,we explore some expressions for them that can be derived from repeated applications of certain operators to the exponential functions,the derivatives of them and some identities involving them.

New Extension of Unified Family Apostol-Type of Polynomials and Numbers

The purpose of this paper is to introduce and investigate new unification of unified family of Apostol-type polynomials and numbers based on results given in [1] [2]. Also, we derive some properties for these polynomials and obtain some relationships between the Jacobi polynomials, Laguerre polynomials, Hermite polynomials, Stirling numbers and some other types of generalized polynomials.

Quantum mechanical operator realization of the Stirling numbers theory studied by virtue of the operator Hermite polynomials method

Based on the operator Hermite polynomials method（OHPM）, we study Stirling numbers in the context of quantum mechanics, i.e., we present operator realization of generating function formulas of Stirling numbers with some applications.As a by-product, we derive a summation formula involving both Stirling number and Hermite polynomials.

Selection of Coherent and Concise Formulae on Bernoulli Polynomials-Numbers-Series and Power Sums-Faulhaber Problems

Utilizing the translation operator to represent Bernoulli polynomials and power sums as polynomials of Sheffer-type, we obtain concisely almost all their known properties as so as many new ones, especially new recursion relations for calculating Bernoulli polynomials and numbers, new formulae for obtaining power sums of entire and complex numbers. Then by the change of arguments from z into Z = z(z-1) and n into λ which is the 1st order power sum we obtain the Faulhaber formula for powers sums in term of polynomials in λ having coefficients depending on Z. Practically we give tables for calculating in easiest possible manners, the Bernoulli numbers, polynomials, the general powers sums.

Partial Bell Polynomials, Falling and Rising Factorials, Stirling Numbers, and Combinatorial Identities

In the paper,the authors collect,discuss,and find out several connections,equivalences,closed-form formulas,and combinatorial identities concerning partial Bell polynomials,falling factorials,rising factorials,extended binomial coefficients,and the Stirling numbers of the first and second kinds.These results are new,interesting,important,useful,and applicable in combinatorial number theory.

On Polynomials Rn(x) Related to the Stirling Numbers and the Bell Polynomials Associated with the p-Adic Integral on

In this paper, one introduces the polynomials Rn(x) and numbers Rn and derives some interesting identities related to the numbers and polynomials: Rn and Rn(x). We also give relation between the Stirling numbers, the Bell numbers, the Rn and Rn(x).

Some Identities Involving Square of Fibonacci Numbers and Lucas Numbers

By studying the properties of Chebyshev polynomials, some specific and mean-ingful identities for the calculation of square of Chebyshev polynomials, Fibonacci numbersand Lucas numbers are obtained.

Some Remarks for the Relationships between the Generalized Bernoulli and Euler Polynomials

In this paper,we prove the Srivastava-Pint'er's addition theorems(see Applied Mathematic Lett.17(2004),375-380) by applying the another methods.We also provide some analoges of these addition theorems and deduce the corresponding special cases.

Chebyshev Polynomials with Applications to Two-Dimensional Operators

A new application of Chebyshev polynomials of second kind Un(x) to functions of two-dimensional operators is derived and discussed. It is related to the Hamilton-Cayley identity for operators or matrices which allows to reduce powers and smooth functions of them to superpositions of the first N-1 powers of the considered operator in N-dimensional case. The method leads in two-dimensional case first to the recurrence relations for Chebyshev polynomials and due to initial conditions to the application of Chebyshev polynomials of second kind Un(x). Furthermore, a new general class of Generating functions for Chebyshev polynomials of first and second kind Un(x) comprising the known Generating function as special cases is constructed by means of a derived identity for operator functions f(A) of a general two-dimensional operator A. The basic results are Formulas (9.5) and (9.6) which are then specialized for different examples of functions f(x). The generalization of the theory for three-dimensional operators is started to attack and a partial problem connected with the eigenvalue problem and the Hamilton-Cayley identity is solved in an Appendix. A physical application of Chebyshev polynomials to a problem of relativistic kinematics of a uniformly accelerated system is solved. All operator calculations are made in coordinate-invariant form.

Factorization of Cyclotomic Polynomials with Quadratic Radicals in the Coefficients

In this article we continue the consideration of geometrical constructions of regular n-gons for odd n by rhombic bicompasses and ruler used in [1] for the construction of the regular heptagon (n=7). We discuss the possible factorization of the cyclotomic polynomial in polynomial factors which contain not higher than quadratic radicals in the coefficients whereas usually the factorization of the cyclotomic polynomials is considered in products of irreducible factors with integer coefficients. In considering the regular heptagon we find a modified variant of its construction by rhombic bicompasses and ruler. In detail, supported by figures, we investigate the case of the regular tridecagon (n=13) which in addition to n=7 is the only candidate with low n (the next to this is n=769 ) for which such a construction by rhombic bicompasses and ruler seems to be possible. Besides the coordinate origin we find here two points to fix for the possible application of two bicompasses (or even four with the addition of the complex conjugate points to be fixed). With only one bicompass one has in addition the problem of the trisection of an angle which can be solved by a neusis construction that, however, is not in the spirit of constructions by compass and ruler and is difficult to realize during the action of bicompasses. As discussed it seems that to finish the construction by bicompasses the correlated action of two rhombic bicompasses must be applied in this case which avoids the disadvantages of the neusis construction. Single rhombic bicompasses allow to draw at once two circles around two fixed points in such correlated way that the position of one of the rotating points on one circle determines the positions of all the other points on the second circle in unique way. The known case n=17 embedded in our method is discussed in detail.

Dominating Sets and Domination Polynomials of Square of Paths

Let G = (V, E) be a simple graph. A set S í V is a dominating set of G, if every vertex in V-S is adjacent to at least one vertex in S. Let be the square of the Path and let denote the family of all dominating sets of with cardinality i. Let . In this paper, we obtain a recursive formula for . Using this recursive formula, we construct the polynomial, , which we call domination polynomial of and obtain some properties of this polynomial.

Edge-Vertex Dominating Sets and Edge-Vertex Domination Polynomials of Cycles

Let G = (V, E) be a simple graph. A set S E(G) is an edge-vertex dominating set of G (or simply an ev-dominating set), if for all vertices v V(G);there exists an edge eS such that e dominates v. Let denote the family of all ev-dominating sets of with cardinality i. Let . In this paper, we obtain a recursive formula for . Using this recursive formula, we construct the polynomial, , which we call edge-vertex domination polynomial of (or simply an ev-domination polynomial of ) and obtain some properties of this polynomial.

Special Numbers on Analytic Functions

The aim of this paper is to give some analytic functions which are related to the generating functions for the central factorial numbers. By using these functions and p-adic Volkenborn integral, we derive many new identities associated with the Bernoulli and Euler numbers, the central factorial numbers and the Stirling numbers. We also give some remarks and comments on these analytic functions, which are related to the generating functions for the special numbers.

Degenerate s-Extended Complete and Incomplete Lah-Bell Polynomials

Degenerate versions of special polynomials and numbers applied to social problems,physics,and applied mathematics have been studied variously in recent years.Moreover,the(s-)Lah numbers have many other interesting applications in analysis and combinatorics.In this paper,we divide two parts.We first introduce new types of both degenerate incomplete and complete s-Bell polynomials respectively and investigate some properties of them respectively.Second,we introduce the degenerate versions of complete and incomplete Lah-Bell polynomials as multivariate forms for a new type of degenerate s-extended Lah-Bell polynomials and numbers respectively.We investigate relations between these polynomials and degenerate incomplete and complete s-Bell polynomials,and derive explicit formulas for these polynomials.

A Note on Bell-Based Bernoulli and Euler Polynomials of Complex Variable

In this article,we construct the generating functions for new families of special polynomials including two parametric kinds of Bell-based Bernoulli and Euler polynomials.Some fundamental properties of these functions are given.By using these generating functions and some identities,relations among trigonometric functions and two parametric kinds of Bell-based Bernoulli and Euler polynomials,Stirling numbers are presented.Computational formulae for these polynomials are obtained.Applying a partial derivative operator to these generating functions,some derivative formulae and finite combinatorial sums involving the aforementioned polynomials and numbers are also obtained.In addition,some remarks and observations on these polynomials are given.

k-Order Fibonacci Polynomials on AES-Like Cryptology

The Advanced Encryption Standard(AES)is the most widely used symmetric cipher today.AES has an important place in cryptology.Finite field,also known as Galois Fields,are cornerstones for understanding any cryptography.This encryption method on AES is a method that uses polynomials on Galois fields.In this paper,we generalize the AES-like cryptology on 2×2 matrices.We redefine the elements of k-order Fibonacci polynomials sequences using a certain irreducible polynomial in our cryptology algorithm.So,this cryptology algorithm is called AES-like cryptology on the k-order Fibonacci polynomial matrix.

Generalized Exponential Euler Polynomials and Exponential Splines

Here presented is constructive generalization of exponential Euler polynomial and exponential splines based on the interrelationship between the set of concepts of Eulerian polynomials, Eulerian numbers, and Eulerian fractions and the set of concepts related to spline functions. The applications of generalized exponential Euler polynomials in series transformations and expansions are also given.