中文
相关论文

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

200 篇论文

Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…

We give a simple proof of some explicit formulas of periodic continuants by Chebyshev polynomials of the second kind given by Rozsa.

偏微分方程分析 · 数学 2020-09-01 Genki Shibukawa

We introduce a kind of $(p, q, t)$-Catalan numbers of Type A by generalizing the Jacobian type continued fraction formula, we proved that the corresponding expansions could be expressed by the polynomials counting permutations on…

组合数学 · 数学 2023-05-09 Bin Han , Qiongqiong Pan

For permutations avoiding consecutive patterns from a given set, we present a combinatorial formula for the multiplicative inverse of the corresponding exponential generating function. The formula comes from homological algebra…

组合数学 · 数学 2010-02-16 Vladimir Dotsenko , Anton Khoroshkin

Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play…

代数几何 · 数学 2024-01-23 Zaïneb Bel-Afia , Chiara Meroni , Simon Telen

In this paper, we clarified the relationship between continued fractions, determinants, and identities, making it easier to apply these methods systematically in other settings. In particular, we studied finite continued fractions from the…

综合数学 · 数学 2026-04-14 Nikita Kalinin , Takao Komatsu

The even and odd Zernike Polynomials R_n^m(x) can be expanded into sums of even and odd Chebyshev Polynomials T_i(x). This manuscript provides closed forms for the rational expansion coefficients c_{n,m,i} for a set of small 0 <= n-m <= 6…

经典分析与常微分方程 · 数学 2025-11-21 Richard J. Mathar

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

交换代数 · 数学 2013-11-12 Joachim von zur Gathen , Alfredo Viola , Konstantin Ziegler

We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…

概率论 · 数学 2016-05-25 Svante Janson

This paper discusses the permutations that are generated by rotating $k \times k$ blocks of squares in a union of overlapping $k \times (k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the…

组合数学 · 数学 2014-04-24 Ravi Montenegro , David A. Huckaby , Elaine White Harmon

The standard formula for the multi-section of the general linear three-term recurrence relation is simplified in terms of Chebyshev S-polynomials.

组合数学 · 数学 2023-05-09 Gary Detlefs , Wolfdieter Lang

In this paper, we investigate the reconstruction of permutations on {1, 2, ..., n} from betweenness constraints involving the minimum and the maximum element located between t and t+1, for all t=1, 2, ..., n-1. We propose two variants of…

数据结构与算法 · 计算机科学 2014-12-15 Irena Rusu

In this short note, we give simple proofs of several results and conjectures formulated by Stolarsky and Tran concerning generating functions of some families of Chebyshev-like polynomials.

符号计算 · 计算机科学 2013-06-19 Alin Bostan , Bruno Salvy , Khang Tran

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

组合数学 · 数学 2007-06-22 Guo-Niu Han , Guoce Xin

The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs,…

统计方法学 · 统计学 2009-06-18 Roberto Fontana , Giovanni Pistone

We outline an approach to understanding restrictions of polynomial representations of $GL_n(\mathbb{C})$ to $S_n$ by first restricting to $T \rtimes S_n$, the subgroup of $n \times n$ monomial matrices. Using this approach we give a…

表示论 · 数学 2018-04-16 Nate Harman

New finite-dimensional representations of specific polynomial deformations of sl(2,R) are constructed. The corresponding generators can be, in particular, realized through linear differential operators preserving a finite-dimensional…

量子物理 · 物理学 2009-11-10 N. Debergh , J. Ndimubandi , B. Van den Bossche

An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in…

组合数学 · 数学 2023-06-22 Behrouz Zolfaghari , Mehran S. Fallah , Mehdi Sedighi

We study orthogonal polynomials associated with a continued fraction due to Hirschhorn. Hirschhorn's continued fraction contains as special cases the famous Rogers--Ramanujan continued fraction and two of Ramanujan's generalizations. The…

经典分析与常微分方程 · 数学 2022-02-22 Gaurav Bhatnagar , Mourad E. H. Ismail

This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects not covered in the recent book by Kitaev, \emph{Patterns in Permutations and words}. I first survey recent developments on the enumeration…

组合数学 · 数学 2013-01-31 Einar Steingrimsson