中文
相关论文

相关论文: Restricted permutations and Chebyshev polynomials

200 篇论文

We describe several families of permutation polynomials obtained using functions with linear translators.

数论 · 数学 2009-05-08 Gohar M. Kyureghyan

We introduce a new natural notion of convergence for permutations at any specified scale, in terms of the density of patterns of restricted width. In this setting we prove that limits may be chosen independently at a countably infinite…

组合数学 · 数学 2021-10-20 David Bevan

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,…

组合数学 · 数学 2023-10-04 Per Alexandersson , Samuel Asefa Fufa , Frether Getachew , Dun Qiu

We study the solution set to multivariate Chebyshev approximation problem, focussing on the ill-posed case when the uniqueness of solutions can not be established via strict polynomial separation. We obtain an upper bound on the dimension…

最优化与控制 · 数学 2019-09-02 Vera Roshchina , Nadia Sukhorukova , Julien Ugon

In this paper we evaluate Chebyshev polynomials of the second-kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly…

表示论 · 数学 2010-10-20 Karin Erdmann , Sibylle Schroll

We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…

数论 · 数学 2013-07-24 Igor E. Pritsker

In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…

计算复杂性 · 计算机科学 2013-09-10 Pascal Giorgi

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the…

数论 · 数学 2024-05-01 Mircea Cimpoeas

We show how polynomial mappings of degree k from a union of disjoint intervals onto [-1,1] generate a countable number of special cases of a certain generalization of the Chebyshev Polynomials. We also derive a new expression for these…

经典分析与常微分方程 · 数学 2007-05-23 Y. Chen , J. C. Griffin , M. E. H. Ismail

Let $S_n$ denote the symmetric group on $\{1,2,\ldots,n\}$. For two permutations $u, v\in S_n$ such that $u\leq v$ in the Bruhat order, let $R_{u,v}(q)$ and $\R_{u,v}(q)$ denote the Kazhdan-Lusztig $R$-polynomial and $\R$-polynomial,…

组合数学 · 数学 2013-12-10 William Y. C. Chen , Neil J. Y. Fan , Peter L. Guo , Michael X. X. Zhong

At finite N the number of restricted Schur polynomials is greater than or equal to the number of generalized restricted Schur polynomials. In this note we study this discrepancy and explain its origin. We conclude that, for quiver gauge…

高能物理 - 理论 · 物理学 2014-06-11 Robert de Mello Koch , Rocky Kreyfelt , Nkululeko Nokwara

In this work, an expansion of Guessab-Schmeisser two points formula for n-times differentiable functions via Fink type identity is established. Generalization of the main result for harmonic sequence of polynomials is established. Several…

经典分析与常微分方程 · 数学 2017-03-07 Mohammad W. Alomari

We consider the problem of finding the set of permutations $r_j$ of $\{1,\cdots , n\}$ such that $\sum_{i=1}^n \prod_{j=1}^k r_j(i)$ is maximized or minimized. While the set of permutations maximizing this value are easily determined,…

组合数学 · 数学 2020-03-03 Chai Wah Wu

We consider $\hat{sl_2}$ spaces of coinvariants with respect to two kinds of ideals of the enveloping algebra $U(sl_2\otimes\C[t])$. The first one is generated by $sl_2\otimes t^N$, and the second one is generated by $e\otimes P(t),…

量子代数 · 数学 2015-06-26 B. Feigin , M. Jimbo , S. Loktev , T. Miwa

We find an explicit combinatorial interpretation of the coefficients of Kerov character polynomials which express the value of normalized irreducible characters of the symmetric groups S(n) in terms of free cumulants R_2,R_3,... of the…

组合数学 · 数学 2011-03-22 Maciej Dołega , Valentin Féray , Piotr Sniady

} The main goal of this note is to provide new, mostly multidimensional densities, compactly supported and list many of its properties that enable effective calculations. The idea of obtaining such densities is firstly to build some…

经典分析与常微分方程 · 数学 2018-08-08 Paweł J. Szabłowski

In this paper, we study the relationship among left peaks, interior peaks and up-down runs of simsun permutations. Properties of the generating polynomials, including the recurrence relation, generating function and real-rootedness are…

组合数学 · 数学 2016-02-02 Shi-Mei Ma , Yeong-Nan Yeh

For $N \in \mathbb{N}$, let $T_{N}$ be the Chebyshev polynomial of the first kind. Expressions for the sequence of numbers $p_{\ell}^{(N)}$, defined as the coefficients in the expansion of $1/T_{N}(1/z)$, are provided. These coefficients…

概率论 · 数学 2014-02-03 Lin Jiu , Victor H. Moll , C. Vignat

We establish a new extremal property of the classical Chebyshev polynomials in the context of best rank-one approximation of tensors. We also give some necessary conditions for a tensor to be a minimizer of the ratio of spectral and…

代数几何 · 数学 2020-03-12 Andrei Agrachev , Khazhgali Kozhasov , André Uschmajew

Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…

数值分析 · 数学 2024-04-16 Ishmael N. Amartey
‹ 上一页 1 8 9 10 下一页 ›