اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSmooth words and Chebyshev polynomials
168
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A word $sigma=sigma_1...sigma_n$ over the alphabet $[k]={1,2,...,k}$ is said to be {em smooth} if there are no two adjacent letters with difference greater than 1. A word $sigma$ is said to be {em smooth cyclic} if it is a smooth word and in addition satisfies $|sigma_n-sigma_1|le 1$. We find the explicit generating functions for the number of smooth words and cyclic smooth words in $[k]^n$, in terms of {it Chebyshev polynomials of the second kind}. Additionally, we find explicit formula for the numbers themselves, as trigonometric sums. These lead to immediate asymptotic corollaries. We also enumerate smooth necklaces, which are cyclic smooth words that are not equivalent up to rotation.
قيم البحث
اقرأ أيضاً
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated weights as well as an arbitrary `background weight. Our CT theorem, like Viennots lattice
path theorem from which it is derived primarily by a change of variable lemma, is expressed in terms of orthogonal polynomials which in our applications of interest often turn out to be non-classical. Hence we also present an efficient method for finding explicit closed form polynomial expressions for these non-classical orthogonal polynomials. Our method for finding the closed form polynomial expressions relies on simple combinatorial manipulations of Viennots diagrammatic representation for orthogonal polynomials. In the course of the paper we also provide a new proof of Viennots original orthogonal polynomial lattice path theorem. The new proof is of interest because it uses diagonalization of the transfer matrix, but gets around difficulties that have arisen in past attempts to use this approach. In particular we show how to sum over a set of implicitly defined zeros of a given orthogonal polynomial, either by using properties of residues or by using partial fractions. We conclude by applying the method to two lattice path problems important in the study of polymer physics as models of steric stabilization and sensitized flocculation.
In the present paper we find a simple algorithm for counting Jacobian group of the generalized Petersen graph GP(n,k). Also, we obtain a closed formula for the number of spanning trees of this graph in terms of Chebyshev polynomials.
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 generalized Ch
ebyshev Polynomials for any number of disjoint intervals from which the coefficients of x^n can be found explicitly in terms of the end points and the recurrence coefficients. We find that this representation is useful for specializing to the polynomial mapping cases for small k where we will have algebraic expressions for the recurrence coefficients in terms of the end points. We study in detail certain special cases of the polynomials for small k and prove a theorem concerning the location of the zeroes of the polynomials. We also derive an expression for the discriminant for the case of two intervals that is valid for any configuration of the end points.
Given $n$ polynomials $p_1, dots, p_n$ of degree at most $n$ with $|p_i|_infty le 1$ for $i in [n]$, we show there exist signs $x_1, dots, x_n in {-1,1}$ so that [Big|sum_{i=1}^n x_i p_iBig|_infty < 30sqrt{n}, ] where $|p|_infty := sup_{|x| le 1} |p(
x)|$. This result extends the Rudin-Shapiro sequence, which gives an upper bound of $O(sqrt{n})$ for the Chebyshev polynomials $T_1, dots, T_n$, and can be seen as a polynomial analogue of Spencers six standard deviations theorem.
Orbit functions of a simple Lie group/Lie algebra L consist of exponential functions summed up over the Weyl group of L. They are labeled by the highest weights of irreducible finite dimensional representations of L. They are of three types: C-, S- a
nd E-functions. Orbit functions of the Lie algebras An, or equivalently, of the Lie group SU(n+1), are considered. First, orbit functions in two different bases - one orthonormal, the other given by the simple roots of SU(n) - are written using the isomorphism of the permutation group of n elements and the Weyl group of SU(n). Secondly, it is demonstrated that there is a one-to-one correspondence between classical Chebyshev polynomials of the first and second kind, and C- and $S$-functions of the simple Lie group SU(2). It is then shown that the well-known orbit functions of SU(n) are straightforward generalizations of Chebyshev polynomials to n-1 variables. Properties of the orbit functions provide a wealth of properties of the polynomials. Finally, multivariate exponential functions are considered, and their connection with orbit functions of SU(n) is established.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
