Related papers: Hopping from Chebyshev polynomials to permutation …

In this paper we study the generating polynomials obtained by enumerating signed simsun permutations by number of the descents. Properties of the polynomials, including the recurrence relations and generating functions are studied.

Quantum generative modeling is emerging as a powerful tool for advancing data analysis in high-energy physics, where complex multivariate distributions are common. However, efficiently learning and sampling these distributions remains…

In this paper we use a contour integral method to derive a generating function in the form of a double series involving the product of two Chebyshev polynomials over generalized independent indices expressed in terms of the incomplete gamma…

We examine the distribution and popularity of different parameters (such as the number of descents, runs, valleys, peaks, right-to-left minima, and more) on the sets of increasing and flattened permutations. For each parameter, we provide…

Using notions of composita and composition of generating functions we obtain explicit formulas for Chebyshev polynomials, Legendre polynomials, Gegenbauer polynomials, Associated Laguerre polynomials, Stirling polynomials, Abel polynomials,…

We construct one and two parameter deformations of the two dimensional Chebyshev polynomials with simple recurrence coefficients, following the algorithm in [3]. Using inverse scattering techniques, we compute the corresponding…

We prove a combinatorial formula for the alternating descent polynomials of type A and B. Combining with Josuat-Verg\`es' combinatorial interpretation for Hoffman's derivative polynomials for tangent and secant functions, we obtain a…

We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…

The generating polynomial of permutations of size $n$, counted by the number of alternating runs, has a root at $-1$ of multiplicity $\lfloor (n-2)/2 \rfloor$ for all $n \ge 2$. This result can be derived by combining the David--Barton…

Since the early work of Richard Stanley, it has been observed that several permutation statistics have a remarkable property with respect to shuffles of permutations. We formalize this notion of a shuffle-compatible permutation statistic…

In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recently, we introduced Stirling permutation code and provided…

One of the most central result in combinatorics says that the descent statistic and the excedance statistic are equidistribued over the symmetric group. As a continuation of the work of Shareshian-Wachs (Adv. Math., 225(6) (2010),…

We provide combinatorial interpretation for the $\gamma$-coefficients of the basic Eulerian polynomials that enumerate permutations by the excedance statistic and the major index as well as the corresponding $\gamma$-coefficients for…

We investigate the problem of numerical differentiation of bivariate functions from weighted Wiener classes using Chebyshev polynomial expansions. We develop and analyze a new version of the truncation method based on Chebyshev polynomials…

Carlitz and Scoville in 1973 considered a four variable polynomial that enumerates permutations in $\mathfrak{S}_n$ with respect to the parity of its descents and ascents. In recent work, Pan and Zeng proved a $q$-analogue of…

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial $Y = 1 + \xi_1 + \xi_1 \xi_2 + \xi_1 \xi_2 \xi_3 + ...$ of independent and identically distributed non-negative random variables. It…

For a L\'evy process $\xi=(\xi_t)_{t\geq0}$ drifting to $-\infty$, we define the so-called exponential functional as follows \[{\rm{I}}_{\xi}=\int_0^{\infty}e^{\xi_t} dt.\] Under mild conditions on $\xi$, we show that the following…

In this paper, we focus on the enumeration of permutations by number of cyclic occurrence of peaks and valleys. We find several recurrence relations involving the number of permutations with a prescribed number of cyclic peaks, cyclic…

This note is about the observation that the various transition formulas between bases of trigonometric polynomials can be expressed in terms binomial coefficients. More specifically, we write the entries of the Chebyshev matrices $ T$ and $…

In his paper of 2000, Kenneth B. Stolarsky made various observations and conjectures about discriminants and generating functions of certain types of Chebyshev-like polynomials. We prove several of these conjectures. One of our proofs…