Results 11 to 20 of about 165,252 (290)
Parallel Integer Polynomial Multiplication [PDF]
2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2016 We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures.
Chen, Changbo +5 more
core +6 more sources
Multiplicity-Free Key Polynomials
Annals of Combinatorics, 2022 The key polynomials, defined by A. Lascoux-M.-P. Schützenberger, are characters for the Demazure modules of type A. We classify multiplicity-free key polynomials. The proof uses two combinatorial models for key polynomials. The first is due to A. Kohnert. The second is by S. Assaf-D. Searles, in terms of quasi-key polynomials.
Hodges, Reuven, Yong, Alexander
openaire +2 more sources
Slide Multiplicity Free Key Polynomials [PDF]
The Electronic Journal of Combinatorics, 2022 Schubert polynomials are refined by the key polynomials of Lascoux-Schützen-berger, which in turn are refined by the fundamental slide polynomials of Assaf-Searles. In this paper we determine which fundamental slide polynomial refinements of key polynomials, indexed by strong compositions, are multiplicity free.
Cho, Soojin, van Willigenburg, Stephanie
openaire +2 more sources
Essentially optimal sparse polynomial multiplication [PDF]
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, 2020 12 ...
Giorgi, Pascal +2 more
openaire +3 more sources
Multiple Askey–Wilson polynomials and related basic hypergeometric multiple orthogonal polynomials
Transactions of the American Mathematical Society, 2020 We first show how one can obtain Al-Salam--Chihara polynomials, continuous dual $q$-Hahn polynomials, and Askey--Wilson polynomials from the little $q$-Laguerre and the little $q$-Jacobi polynomials by using special transformations. This procedure is then extended to obtain multiple Askey--Wilson, multiple continuous dual $q$-Hahn, and multiple Al ...
Nuwacu, Jean Paul, Van Assche, Walter
openaire +3 more sources
On multiple q-Laguerre polynomials
Journal of Classical Analysis, 2023 Summary: We study \(q\)-Laguerre multiple orthogonal polynomials. These polynomials are orthogonal with respect to \(q\)-analogues of Laguerre weight functions. We focus our attention on their structural properties. Raising and lowering operators as well as Rodrigues-type formulas are obtained and their explicit representations are given.
Sadjang, P. Njionou +2 more
openaire +2 more sources
Multiplication Rules for Polynomials [PDF]
Proceedings of the American Mathematical Society, 1978 It is proved that the polynomial solutions of the functional equation \[ F ( z ) F ( z + 1 / a ) = F ( a z 2
openaire +2 more sources
Multiple q-Kravchuk polynomials
Integral Transforms and Special Functions, 2021 We study a family of type II multiple orthogonal polynomials. We consider orthogonality conditions with respect to a vector measure, in which each component is a q-analogue of the binomial distribution. The lowering and raising operators as well as the Rodrigues formula for these polynomials are obtained. The difference equation of order r+1 is studied.
Arvesú Carballo, Jorge +1 more
openaire +3 more sources
Some properties of generalized hypergeometric Appell polynomials [PDF]
, 2020 In this paper, we present a new real-valued Appell-type polynomial family $A_n^{(k)}(m,x), $ every member of which is expressed by mean of a generalized hypergeometric function.
Bedratyuk., L, Luno, N.
core +3 more sources
Fast Multiplication for Skew Polynomials [PDF]
Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation, 2017 We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our algorithms improve the best known complexity for these problems, and reach the optimal asymptotic complexity bound for ...
Caruso, Xavier, Le Borgne, Jérémy
openaire +3 more sources