Related papers: A factorization method for q-Racah polynomials
Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation…
We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
In this paper we exploit factorisation properties of Picard-Fuchs operators to decouple differential equations for multi-scale Feynman integrals. The algorithm reduces the differential equations to blocks of the size of the order of the…
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…
We present an implementation of a parton shower algorithm for hadron colliders and electron-positron colliders based on the dipole factorisation formulae. The algorithm treats initial-state partons on equal footing with final-state partons.…
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…
Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…
We provide an explicit expression for the first order $q$-difference system for the Jackson integral of symmetric Selberg type. The $q$-difference system gives a generalization of $q$-analog of contiguous relations for the Gauss…
The main objective of this paper is to introduce the modified q-Genocchi polynomials and to define their generating function. In the paper, we show new relations, which are explicit formula, derivative formula, multiplication formula, and…
In this paper, we propose a general framework to accelerate significantly the algorithms for nonnegative matrix factorization (NMF). This framework is inspired from the extrapolation scheme used to accelerate gradient methods in convex…
Bivariate Griffiths polynomials of Racah type are constructed from univariate Racah polynomials. The bispectral properties of the former are deduced from simple properties of the latter. A duality relation and the orthogonality of these…
Let $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
We settle the dual addition formula for continuous $q$-ultraspherical polynomials as an expansion in terms of special $q$-Racah polynomials for which the constant term is given by the linearization formula for the continuous…
In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.
We describe the qFunctions Mathematica package for $q$-series and partition theory applications. This package includes both experimental and symbolic tools. The experimental set of elements includes guessers for $q$-shift equations and…
We determine the factorization of X*f(X)-Y*g(Y) over K[X,Y] for all squarefree additive polynomials f,g in K[X] and all fields K of odd characteristic. This answers a question of Kaloyan Slavov, who needed these factorizations in connection…
We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…
The main purpose of this paper is to construct not only generating functions of the new approach Genocchi type numbers and polynomials but also interpolation function of these numbers and polynomials which are related to a, b, c arbitrary…