نتایج جستجو برای: brenstien polynomials
تعداد نتایج: 37864 فیلتر نتایج به سال:
ABSTRACT: Knop and Sahi introduced a family of non-homogeneous and nonsymmetric polynomials, Gα(x; q, t), indexed by compositions. An explicit formula for the bivariate Knop-Sahi polynomials reveals a connection between these polynomials and q-special functions. In particular, relations among the q-ultraspherical polynomials of Askey and Ismail, the two variable symmetric and non-symmetric Macd...
The resultant is an algebraic expression, computable in a finite number of arithmetic operations from the coefficients of two univariate polynomials, that vanishes if, and only if, the two polynomials have common zeros. The paper considers formal resultant for degree-deficient polynomials (polynomials whose actual degree is lower than their assumed degree). Some key properties of the resultant ...
Abstract.In this paper, the generalized Bessel matrix polynomials are introduced, starting from the hypergeometric matrix function. Integral form, Rodrigues’s formula and generating matrix function are then developed for the generalized Bessel matrix polynomials. These polynomials appear as finite series solutions of second-order matrix differential equations and orthogonality property for the ...
1. P. Bateman, J. Kalb, and A. Stenger, A limit involving least common multiples, this MONTHLY 109 (2002) 393–394. doi:10.2307/2695513 2. L. Comtet, Advanced Combinatorics: The Art of Finite and Infinite Expansions, D. Reidel, DordrechtHolland, 1974. 3. B. Farhi, Nontrivial lower bounds for the least common multiple of some finite sequences of integers, J. Number Theory 125 (2007) 393–411. doi:...
In this paper we prove Riesz transform characterizations for Hardy spaces associated with certain systems of Laguerre functions.
We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials, matching polynomials, Narayana polynomials and Eulerian polynomials. We also settle certain conjectures of Stahl on genus polynomials by proving them for cer...
Four recursive constructions of permutation polynomials over GF(q2) with those over GF(q) are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over GF(q2 l ) for any positive integer l with any given permutation polynomial over GF(q). A generic construction of permutation polynomials over GF(22m) with o-polynomial...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید