Rogers polynomials, also called Rogers–Askey–Ismail polynomials and continuous q-ultraspherical polynomials, are a family of orthogonal polynomials introduced...

introduced Rogers polynomials. The Rogers–Szegő polynomials are named after him. Rogers was born in Oxford, the second son of James Edwin Thorold Rogers and...

Newton polynomial Orthogonal polynomials Orthogonal polynomials on the unit circle Permutation polynomial Racah polynomials Rogers polynomials Rogers–Szegő...

In mathematics, the Rogers–Szegő polynomials are a family of polynomials orthogonal on the unit circle introduced by Szegő (1926), who was inspired by...

In mathematics, Gegenbauer polynomials or ultraspherical polynomials C(α) n(x) are orthogonal polynomials on the interval [−1,1] with respect to the weight...

In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to...

In mathematics, Macdonald polynomials Pλ(x; t,q) are a family of orthogonal symmetric polynomials in several variables, introduced by Macdonald in 1987...

algebra A 2 ( 2 ) {\displaystyle A_{2}^{(2)}} . Rogers polynomials Continuous q-Hermite polynomials "A003114 - OEIS". Retrieved 2022-08-06. "A003106...

Ismail polynomials may refer to one of the families of orthogonal polynomials studied by Mourad Ismail, such as: Al-Salam–Ismail polynomials Chihara-Ismail...

orthogonal polynomials. This includes the q-ultraspherical polynomials (also known as the Askey–Ismail or Rogers–Askey–Ismail polynomials), the random...

other special polynomials, are included. Contents:  Top 0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Niels Abel: Abel polynomials - Abelian function...

In mathematics, the Al-Salam–Ismail polynomials are a family of orthogonal polynomials introduced by Waleed Al-Salam and Mourad Ismail. Al-Salam, Waleed...

complex quadratic polynomial is a quadratic polynomial whose coefficients and variable are complex numbers. Quadratic polynomials have the following...

In mathematics, orthogonal polynomials on the unit circle are families of polynomials that are orthogonal with respect to integration over the unit circle...

equations, the principal form of an irreducible polynomial of degree at least three is a polynomial of the same degree n without terms of degrees n−1...

Narayana polynomials are a class of polynomials whose coefficients are the Narayana numbers. The Narayana numbers and Narayana polynomials are named after...

generation and made fundamental contributions to the theory of orthogonal polynomials and Toeplitz matrices building on the work of his contemporary Otto Toeplitz...

success and sold licenses to other companies, including Henk Rogers' Bullet-Proof Software. Rogers negotiated with Elektronorgtechnica, the state-owned organization...

bounds BQP. Furthermore, it is contained in the APP class. Fortnow, Lance; Rogers, John D. (1999). "Complexity Limitations on Quantum Computation". Journal...

domain, such as the ring of polynomials in at least two indeterminates over a field, or the ring of univariate polynomials with integer coefficients, or...

uncountably infinite. Since the polynomials with rational coefficients are countable, and since each such polynomial has a finite number of zeroes, the...

If f is a polynomial of degree less than or equal to d, then the Taylor polynomial of degree d equals f. The limit of the Taylor polynomials is an infinite...

The Rogers–Ramanujan continued fraction is a continued fraction discovered by Rogers (1894) and independently by Srinivasa Ramanujan, and closely related...

In computational complexity theory, polynomial creativity is a theory analogous to the theory of creative sets in recursion theory and mathematical logic...

Egyptian mathematician, known for Rogers–Askey–Ismail polynomials, Al-Salam–Ismail polynomials and Chihara–Ismail polynomials Peter Medawar, Lebanese-British...

theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability...

Katie; Proudfoot, Nicholas; Young, Benjamin (2017). "Kazhdan-Lusztig polynomials of matroids: a survey of results and conjectures" (PDF). Séminaire Lotharingien...

Automata and Computability. Springer. ISBN 978-1-4612-1844-9. Hartley, Rogers Jr (1987). The Theory of Recursive Functions and Effective Computability...

algorithm, for example, can be described in a finite number of English words" (Rogers 1987:2). Well defined concerning the agent that executes the algorithm:...

sums of squares of real polynomials", J. Pure Appl. Algebra, vol. 127, no.1, 99-104. 2000 (with Bruce Reznick) "Polynomials that are positive on an interval"...