English
Related papers

Related papers: A factorization method for q-Racah polynomials

200 papers

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

Using a general $q$-summation formula, we derive a generating function for the $q$-Hahn polynomials, which is used to give a complete proof of the orthogonality relation for the $q$-Hahn polynomials. A new proof of the orthogonality…

Combinatorics · Mathematics 2018-05-16 Zhi-Guo Liu

The notion of multivariate $P$- and $Q$-polynomial association scheme has been introduced recently, generalizing the well-known univariate case. Numerous examples of such association schemes have already been exhibited. In particular, it…

Combinatorics · Mathematics 2023-06-12 Nicolas Crampe , Luc Vinet , Meri Zaimi , Xiaohong Zhang

We discuss the problem of factorisation of the symmetric Macdonald polynomials and present the obtained results for the cases of 2 and 3 variables.

q-alg · Mathematics 2015-11-13 Vadim B. Kuznetsov , Evgueni K. Sklyanin

We obtain new explicit formulas for the recurrence coefficients of the q-orthogonal polynomial sequences in a class that extends the q-Askey scheme. Our formulas express the recurrence coefficients in terms of four parameters that determine…

Classical Analysis and ODEs · Mathematics 2016-02-29 Luis Verde-Star

We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of…

Rings and Algebras · Mathematics 2015-05-28 Jose Gomez-Torrecillas , F. J. Lobillo , Gabriel Navarro

Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…

Symbolic Computation · Computer Science 2025-02-26 Alexander Demin , Joris van der Hoeven

We introduce a certain discrete probability distribution $P_{n,m,k,l;q}$ having non-negative integer parameters $n,m,k,l$ and quantum parameter $q$ which arises from a zonal spherical function of the Grassmannian over the finite field…

Representation Theory · Mathematics 2025-11-18 Masahito Hayashi , Akihito Hora , Shintarou Yanagida

In this paper we propose a new version of differential transform method (we shall call this method as $\alpha$-parameterized differential transform method), which differs from the traditional differential transform method in calculating…

Classical Analysis and ODEs · Mathematics 2015-07-15 K. Aydemir , O. Sh. Mukhtarov

We investigate on some Appel-type orthogonal polynomial sequences on q-quadratic lattices and we provide some entire new characterizations of the Al-Salam Chihara polynomials (including the Rogers q-Hermite polynomials). The corresponding…

Classical Analysis and ODEs · Mathematics 2023-04-11 D. Mbouna , A. Suzuki

We present an operator approach to Rogers-type formulas and Mehler's formulas for the Al-Salam-Carlitz polynomials $U_n(x,y,a;q)$. By using the q-exponential operator, we obtain a Rogers-type formula which leads to a linearization formula.…

Classical Analysis and ODEs · Mathematics 2015-05-14 William Y. C. Chen , Husam L. Saad , Lisa H. Sun

Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…

Numerical Analysis · Mathematics 2021-03-09 Wenyuan Wu , Zhonggang Zeng

We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…

Quantum Physics · Physics 2012-10-25 S. Wölk , W. Merkel , W. P. Schleich , I. Sh. Averbukh , B. Girard

This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…

Number Theory · Mathematics 2022-07-26 Michael Filaseta

The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…

Number Theory · Mathematics 2024-02-09 Anna-Maurin Graner

Fractional $q$-extensions of some classical $q$-orthogonal polynomials are introduced and some of the main properties of the new defined functions are given. Next, a fractional $q$-difference equation of Gauss type is introduced and solved…

Classical Analysis and ODEs · Mathematics 2016-12-28 P. Njionou Sadjang , S. Mboutngam

New bispectral orthogonal polynomials are obtained from an unconventional truncation of the Askey-Wilson polynomials. In the limit $q \to 1$, they reduce to the para-Racah polynomials which are orthogonal with respect to a quadratic…

Classical Analysis and ODEs · Mathematics 2017-08-14 Jean-Michel Lemay , Luc Vinet , Alexei Zhedanov

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

Number Theory · Mathematics 2007-05-23 Roland Bacher

We show a method for constructing a polynomial interpolating roots' multiplicities of another polynomial, that does not use companion matrices. This leads to a modification to Guersenzvaig--Szechtman square-free decomposition algorithm that…

Symbolic Computation · Computer Science 2017-03-20 Przemysław Koprowski

We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…

Combinatorics · Mathematics 2016-02-24 Jan de Gier , Michael Wheeler