相关论文: Restricted set of patterns, continued fractions, a…

We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator…

We find Stieltjes-type and Jacobi-type continued fractions for some "master polynomials" that enumerate permutations, set partitions or perfect matchings with a large (sometimes infinite) number of simultaneous statistics. Our results…

A D-permutation is a permutation of $[2n]$ satisfying $2k-1 \le \sigma(2k-1)$ and $2k \ge \sigma(2k)$ for all $k$; they provide a combinatorial model for the Genocchi and median Genocchi numbers. We find Stieltjes-type and Thron-type…

We give continued fraction expansions of the generating functions of Bernoulli numbers, Cauchy numbers, Euler numbers, harmonic numbers, and their generalized or related numbers. In particular, we focus on explicit forms of the convergents…

We study a subset of permutations, where entries are restricted to having the same remainder as the index, modulo some integer $k \geq 2$. We show that when also imposing the classical 132- or 213-avoidance restriction on the permutations,…

In a partially ordered semigroup with the duality (or polarity) transform, it is possible to define a generalisation of continued fractions. General sufficient conditions for convergence of continued fractions with deterministic terms are…

We study the longest increasing subsequence problem for random permutations avoiding the pattern $312$ and another pattern $\tau$ under the uniform probability distribution. We determine the exact and asymptotic formulas for the average…

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

A 321-k-gon-avoiding permutation pi avoids 321 and the following four patterns: k(k+2)(k+3)...(2k-1)1(2k)23...(k+1), k(k+2)(k+3)...(2k-1)(2k)123...(k+1), (k+1)(k+2)(k+3)...(2k-1)1(2k)23...k, (k+1)(k+2)(k+3)...(2k-1)(2k)123...k. The…

We propose a new method of calculation of generating functions of Chebyshev polynomials in several variables associated with root systems of simple Lie algebras. We obtain the generating functions of the polynomials in two variables…

Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…

Let $S_n$ and $S_{n,k}$ be, respectively, the number of subsets and $k$-subsets of $\mathbb{N}_n=\{1,\ldots,n\}$ such that no two subset elements differ by an element of the set $\mathcal{Q}$, the largest element of which is $q$. We prove a…

In this paper, we consider cyclic permutations that avoid the monotone decreasing permutation $k(k-1)\ldots 21$, whose cycle also demonstrates some pattern avoidance. If the cycle is written in standard form with 1 appearing at the…

Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary…

We sum multivariate generating functions composed of products of Chebyshev polynomials of the first and the second kind. That is, we find closed forms of expressions of the type $\sum_{j\geq0}\rho^{j}\prod_{m=1}^{k}T_{j+t_{m}}%…

Let $\mathbb{F}_q$ be a finite field with $q=p^n$ elements. In this paper, we study the number of solutions of equations of the form $a_1 x_1^{d_1}+\dots+a_s x_s^{d_s}=b$ with $x_i\in\mathbb{F}_{p^{t_i}}$, where $b\in\mathbb{F}_q$ and…

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties…

We derive an explicit formula for a restricted partition function P_n^m(s) with constraints making use of known expression for a restricted partition function W_m(s) without constraints

Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called Sylvester waves) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…