Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.03479

Higher Order Apostol-Type Poly-Genocchi Polynomials with Parameters a, b and c

Cristina B. Corcino·Roberto B. Corcino
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, a new form of poly-Genocchi polynomials is defined by means of poly-logarithm, namely, the Apostol-type poly-Genocchi polynomials of higher order with parameters a, b and c. Several properties of these polynomials are established including some recurrence relations and explicit formulas, which express these higher order Apostol-type poly-Genocchi polynomials in terms of Stirling numbers of the second kind, Apostol-type Bernoulli and Frobenius polynomials of higher order. Moreover, certain differential identity is obtained that leads this new form of poly-Genocchi polynomials to be classified as Appell polynomials and, consequently, draw more properties using some theorems on Appell polynomials. Furthermore, a symmetrized generalization of this new form of poly-Genocchi polynomials is introduced that possesses a double generating function. Finally, the type 2 Apostol-poly-Genocchi polynomials with parameters a, b and c are defined using the concept of polyexponential function and several identities are derived, two of which show the connections of these polynomials with Stirling numbers of the first kind and the type 2 Apostol-type poly-Bernoulli polynomials.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristina B. Corcino, Roberto B. Corcino. 2020-09-08. Higher Order Apostol-Type Poly-Genocchi Polynomials with Parameters a, b and c. https://arxiv.org/abs/2009.03479

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Maximal number of mixed Nash equilibria in generic games where each player has two pure strategies

The number of Nash equilibria of the mixed extension of a generic finite game in normal form is finite and odd. This raises the question how large the number can be, depending on the number of players and the numbers of their pure strategies. Here we present a lower bound for the maximal possible number in the case of m-player games where each player has two pure strategies. It is surprisingly close to a known upper bound.

math.CO↗
arXiv2026

Simultaneous avoidance of length-4 patterns in ascent sequences

Ascent sequences form a central class of combinatorial objects, as they are in bijection with several important families such as (2+2)-free posets, Stoimenow matchings, and other Fishburn objects, and are enumerated by the Fishburn numbers. We study pattern avoidance in ascent sequences for the five patterns of length 4: $0101$, $0102$, $0112$, $0120$, and $0121$. These patterns arise naturally from recent work on pattern avoidance in related families of Fishburn objects, including Stoimenow matchings and (2+2)-free posets. We enumerate ascent sequences avoiding any subset of these patterns, with the exception of the sets $\{0120\}$, $\{0121\}$, and $\{0120,0121\}$, for which the enumeration remains open. Our results reveal that the corresponding avoidance classes fall into $16$ Wilf equivalence classes and exhibit a wide range of enumerative behaviour, including connections to classical sequences such as the Catalan and Fibonacci numbers, as well as polynomial formulas and rational generating functions; several of the sequences we obtain appear to be new. Our methods combine structural decompositions with generating-tree techniques and, in several cases, rely on reductions to shorter patterns via restricted growth functions. This work contributes to the broader study of pattern avoidance across Fishburn families and highlights further connections between ascent sequences and other combinatorial structures.

math.CO↗