English
Related papers

Related papers: Hopping from Chebyshev polynomials to permutation …

200 papers

In this paper, we find distributions of the left-to-right maxima, right-to-left maxima, left-to-right minima and right-to-left-minima statistics on up-down and down-up permutations of even and odd lengths. For instance, we show that the…

Combinatorics · Mathematics 2024-08-26 Tian Han , Sergey Kitaev , Philip B. Zhang

We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…

Combinatorics · Mathematics 2020-07-06 Marie-Louise Lackner , Alois Panholzer

Based on a determinantal formula for the higher derivative of a quotient of two functions, we first present the determinantal expressions of Eulerian polynomials and Andre polynomials. In particular, we discover that the Euler number…

Combinatorics · Mathematics 2024-12-20 Shi-Mei Ma , Hong Bian , Jun-Ying Liu , Jean Yeh , Yeong-Nan Yeh

In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…

Combinatorics · Mathematics 2013-02-25 Max A. Alekseyev

This paper is concerned with the joint distribution of the number of exterior peaks and the number of proper double descents over permutations on $[n] =\{1,2,\ldots,n\}$. The notion of exterior peaks of a permutation was introduced by…

Combinatorics · Mathematics 2018-01-18 Amy M. Fu

We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which have the property of specializing to enumerators for the joint distribution of the permutation statistics, major index and excedance…

Combinatorics · Mathematics 2008-05-19 John Shareshian , Michelle L. Wachs

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

Combinatorics · Mathematics 2007-11-05 Robert Parviainen

In this paper, we study the discrete-time quantum walks on 1D Chain with the moving and swapping shift operators. We derive analytical solutions for the eigenvalues and eigenstates of the evolution operator $\hat{U}$ using the Chebyshev…

Mathematical Physics · Physics 2014-03-14 Xin-Ping Xu , Xiao-Kun Zhang , Yusuke Ide , Norio Konno

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…

Combinatorics · Mathematics 2015-04-10 Shi-Mei Ma , Yeong-Nan Yeh

Some identities of Chebyshev polynomials are deduced from Waring's formula on symmetric functions. In particular, these formulae generalize some recent results of Grabner and Prodinger.

Combinatorics · Mathematics 2007-05-23 Jiang Zeng , Jin Zhou

In this paper, we introduce the class of $(\beta,\gamma)$-Chebyshev functions and corresponding points, which can be seen as a family of {\it generalized} Chebyshev polynomials and points. For the $(\beta,\gamma)$-Chebyshev functions, we…

Numerical Analysis · Mathematics 2021-11-23 Stefano De Marchi , Giacomo Elefante , Francesco Marchetti

The discrete Chebyshev polynomials $t_n(x,N)$ are orthogonal with respect to a distribution, which is a step function with jumps one unit at the points $x=0,1,\cdots, N-1$, $N$ being a fixed positive integer. By using a double integral…

Complex Variables · Mathematics 2013-03-19 J. H. Pan , Roderick Wong

We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally…

Combinatorics · Mathematics 2019-05-21 Ira M. Gessel

The main aim of this paper is to provide a unified approach to deriving identities for the Bernstein polynomials using a novel generating function. We derive various functional equations and differential equations using this generating…

Classical Analysis and ODEs · Mathematics 2018-11-19 Yilmaz Simsek

Motivated by juggling sequences and bubble sort, we examine permutations on the set {1,2,...,n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive…

Combinatorics · Mathematics 2010-01-18 Fan Chung , Anders Claesson , Mark Dukes , Ron Graham

We show connection between Dyck paths with peaks of bounded height and random walks. The correspondence between a certain class of random walks and such Dyck paths allows us to develop a probabilistic perspective on Chebyshev polynomials.

Combinatorics · Mathematics 2015-10-20 Ewa J. Infeld

Recently, $(\beta,\gamma)$-Chebyshev functions, as well as the corresponding zeros, have been introduced as a generalization of classical Chebyshev polynomials of the first kind and related roots. They consist of a family of orthogonal…

Classical Analysis and ODEs · Mathematics 2023-07-06 Stefano De Marchi , Giacomo Elefante , Francesco Marchetti , Jean-Zacharie Mariethoz

Motivated by the work of Visontai and Dey-Sivasubramanian on the gamma-positivity of some polynomials, we find the commutative property of a pair of Eulerian operators. As an application, we show the bi-gamma-positivity of the descent…

Combinatorics · Mathematics 2022-10-25 Shi-Mei Ma , Hao Qi , Jean Yeh , Yeong-Nan Yeh

The higher derivatives of the tangent and hyperbolic tangent functions are determined. Formulas for the higher derivatives of the inverse tangent and inverse hyperbolic tangent functions as polynomials are stated and proved. Using another…

General Mathematics · Mathematics 2023-01-18 M. J. Kronenburg

In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…

Combinatorics · Mathematics 2017-05-15 Yan Zhuang
‹ Prev 1 4 5 6 7 8 10 Next ›