scholarly journals New realizations of algebras of the Askey–Wilson type in terms of Lie and quantum algebras

2020 ◽  
pp. 2150002
Author(s):  
Nicolas Crampé ◽  
Dounia Shaaban Kabakibo ◽  
Luc Vinet

The Askey–Wilson algebra is realized in terms of the elements of the quantum algebras [Formula: see text] or [Formula: see text]. A new realization of the Racah algebra in terms of the Lie algebras [Formula: see text] or [Formula: see text] is also given. Details for different specializations are provided. The advantage of these new realizations is that one generator of the Askey–Wilson (or Racah) algebra becomes diagonal in the usual representation of the quantum algebras whereas the second one is tridiagonal. This allows us to recover easily the recurrence relations of the associated orthogonal polynomials of the Askey scheme. These realizations involve rational functions of the Cartan generator of the quantum algebras, where they are linear with respect to the other generators and depend on the Casimir element of the quantum algebras.

Acta Numerica ◽  
1996 ◽  
Vol 5 ◽  
pp. 45-119 ◽  
Author(s):  
Walter Gautschi

We give examples of problem areas in interpolation, approximation, and quadrature, that call for orthogonal polynomials not of the classical kind. We then discuss numerical methods of computing the respective Gauss-type quadrature rules and orthogonal polynomials. The basic task is to compute the coefficients in the three-term recurrence relation for the orthogonal polynomials. This can be done by methods relying either on moment information or on discretization procedures. The effect on the recurrence coefficients of multiplying the weight function by a rational function is also discussed. Similar methods are applicable to computing Sobolev orthogonal polynomials, although their recurrence relations are more complicated. The paper concludes with a brief account of available software.


2013 ◽  
Vol 479-480 ◽  
pp. 855-860
Author(s):  
Chii Huei Yu

This paper uses the mathematical software Maple as the auxiliary tool to study the differential problem of four types of rational functions. We can obtain the closed forms of any order derivatives of these rational functions by using binomial theorem. On the other hand, we propose four examples to do calculation practically. The research methods adopted in this study involved finding solutions through manual calculations and verifying these solutions by using Maple. This type of research method not only allows the discovery of calculation errors, but also helps modify the original directions of thinking from manual and Maple calculations. For this reason, Maple provides insights and guidance regarding problem-solving methods.


Symmetry ◽  
2018 ◽  
Vol 10 (8) ◽  
pp. 354 ◽  
Author(s):  
Tomasz Czyżycki ◽  
Jiří Hrivnák ◽  
Jiří Patera

The generating functions of fourteen families of generalized Chebyshev polynomials related to rank two Lie algebras A 2 , C 2 and G 2 are explicitly developed. There exist two classes of the orthogonal polynomials corresponding to the symmetric and antisymmetric orbit functions of each rank two algebra. The Lie algebras G 2 and C 2 admit two additional polynomial collections arising from their hybrid character functions. The admissible shift of the weight lattice permits the construction of a further four shifted polynomial classes of C 2 and directly generalizes formation of the classical univariate Chebyshev polynomials of the third and fourth kinds. Explicit evaluating formulas for each polynomial family are derived and linked to the incomplete exponential Bell polynomials.


2021 ◽  
Vol 38 (1) ◽  
pp. 149-158
Author(s):  
MIRCEA MERCA ◽  

In 1963, Peter Hagis, Jr. provided a Hardy-Ramanujan-Rademacher-type convergent series that can be used to compute an isolated value of the partition function $Q(n)$ which counts partitions of $n$ into distinct parts. Computing $Q(n)$ by this method requires arithmetic with very high-precision approximate real numbers and it is complicated. In this paper, we investigate new connections between partitions into distinct parts and overpartitions and obtain a surprising recurrence relation for the number of partitions of $n$ into distinct parts. By particularization of this relation, we derive two different linear recurrence relations for the partition function $Q(n)$. One of them involves the thrice square numbers and the other involves the generalized octagonal numbers. The recurrence relation involving the thrice square numbers provide a simple and fast computation of the value of $Q(n)$. This method uses only (large) integer arithmetic and it is simpler to program. Infinite families of linear inequalities involving partitions into distinct parts and overpartitions are introduced in this context.


2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Xia Dong ◽  
Tiecheng Xia ◽  
Desheng Li

By use of the loop algebraG-~, integrable coupling of C-KdV hierarchy and its bi-Hamiltonian structures are obtained by Tu scheme and the quadratic-form identity. The method can be used to produce the integrable coupling and its Hamiltonian structures to the other integrable systems.


Sign in / Sign up

Export Citation Format

Share Document