scholarly journals Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials

10.37236/1679 ◽  
2003 ◽  
Vol 9 (2) ◽  
Author(s):  
Eric S. Egge ◽  
Toufik Mansour
Keyword(s):  
Chebyshev Polynomials ◽  
Generating Functions ◽  
Continued Fractions

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of some of these results for permutations which avoid 1243 and 2143. Using tools developed to prove these analogues, we give enumerations and generating functions for permutations which avoid 1243, 2143, and certain additional patterns. We also give generating functions for permutations which avoid 1243 and 2143 and contain certain additional patterns exactly once. In all cases we express these generating functions in terms of Chebyshev polynomials of the second kind.

scholarly journals Restricted permutations, continued fractions, and Chebyshev polynomials

10.37236/1495 ◽  
2000 ◽  
Vol 7 (1) ◽  
Author(s):  
Toufik Mansour ◽  
Alek Vainshtein
Keyword(s):  
Explicit Expression ◽  
Chebyshev Polynomials ◽  
Generating Functions ◽  
Continued Fractions ◽  
Continued Fraction ◽  
Restricted Permutations

Let $f_n^r(k)$ be the number of 132-avoiding permutations on $n$ letters that contain exactly $r$ occurrences of $12\dots k$, and let $F_r(x;k)$ and $F(x,y;k)$ be the generating functions defined by $F_r(x;k)=\sum_{n\ge 0} f_n^r(k)x^n$ and $F(x,y;k)=\sum_{r\ge 0}F_r(x;k)y^r$. We find an explicit expression for $F(x,y;k)$ in the form of a continued fraction. This allows us to express $F_r(x;k)$ for $1\le r\le k$ via Chebyshev polynomials of the second kind.

scholarly journals Generating Functions for Orthogonal Polynomials of A2, C2 and G2

Symmetry ◽  
2018 ◽  
Vol 10 (8) ◽  
pp. 354 ◽  
Author(s):  
Tomasz Czyżycki ◽  
Jiří Hrivnák ◽  
Jiří Patera
Keyword(s):  
Orthogonal Polynomials ◽  
Lie Algebras ◽  
Chebyshev Polynomials ◽  
Generating Functions ◽  
Bell Polynomials ◽  
The Third ◽  
Weight Lattice ◽  
Hybrid Character ◽  
Polynomial Family

The generating functions of fourteen families of generalized Chebyshev polynomials related to rank two Lie algebras A 2 , C 2 and G 2 are explicitly developed. There exist two classes of the orthogonal polynomials corresponding to the symmetric and antisymmetric orbit functions of each rank two algebra. The Lie algebras G 2 and C 2 admit two additional polynomial collections arising from their hybrid character functions. The admissible shift of the weight lattice permits the construction of a further four shifted polynomial classes of C 2 and directly generalizes formation of the classical univariate Chebyshev polynomials of the third and fourth kinds. Explicit evaluating formulas for each polynomial family are derived and linked to the incomplete exponential Bell polynomials.

scholarly journals On a Class of Distributions Stable Under Random Summation

2012 ◽  
Vol 49 (02) ◽  
pp. 303-318 ◽  
Author(s):  
L. B. Klebanov ◽  
A. V. Kakosyan ◽  
S. T. Rachev ◽  
G. Temnov
Keyword(s):  
Normal Distribution ◽  
Generating Function ◽  
Chebyshev Polynomials ◽  
Generating Functions ◽  
Analytic Functions ◽  
Random Variable ◽  
Random Summation ◽  
The Stability ◽  
Rational Generating Functions ◽  
Family Of Distributions

We study a family of distributions that satisfy the stability-under-addition property, provided that the number ν of random variables in a sum is also a random variable. We call the corresponding property ν-stability and investigate the situation when the semigroup generated by the generating function of ν is commutative. Using results from the theory of iterations of analytic functions, we describe ν-stable distributions generated by summations with rational generating functions. A new case in this class of distributions arises when generating functions are linked with Chebyshev polynomials. The analogue of normal distribution corresponds to the hyperbolic secant distribution.

Fibonacci and Lucas polynomials

1981 ◽  
Vol 90 (3) ◽  
pp. 385-387 ◽  
Author(s):  
B. G. S. Doman ◽  
J. K. Williams
Keyword(s):  
Difference Equation ◽  
Chebyshev Polynomials ◽  
Generating Functions ◽  
Hypergeometric Functions ◽  
Linear Difference Equation ◽  
Second Order ◽  
Lucas Numbers ◽  
Order Linear ◽  
Lucas Polynomials ◽  
Fibonacci And Lucas Numbers

The Fibonacci and Lucas polynomials Fn(z) and Ln(z) are denned. These reduce to the familiar Fibonacci and Lucas numbers when z = 1. The polynomials are shown to satisfy a second order linear difference equation. Generating functions are derived, and also various simple identities, and relations with hypergeometric functions, Gegenbauer and Chebyshev polynomials.

ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE

2002 ◽  
Vol 16 (09) ◽  
pp. 1269-1299 ◽  
Author(s):  
A. C. OPPENHEIM ◽  
R. BRAK ◽  
A. L. OWCZAREK
Keyword(s):  
Triangular Lattice ◽  
Generating Functions ◽  
Continued Fractions ◽  
Functional Equations ◽  
Square Lattice ◽  
Combinatorial Objects ◽  
Special Cases ◽  
Explicit Formulae ◽  
Directed Walks ◽  
Marked Area

We present results for the generating functions of single fully-directed walks on the triangular lattice, enumerated according to each type of step and weighted proportional to the area between the walk and the surface of a half-plane (wall), and the number of contacts made with the wall. We also give explicit formulae for total area generating functions, that is when the area is summed over all configurations with a given perimeter, and the generating function of the moments of heights above the wall (the first of which is the total area). These results generalise and summarise nearly all known results on the square lattice: all the square lattice results can be obtaining by setting one of the step weights to zero. Our results also contain as special cases those that already exist for the triangular lattice. In deriving some of the new results we utilise the Enumerating Combinatorial Objects (ECO) and marked area methods of combinatorics for obtaining functional equations in the most general cases. In several cases we give our results both in terms of ratios of infinite q-series and as continued fractions.

scholarly journals Generating functions for two-variable polynomials related to a family of Fibonacci type polynomials and numbers

Filomat ◽  
2016 ◽  
Vol 30 (4) ◽  
pp. 969-975 ◽  
Author(s):  
Gulsah Ozdemir ◽  
Yilmaz Simsek
Keyword(s):  
Infinite Series ◽  
Chebyshev Polynomials ◽  
Generating Functions ◽  
Functional Equations ◽  
The Other ◽  
The Family

The purpose of this paper is to construct generating functions for the family of the Fibonacci and Jacobsthal polynomials. Using these generating functions and their functional equations, we investigate some properties of these polynomials. We also give relationships between the Fibonacci, Jacobsthal, Chebyshev polynomials and the other well known polynomials. Finally, we give some infinite series applications related to these polynomials and their generating functions.

scholarly journals On the (p,q)–Chebyshev Polynomials and Related Polynomials

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 136 ◽  
Author(s):  
Can Kızılateş ◽  
Naim Tuğlu ◽  
Bayram Çekim
Keyword(s):  
Chebyshev Polynomials ◽  
Generating Functions ◽  
Lucas Polynomials

In this paper, we introduce ( p , q ) –Chebyshev polynomials of the first and second kind that reduces the ( p , q ) –Fibonacci and the ( p , q ) –Lucas polynomials. These polynomials have explicit forms and generating functions are given. Then, derivative properties between these first and second kind polynomials, determinant representations, multilateral and multilinear generating functions are derived.

Sign in / Sign up

Export Citation Format

Share Document