Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Some multivariate polynomials for doubled permutations
View through CrossRef
<p style='text-indent:20px;'>Flajolet and Françon [European. J. Combin. 10 (1989) 235-241] gave a combinatorial interpretation for the Taylor coefficients of the Jacobian elliptic functions in terms of doubled permutations. We show that a multivariable counting of the doubled permutations has also an explicit continued fraction expansion generalizing the continued fraction expansions of Rogers and Stieltjes. The second goal of this paper is to study the expansion of the Taylor coefficients of the generalized Jacobian elliptic functions, which implies the symmetric and unimodal property of the Taylor coefficients of the generalized Jacobian elliptic functions. The main tools are the combinatorial theory of continued fractions due to Flajolet and bijections due to Françon-Viennot, Foata-Zeilberger and Clarke-Steingrímsson-Zeng.</p>
Title: Some multivariate polynomials for doubled permutations
Description:
<p style='text-indent:20px;'>Flajolet and Françon [European.
J.
Combin.
10 (1989) 235-241] gave a combinatorial interpretation for the Taylor coefficients of the Jacobian elliptic functions in terms of doubled permutations.
We show that a multivariable counting of the doubled permutations has also an explicit continued fraction expansion generalizing the continued fraction expansions of Rogers and Stieltjes.
The second goal of this paper is to study the expansion of the Taylor coefficients of the generalized Jacobian elliptic functions, which implies the symmetric and unimodal property of the Taylor coefficients of the generalized Jacobian elliptic functions.
The main tools are the combinatorial theory of continued fractions due to Flajolet and bijections due to Françon-Viennot, Foata-Zeilberger and Clarke-Steingrímsson-Zeng.
</p>.
Related Results
METHODS FOR CONSTRUCTING PERMUTATIONS OF AN ARBITRARY FINITE FIELD AND THEIR LINEAR CHARACTERISTICS
METHODS FOR CONSTRUCTING PERMUTATIONS OF AN ARBITRARY FINITE FIELD AND THEIR LINEAR CHARACTERISTICS
Permutations in a finite field (bijective transformations) are actively studied in many applications, including in information security theory. Permutations are often used as eleme...
Truncated-Exponential-Based Appell-Type Changhee Polynomials
Truncated-Exponential-Based Appell-Type Changhee Polynomials
The truncated exponential polynomials em(x) (1), their extensions, and certain newly-introduced polynomials which combine the truncated exponential polynomials with other known pol...
Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function
Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function
The aim of this paper is to construct generating functions for new families of combinatorial numbers and polynomials. By using these generating functions with their functional and ...
Krein–Sobolev Orthogonal Polynomials II
Krein–Sobolev Orthogonal Polynomials II
In a recent paper, Littlejohn and Quintero studied the orthogonal polynomials {Kn}n=0∞—which they named Krein–Sobolev polynomials—that are orthogonal in the classical Sobolev space...
On λ-Changhee–Hermite polynomials
On λ-Changhee–Hermite polynomials
Abstract
In this paper, we introduce a new class of
λ-analogues of the Changhee–Hermite polynomials and
generalized Gould–Hopper–Appell type λ-Changhee polynomials,
...
The locally crooked permutations and the complete permutations over F2n
The locally crooked permutations and the complete permutations over F2n
Abstract
The crooked function has a fixed point $0$ and all its difference set is the complement of the hyperplane. In this paper, we proposed the locally crooked permutati...
Distribution of Segment Lengths in Genome Rearrangements
Distribution of Segment Lengths in Genome Rearrangements
The study of gene orders for constructing phylogenetic trees was introduced by Dobzhansky and Sturtevant in 1938. Different genomes may have homologous genes arranged in different...
A lower bound for general t-stack sortable permutations via pattern avoidance
A lower bound for general t-stack sortable permutations via pattern avoidance
There is no formula for general t-stack sortable permutations. Thus, we attempt to study them by establishing lower and upper bounds. Permutations that avoid certain pattern sets p...