Related papers: A factorization method for q-Racah polynomials
In this article we will apply the first- and second-order supersymmetric quantum mechanics to obtain new exactly-solvable real potentials departing from the inverted oscillator potential. This system has some special properties; in…
We prove two new summation formulae of Hall-Littlewood polynomials over partitions into bounded parts and derive some new multiple $q$-identities of Rogers-Ramanujan type.
The exceptional Racah and q-Racah polynomials are constructed. Together with the exceptional Laguerre, Jacobi, Wilson and Askey-Wilson polynomials discovered by the present authors in 2009, they exhaust the generic exceptional orthogonal…
Motivated by many recent constructions of permutation polynomials over $\mathbb{F}_{q^2}$, we study permutation polynomials over $\mathbb{F}_{q^3}$ in terms of their coefficients. Based on the multivariate method and resultant elimination,…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional…
We show how the signed evaluations of link polynomials can be used to calculate unknotting numbers. We use the Jones-Rong value of the Brandt-Lickorish-Millett-Ho polynomial Q to calculate the unknotting numbers of 8_{16}, 9_{49} and 6…
This paper will be an exposition of the Kauffman bracket polynomial model of the Jones polynomial, tangle methods for computing the Jones polynomial, and the use of these methods to produce non-trivial links that cannot be detected by the…
We give a generalization of a Ramanujan's exercise for high school students. Our results can be regarded as a variation of the factorization formula of $x^{n} - 1$.
In this paper we constructed new q-extension of Bernstein polynomials. Fron those q-Berstein polynomials, we give some interesting properties and we investigate some applications related this q-Bernstein polynomials.
This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of…
This paper aims to develop a grafting method to address Majid's conjecture, which enables the construction of a larger target quantum group by grafting two given smaller ones. This method is significant for advancing the understanding of…
Given a valued field $(K,v)$ and an irreducible polynomial $g\in K[x]$, we survey the ideas of Ore, Maclane, Okutsu, Montes, Vaqui\'e and Herrera-Olalla-Mahboub-Spivakovsky, leading (under certain conditions) to an algorithm to find the…
Integer factorization is a significant problem, with implications for the security of widely-used cryptographic schemes. No efficient classical algorithm for polynomial-time integer factorization has been found despite extensive research.…
Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.
New nonlinear connection formulae of the q-orthogonal polynomials, such continuous q-Laguerre, continuous big q-Hermite, q-Meixner-Pollaczek and q-Gegenbauer polynomials, in terms of their respective classical analogues are obtained using a…
The Newton-Raphson method is a fundamental root-finding technique with numerous applications in physics. In this study, we propose a parameterized variant of the Newton-Raphson method, inspired by principles from physics. Through analytical…
The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\widetilde{O}(n^{3/2}\log q + n…
A new method of extracting diffractive parton distributions is presented which avoids the use of Regge theory ansatz and is in much closer relation with the factorization theorem for diffarctive hard processes.
High-order methods gain more and more attention in computational fluid dynamics. However, the potential advantage of these methods depends critically on the availability of efficient elliptic solvers. With spectral-element methods, static…