scholarly journals Truncated-exponential-based Frobenius–Euler polynomials

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Wiyada Kumam ◽  
Hari Mohan Srivastava ◽  
Shahid Ahmad Wani ◽  
Serkan Araci ◽  
Poom Kumam
Keyword(s):  
Generating Function ◽  
Euler Polynomials ◽  
New Family ◽  
Summation Formulas ◽  
Exponential Generating Function

AbstractIn this paper, we first introduce a new family of polynomials, which are called the truncated-exponential based Frobenius–Euler polynomials, based upon an exponential generating function. By making use of this exponential generating function, we obtain their several new properties and explicit summation formulas. Finally, we consider the truncated-exponential based Apostol-type Frobenius–Euler polynomials and their quasi-monomial properties.

scholarly journals On a New Family of Generalized Stirling and Bell Numbers

10.37236/564 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Toufik Mansour ◽  
Matthias Schork ◽  
Mark Shattuck
Keyword(s):  
Closed Form ◽  
Generating Function ◽  
Recursion Relation ◽  
Stirling Numbers ◽  
Combinatorial Interpretation ◽  
Bell Numbers ◽  
New Family ◽  
Exponential Generating Function ◽  
Rook Numbers ◽  
Generalized Stirling Numbers

A new family of generalized Stirling and Bell numbers is introduced by considering powers $(VU)^n$ of the noncommuting variables $U,V$ satisfying $UV=VU+hV^s$. The case $s=0$ (and $h=1$) corresponds to the conventional Stirling numbers of second kind and Bell numbers. For these generalized Stirling numbers, the recursion relation is given and explicit expressions are derived. Furthermore, they are shown to be connection coefficients and a combinatorial interpretation in terms of statistics is given. It is also shown that these Stirling numbers can be interpreted as $s$-rook numbers introduced by Goldman and Haglund. For the associated generalized Bell numbers, the recursion relation as well as a closed form for the exponential generating function is derived. Furthermore, an analogue of Dobinski's formula is given for these Bell numbers.

scholarly journals Identities of Symmetry for Generalized Euler Polynomials

2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
Dae San Kim
Keyword(s):  
Generating Function ◽  
Euler Polynomials ◽  
Integral Expression ◽  
Power Sums ◽  
Exponential Generating Function

We derive eight basic identities of symmetry in three variables related to generalized Euler polynomials and alternating generalized power sums. All of these are new, since there have been results only about identities of symmetry in two variables. The derivations of identities are based on the -adic fermionic integral expression of the generating function for the generalized Euler polynomials and the quotient of integrals that can be expressed as the exponential generating function for the alternating generalized power sums.

scholarly journals IDENTITIES OF SYMMETRY FOR GENERALIZED TWISTED BERNOULLI POLYNOMIALS TWISTED BY RAMIFIED ROOTS OF UNITY

2014 ◽  
Vol 60 (1) ◽  
pp. 19-36
Author(s):  
Dae San Kim
Keyword(s):  
Generating Function ◽  
Bernoulli Polynomials ◽  
Roots Of Unity ◽  
Integral Expression ◽  
Power Sums ◽  
Exponential Generating Function

Abstract We derive eight identities of symmetry in three variables related to generalized twisted Bernoulli polynomials and generalized twisted power sums, both of which are twisted by ramified roots of unity. All of these are new, since there have been results only about identities of symmetry in two variables. The derivations of identities are based on the p-adic integral expression of the generating function for the generalized twisted Bernoulli polynomials and the quotient of p-adic integrals that can be expressed as the exponential generating function for the generalized twisted power sums.

A generalized class of restricted Stirling and Lah numbers

2018 ◽  
Vol 68 (4) ◽  
pp. 727-740 ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck
Keyword(s):  
Generating Function ◽  
Stirling Numbers ◽  
Combinatorial Properties ◽  
Exponential Generating Function ◽  
Cauchy Numbers ◽  
Restricted Stirling Numbers

Abstract In this paper, we consider a polynomial generalization, denoted by $\begin{array}{} u_m^{a,b} \end{array}$ (n, k), of the restricted Stirling numbers of the first and second kind, which reduces to these numbers when a = 1 and b = 0 or when a = 0 and b = 1, respectively. If a = b = 1, then $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) gives the cardinality of the set of Lah distributions on n distinct objects in which no block has cardinality exceeding m with k blocks altogether. We derive several combinatorial properties satisfied by $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) and some additional properties in the case when a = b = 1. Our results not only generalize previous formulas found for the restricted Stirling numbers of both kinds but also yield apparently new formulas for these numbers in several cases. Finally, an exponential generating function formula is derived for $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) as well as for the associated Cauchy numbers.

scholarly journals A New Family of Discrete Distributions with Mathematical Properties, Characterizations, Bayesian and Non-Bayesian Estimation Methods

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1648
Author(s):  
Mohamed Aboraya ◽  
Haitham M. Yousof ◽  
G.G. Hamedani ◽  
Mohamed Ibrahim
Keyword(s):  
Bayesian Estimation ◽  
Generating Function ◽  
Bayesian Methods ◽  
Probability Generating Function ◽  
Real Data ◽  
Discrete Distributions ◽  
Estimation Methods ◽  
Squared Error Loss Function ◽  
New Family ◽  
Mathematical Properties

In this work, we propose and study a new family of discrete distributions. Many useful mathematical properties, such as ordinary moments, moment generating function, cumulant generating function, probability generating function, central moment, and dispersion index are derived. Some special discrete versions are presented. A certain special case is discussed graphically and numerically. The hazard rate function of the new class can be “decreasing”, “upside down”, “increasing”, and “decreasing-constant-increasing (U-shape)”. Some useful characterization results based on the conditional expectation of certain function of the random variable and in terms of the hazard function are derived and presented. Bayesian and non-Bayesian methods of estimation are considered. The Bayesian estimation procedure under the squared error loss function is discussed. Markov chain Monte Carlo simulation studies for comparing non-Bayesian and Bayesian estimations are performed using the Gibbs sampler and Metropolis–Hastings algorithm. Four applications to real data sets are employed for comparing the Bayesian and non-Bayesian methods. The importance and flexibility of the new discrete class is illustrated by means of four real data applications.

Random Graphs from a Minor-Closed Class

2009 ◽  
Vol 18 (4) ◽  
pp. 583-599 ◽  
Author(s):  
COLIN McDIARMID
Keyword(s):  
Poisson Distribution ◽  
Random Graph ◽  
Generating Function ◽  
Random Graphs ◽  
Giant Component ◽  
Closed Class ◽  
Exponential Generating Function ◽  
Excluded Minor ◽  
A Minor ◽  
Labelled Graphs

A minor-closed class of graphs is addable if each excluded minor is 2-connected. We see that such a classof labelled graphs has smooth growth; and, for the random graphRnsampled uniformly from then-vertex graphs in, the fragment not in the giant component asymptotically has a simple ‘Boltzmann Poisson distribution’. In particular, asn→ ∞ the probability thatRnis connected tends to 1/A(ρ), whereA(x) is the exponential generating function forand ρ is its radius of convergence.

scholarly journals On Degenerate Truncated Special Polynomials

Mathematics ◽  
2020 ◽  
Vol 8 (1) ◽  
pp. 144 ◽  
Author(s):  
Ugur Duran ◽  
Mehmet Acikgoz
Keyword(s):  
Bernstein Polynomials ◽  
Stirling Numbers ◽  
Bell Polynomials ◽  
Euler Polynomials ◽  
Exponential Polynomials ◽  
Special Polynomials ◽  
Summation Formulas ◽  
Special Cases ◽  
Proof Techniques

The main aim of this paper is to introduce the degenerate truncated forms of multifarious special polynomials and numbers and is to investigate their various properties and relationships by using the series manipulation method and diverse special proof techniques. The degenerate truncated exponential polynomials are first considered and their several properties are given. Then the degenerate truncated Stirling polynomials of the second kind are defined and their elementary properties and relations are proved. Also, the degenerate truncated forms of the bivariate Fubini and Bell polynomials and numbers are introduced and various relations and formulas for these polynomials and numbers, which cover several summation formulas, addition identities, recurrence relationships, derivative property and correlations with the degenerate truncated Stirling polynomials of the second kind, are acquired. Thereafter, the truncated degenerate Bernoulli and Euler polynomials are considered and multifarious correlations and formulas including summation formulas, derivation rules and correlations with the degenerate truncated Stirling numbers of the second are derived. In addition, regarding applications, by introducing the degenerate truncated forms of the classical Bernstein polynomials, we obtain diverse correlations and formulas. Some interesting surface plots of these polynomials in the special cases are provided.

scholarly journals The Maximum Independent Sets of de Bruijn Graphs of Diameter 3

10.37236/681 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Dustin A. Cartwright ◽  
María Angélica Cueto ◽  
Enrique A. Tobis
Keyword(s):  
Recurrence Relation ◽  
Generating Function ◽  
Independent Sets ◽  
De Bruijn Graph ◽  
Alphabet Size ◽  
De Bruijn Graphs ◽  
Exponential Generating Function ◽  
De Bruijn

The nodes of the de Bruijn graph $B(d,3)$ consist of all strings of length $3$, taken from an alphabet of size $d$, with edges between words which are distinct substrings of a word of length $4$. We give an inductive characterization of the maximum independent sets of the de Bruijn graphs $B(d,3)$ and for the de Bruijn graph of diameter three with loops removed, for arbitrary alphabet size. We derive a recurrence relation and an exponential generating function for their number. This recurrence allows us to construct exponentially many comma-free codes of length 3 with maximal cardinality.

scholarly journals Closed Forms for Derangement Numbers in Terms of the Hessenberg Determinants

2016 ◽  
Author(s):  
Feng Qi ◽  
Jiao-Lian Zhao ◽  
Bai-Ni Guo
Keyword(s):  
Recurrence Relation ◽  
Generating Function ◽  
Higher Order ◽  
Order Derivative ◽  
Exponential Generating Function ◽  
Higher Order Derivative

In the paper, the authors find closed forms for derangement numbers in terms of the Hessenberg determinants, discover a recurrence relation of derangement numbers, present a formula for any higher order derivative of the exponential generating function of derangement numbers, and compute some related Hessenberg and tridiagonal determinants.

scholarly journals Weakly directed self-avoiding walks

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Axel Bacher ◽  
Mireille Bousquet-Mélou
Keyword(s):  
Generating Function ◽  
Square Lattice ◽  
Growth Constant ◽  
Complex Singularity ◽  
Singularity Structure ◽  
New Family ◽  
End Distance ◽  
International Audience ◽  
Directed Walks ◽  
Self Avoiding Walks

International audience We define a new family of self-avoiding walks (SAW) on the square lattice, called $\textit{weakly directed walks}$. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating function. This series has a complex singularity structure and in particular, is not D-finite. The growth constant is approximately 2.54 and is thus larger than that of all natural families of SAW enumerated so far (but smaller than that of general SAW, which is about 2.64). We also prove that the end-to-end distance of weakly directed walks grows linearly. Finally, we study a diagonal variant of this model. Nous définissons une nouvelle famille de chemins auto-évitants (CAE) sur le réseau carré, appelés $\textit{chemins faiblement dirigés}$. Ces chemins ont une caractérisation simple en termes des ponts irréductibles qui les composent. Nous déterminons leur série génératrice. Cette série a une structure de singularité complexe et n'est en particulier pas D-finie. La constante de croissance est environ 2,54, ce qui est supérieur à toutes les familles naturelles de SAW étudiées jusqu'à présent, mais inférieur aux CAE généraux (dont la constante est environ 2,64). Nous prouvons également que la distance moyenne entre les extrémités du chemin croît linéairement. Enfin, nous étudions une variante diagonale du modèle.

Sign in / Sign up

Export Citation Format

Share Document