Search references for POLYNOMIAL SEQUENCE. Phrases containing POLYNOMIAL SEQUENCE
See searches and references containing POLYNOMIAL SEQUENCE!POLYNOMIAL SEQUENCE
Sequence valued in polynomials
In mathematics, a polynomial sequence is a sequence of polynomials indexed by the nonnegative integers 0, 1, 2, 3, ..., in which each index is equal to
Polynomial_sequence
Polynomial sequence
In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence. The polynomials arise in: signal processing as Hermitian wavelets
Hermite_polynomials
Type of polynomial sequence
In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence { p n ( x ) } n = 0 , 1 , 2 , … {\displaystyle \{p_{n}(x)\}_{n=0
Appell_sequence
Polynomial sequence
function. They are an Appell sequence (i.e. a Sheffer sequence for the ordinary derivative operator). For the Bernoulli polynomials, the number of crossings
Bernoulli_polynomials
Type of polynomial sequence
sequence or poweroid is a polynomial sequence, i.e., a sequence ( pn(x) : n = 0, 1, 2, 3, ... ) of polynomials in which the index of each polynomial equals
Sheffer_sequence
Type of polynomial sequence
In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by non-negative integers { 0 , 1 , 2 , 3 , … } {\textstyle \left\{0,1,2
Binomial_type
Set of polynomials where any two are orthogonal to each other
mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to each other
Orthogonal_polynomials
Polynomials in combinatorial mathematics
In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions. They are related to Stirling
Bell_polynomials
Pair of polynomial sequences
The Chebyshev polynomials are two sequences of orthogonal polynomials related to the cosine and sine functions, notated as T n ( x ) {\displaystyle T_{n}(x)}
Chebyshev_polynomials
Sequence of differential equation solutions
\int _{0}^{\infty }f(x)e^{-x}\,dx.} These polynomials, usually denoted L0, L1, ..., are a polynomial sequence which may be defined by the Rodrigues formula
Laguerre_polynomials
Formal power series
polynomials Chebyshev polynomials Difference polynomials Generalized Appell polynomials q-difference polynomials Other sequences generated by more complex
Generating_function
Polynomial sequence
In mathematics, the Zernike polynomials are a sequence of polynomials that are orthogonal on the unit disk. Named after optical physicist Frits Zernike
Zernike_polynomials
Greatest common divisor of polynomials
GCD or gcd) of two polynomials is a polynomial, of the highest possible degree, which is a factor of both the two original polynomials. This concept is
Polynomial greatest common divisor
Polynomial_greatest_common_divisor
In mathematics, the Dickson polynomials, denoted Dn(x,α), form a polynomial sequence introduced by L. E. Dickson (1897). They were rediscovered by Brewer
Dickson_polynomial
Integer sequence
of the sequence starting with any seed other than 22. Conway's constant is the unique positive real root of the following polynomial (sequence A137275
Look-and-say_sequence
Infinite sequence of numbers satisfying a linear equation
progressions, and all polynomials are constant-recursive. However, not all sequences are constant-recursive; for example, the factorial sequence 1 , 1 , 2 , 6
Constant-recursive_sequence
Sequence of polynomials defined recursively
the Fibonacci polynomials are a polynomial sequence which can be considered as a generalization of the Fibonacci numbers. The polynomials generated in
Fibonacci_polynomials
Finite or infinite ordered list of elements
elements of a sequence can be functions instead of numbers. For example, the monomial basis for polynomials of a single variable forms the sequence ( x ↦ 1
Sequence
Set of quantities in probability theory
coefficient is a polynomial in the cumulants; these are the Bell polynomials, named after Eric Temple Bell.[citation needed] This sequence of polynomials is of binomial
Cumulant
Sequence of polynomials
Touchard polynomials, studied by Jacques Touchard (1956), also called the exponential polynomials or Bell polynomials, comprise a polynomial sequence of binomial
Touchard_polynomials
Type of orthogonal polynomials
orthogonal polynomials are the most widely used orthogonal polynomials: the Hermite polynomials, Laguerre polynomials, Jacobi polynomials (including as
Classical orthogonal polynomials
Classical_orthogonal_polynomials
In mathematics, the Stirling polynomials are a family of polynomials that generalize important sequences of numbers appearing in combinatorics and analysis
Stirling_polynomials
Polynomial sequence
In mathematics, Gegenbauer polynomials or ultraspherical polynomials C(α) n(x) are orthogonal polynomials on the interval [−1,1] with respect to the weight
Gegenbauer_polynomials
Type of pseudorandom binary sequence
example, the polynomial corresponding to Figure 1 is x 4 + x + 1 {\displaystyle x^{4}+x+1} . A necessary and sufficient condition for the sequence generated
Maximum_length_sequence
The Abel polynomials are a sequence of polynomials named after Niels Henrik Abel, defined by the following equation: p n ( x ) = x ( x − a n ) n − 1 {\displaystyle
Abel_polynomials
Polynomial sequence
In mathematics, Jacobi polynomials (occasionally called hypergeometric polynomials) P n ( α , β ) ( x ) {\displaystyle P_{n}^{(\alpha ,\beta )}(x)} are
Jacobi_polynomials
difference polynomials are a polynomial sequence, a certain subclass of the Sheffer polynomials, which include the Newton polynomials, Selberg's polynomials, and
Difference_polynomials
All one polynomials Appell sequence Askey–Wilson polynomials Bell polynomials Bernoulli polynomials Bernstein polynomial Bessel polynomials Binomial
List_of_polynomial_topics
Error-detecting code for detecting data changes
the generator polynomial x + 1 (two terms), and has the name CRC-1. A CRC-enabled device calculates a short, fixed-length binary sequence, known as the
Cyclic_redundancy_check
combinatorial mathematics, the q-difference polynomials or q-harmonic polynomials are a polynomial sequence defined in terms of the q-derivative. They
Q-difference_polynomial
Irreducible polynomial whose roots are nth roots of unity
{\displaystyle n} -th cyclotomic polynomial, for any positive integer n {\displaystyle n} , is the unique irreducible polynomial with integer coefficients that
Cyclotomic_polynomial
Numbers obtained by adding the two previous ones
value x, the result is the sequence of Fibonacci polynomials. Not adding the immediately preceding numbers. The Padovan sequence and Perrin numbers have
Fibonacci_sequence
Exact value is an irrational number which is a root of a quartic polynomial (sequence A230582 in the OEIS). See Flag of Nepal § Aspect ratio. See Flag
List of national flags of sovereign states
List_of_national_flags_of_sovereign_states
Counting polynomial roots in an interval
In mathematics, the Sturm sequence of a univariate polynomial p is a sequence of polynomials associated with p and its derivative by a variant of Euclid's
Sturm's_theorem
Mathematical approximation of a function
function is convergent, its sum is the limit of the infinite sequence of the Taylor polynomials. A function may differ from the sum of its Taylor series,
Taylor_series
Polynomial with +1 or –1 coefficients
the autocorrelation of binary sequences. They are named for J. E. Littlewood who studied them in the 1950s. A polynomial p ( x ) = ∑ i = 0 n a i x i {\displaystyle
Littlewood_polynomial
Roughly, the number of k-dimensional holes on a topological surface
Betti number sequence for a circle is 1, 1, 0, 0, 0, ...; the Poincaré polynomial is 1 + x {\displaystyle 1+x\,} . The Betti number sequence for a three-torus
Betti_number
n} is an integer variable, is a type of trigonometric polynomial, called a "polynomial sequence" for the purposes of the nilsequence theory. The generalisation
Nilsequence
Form of interpolation
In numerical analysis, polynomial interpolation is the interpolation of a given data set by the polynomial of lowest possible degree that passes through
Polynomial_interpolation
System of complete and orthogonal polynomials
mathematics, Legendre polynomials, named after Adrien-Marie Legendre (1782), are a system of complete and orthogonal polynomials with a wide number of
Legendre_polynomials
Algebraic structure
especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates (traditionally
Polynomial_ring
Expression for sums of powers
triangle of Pascal. The term Faulhaber polynomials is used by some authors to refer to another polynomial sequence related to that given above. Write a
Faulhaber's_formula
delta operator Q {\displaystyle Q} has a unique sequence of "basic polynomials", a polynomial sequence defined by three conditions: p 0 ( x ) = 1 ; {\displaystyle
Delta_operator
Algebraic expansion of powers of a binomial
a matrix. The binomial theorem can be stated by saying that the polynomial sequence {1, x, x2, x3, ...} is of binomial type. Mathematics portal Binomial
Binomial_theorem
Tool in mathematical dimension theory
In commutative algebra, the Hilbert function, the Hilbert polynomial, and the Hilbert series of a graded commutative algebra finitely generated over a
Hilbert series and Hilbert polynomial
Hilbert_series_and_Hilbert_polynomial
Fractal named after mathematician Benoit Mandelbrot
constructed as the limit set of a sequence of plane algebraic curves, the Mandelbrot curves, of the general type known as polynomial lemniscates. The Mandelbrot
Mandelbrot_set
Function of the coefficients of a polynomial that gives information on its roots
precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number
Discriminant
polynomial sequence { p n ( z ) } {\displaystyle \{p_{n}(z)\}} has a generalized Appell representation if the generating function for the polynomials
Generalized Appell polynomials
Generalized_Appell_polynomials
Count of permutations by cycles
Mathematica. Other software packages for guessing formulas for sequences (and polynomial sequence sums) involving Stirling numbers and other special triangles
Stirling numbers of the first kind
Stirling_numbers_of_the_first_kind
Mathematical expression
Newton polynomial, named after its inventor Isaac Newton, is an interpolation polynomial for a given set of data points. The Newton polynomial is sometimes
Newton_polynomial
Historical term in mathematics
functions on spaces of polynomials. Currently, umbral calculus refers to the study of Sheffer sequences, including polynomial sequences of binomial type and
Umbral_calculus
Basis of polynomials consisting of monomials
representing a polynomial over a specific real interval or arbitrary region in the complex plane.[citation needed] Horner's method Polynomial sequence Newton
Monomial_basis
Mathematical function
elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial can be expressed
Elementary symmetric polynomial
Elementary_symmetric_polynomial
Topics referred to by the same term
geometry), a partition of a geometry into subspaces Spread polynomials, a polynomial sequence arising in rational trigonometry Spread (topology), a cardinal
Spread
Linear recurrence equation
P-recursive equation is a linear equation of sequences where the coefficient sequences can be represented as polynomials. P-recursive equations are linear recurrence
P-recursive_equation
Type of shift register in computing
original sequence. These forms generalize naturally to arbitrary fields. The following table lists examples of maximal-length feedback polynomials (primitive
Linear-feedback shift register
Linear-feedback_shift_register
Statistics concept
In statistics, polynomial regression is a form of regression analysis in which the relationship between the independent variable x and the dependent variable
Polynomial_regression
Method for estimating new data outside known data points
series that fits the data. The resulting polynomial may be used to extrapolate the data. High-order polynomial extrapolation must be used with due care
Extrapolation
polynomials Pn are the Legendre polynomials. The Gauss–Kronrod quadrature formula uses the zeros of Stieltjes polynomials. If P0, P1, form a sequence
Stieltjes_polynomials
Surname list
mathematician and rector of the University of Paris Appell polynomials, a polynomial sequence named after Paul Appell Appell's equation of motion, an alternative
Appell
Equations of degree 5 or higher cannot be solved by radicals
impossibility theorem) states that there is no solution in radicals to general polynomial equations of degree five or higher with arbitrary coefficients. Here,
Abel–Ruffini_theorem
In mathematics, a sequence of discrete orthogonal polynomials is a sequence of polynomials that are pairwise orthogonal with respect to a discrete measure
Discrete orthogonal polynomials
Discrete_orthogonal_polynomials
Error-correcting codes
the Reed Solomon original view of a codeword as a sequence of polynomial values where the polynomial is based on the message to be encoded. The same set
Reed–Solomon_error_correction
Pattern defining an infinite sequence of numbers
the general term of the sequence as a closed-form expression of n {\displaystyle n} . As well, linear recurrences with polynomial coefficients depending
Recurrence_relation
Infinite integer series where the next number is the sum of the two preceding it
Fibonacci polynomials are derived from the Fibonacci numbers, the Lucas polynomials L n ( x ) {\displaystyle L_{n}(x)} are a polynomial sequence derived
Lucas_number
Online database of integer sequences
The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching
On-Line Encyclopedia of Integer Sequences
On-Line_Encyclopedia_of_Integer_Sequences
Polynomial sequence
table of B ( n , k ) {\displaystyle B(n,k)} (sequence A060187 in the OEIS) is The corresponding polynomials M n ( x ) = ∑ k = 0 n B ( n , k ) x k {\displaystyle
Eulerian_number
Seemingly random, difficult to predict bit stream created by a deterministic algorithm
Pseudorandom binary sequences can be generated using linear-feedback shift registers. Some common sequence generating monic polynomials are PRBS7 = x 7 +
Pseudorandom_binary_sequence
Type of functions, in mathematical analysis
sequence c = c 0 , c 1 , … {\displaystyle c=c_{0},c_{1},\ldots } is called P {\displaystyle P} -recursive (or holonomic) if there exist polynomials a
Holonomic_function
Generalization of perpendicularity
Various polynomial sequences named for mathematicians of the past are sequences of orthogonal polynomials. In particular: The Hermite polynomials are orthogonal
Orthogonality_(mathematics)
Polynomial without nontrivial factorization
an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of
Irreducible_polynomial
Mathematical sequences in combinatorics
kinds is that they describe coefficients relating three different sequences of polynomials that frequently arise in combinatorics. Moreover, all three can
Stirling_number
biorthogonal polynomials in the literature: Iserles & Nørsett (1988) introduced the concept of polynomials biorthogonal with respect to a sequence of measures
Biorthogonal_polynomial
Set of vectors used to define coordinates
Chebyshev polynomials) is also a basis. (Such a set of polynomials is called a polynomial sequence.) But there are also many bases for F[X] that are not
Basis_(linear_algebra)
List of unsolved computational problems
factorization be done in polynomial time on a classical (non-quantum) computer? Can the discrete logarithm be computed in polynomial time on a classical (non-quantum)
List of unsolved problems in computer science
List_of_unsolved_problems_in_computer_science
Special function defined by an integral
Ramanujan–Soldner constant and ( P n ) {\displaystyle (P_{n})} is polynomial sequence defined by the following recurrence relation: P 0 ( x ) = x , P
Exponential_integral
Topics referred to by the same term
function A sequence used to determine the number of distinct real roots of a polynomial by Sturm's theorem This disambiguation page lists mathematics articles
Sturmian_sequence
Expression in commutative algebra
homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial can be expressed as a polynomial expression in complete
Complete homogeneous symmetric polynomial
Complete_homogeneous_symmetric_polynomial
Algebraic encoding of graph connectivity
The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays
Tutte_polynomial
Visualization of the prime numbers
the sequence of values taken by the second polynomial, two out of every three are divisible by 3, and hence certainly not prime, while in the sequence of
Ulam_spiral
Concept in mathematics
In mathematics, a multiplicative sequence or m-sequence is a sequence of polynomials associated with a formal group structure. They have application in
Multiplicative_sequence
Type of symmetric polynomials in mathematics
elementary symmetric polynomials and the complete homogeneous symmetric polynomials. In representation theory they are the characters of polynomial irreducible
Schur_polynomial
Number, approximately 1.618
golden ratio is a root of a polynomial with rational coefficients, it is an algebraic number. Its minimal polynomial, the polynomial of lowest degree with integer
Golden_ratio
Minimal polynomial of a primitive element in a finite field
mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite field GF(pm). This means that a polynomial F(X) of degree m
Primitive polynomial (field theory)
Primitive_polynomial_(field_theory)
Study of mathematical knots
theory. A knot polynomial is a knot invariant that is a polynomial. Well-known examples include the Jones polynomial, the Alexander polynomial, and the Kauffman
Knot_theory
Algorithm for polynomial evaluation
computer science, Horner's method (or Horner's scheme) is an algorithm for polynomial evaluation. It is named after William George Horner, although it is much
Horner's_method
Infinite binary sequence generated by repeated complementation and concatenation
choices. The initial 2k bits of the Thue–Morse sequence are mapped to 0 by a wide class of polynomial hash functions modulo a power of two, which can
Thue–Morse_sequence
Hermite polynomials Hermite polynomials, a sequence of polynomials orthogonal with respect to the normal distribution Continuous q-Hermite polynomials Continuous
List of things named after Charles Hermite
List_of_things_named_after_Charles_Hermite
Computational method
mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the
Factorization_of_polynomials
Formula whose values are the prime numbers
other polynomials (of higher degree) produces finite sequences of prime numbers. In 2010, Dress and Landreau found the following polynomial representing
Formula_for_primes
Geometry of the location of polynomial roots
In mathematics, a univariate polynomial of degree n with real or complex coefficients has n complex roots (if counted with their multiplicities). They
Geometrical properties of polynomial roots
Geometrical_properties_of_polynomial_roots
Mathematical function
properties and expansions of these generalized α-factorial triangles and polynomial sequences are considered in Schmidt (2010). Suppose that n ≥ 1 and α ≥ 2 are
Double_factorial
Class in computational complexity theory
problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In other words, a problem with input size n is in
NC_(complexity)
Function in algebraic graph theory
The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a
Chromatic_polynomial
pyramidal number The (incomplete) Bell polynomials from a triangular array of polynomials (see also Polynomial sequence). Heronian triangle Integer triangle
List_of_triangle_topics
In mathematics, Padovan polynomials are a generalization of Padovan sequence numbers. These polynomials are defined by: P n ( x ) = { 1 , if n = 1 0
Padovan_polynomials
Well-behaved sequence in a commutative ring
Being a regular sequence may depend on the order of the elements. For example, x, y(1-x), z(1-x) is a regular sequence in the polynomial ring C[x, y, z]
Regular_sequence
'Best' approximation of a function by a rational function of given order
compute the greatest common divisor of two polynomials p and q, one computes via long division the remainder sequence r 0 = p , r 1 = q , r k − 1 = q k r k
Padé_approximant
orthogonal polynomials. Brenke (1945) introduced sequences of Brenke polynomials Pn, which are special cases of generalized Appell polynomials with generating
Brenke–Chihara_polynomials
Mathematical concept in polynomial theory
resultant of two polynomials is a polynomial expression of their coefficients that is equal to zero if and only if the polynomials have a common root
Resultant
POLYNOMIAL SEQUENCE
POLYNOMIAL SEQUENCE
Girl/Female
Tamil
Anuloma | அநà¯à®²à¯‹à®®à®¾
Sequence
Anuloma | அநà¯à®²à¯‹à®®à®¾
Girl/Female
Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Sanskrit, Telugu
Sequence
Surname or Lastname
English
English : from a medieval male personal name (from Latin Hilarius, a derivative of hilaris ‘cheerful’, ‘glad’, from Greek hilaros ‘propitious’, ‘joyful’). The Latin name was chosen by many early Christians to express their joy and hope of salvation, and was borne by several saints, including a 4th-century bishop of Poitiers noted for his vigorous resistance to the Arian heresy, and a 5th-century bishop of Arles. Largely due to veneration of the first of these, the name became popular in France in the forms Hilari and Hilaire, and was brought to England by the Norman conquerors.English : from the much rarer female personal name Eulalie (from Latin Eulalia, from Greek eulalos ‘eloquent’, literally well-speaking, chosen by early Christians as a reference to the gift of tongues), likewise introduced into England by the Normans. A St. Eulalia was crucified at Barcelona in the reign of the Emperor Diocletian and became the patron of that city. In England the name underwent dissimilation of the sequence -l-l- to -l-r- and the unfamiliar initial vowel was also mutilated, so that eventually the name was considered as no more than a feminine form of Hilary (of which the initial aspirate was in any case variable).
Boy/Male
Indian, Sanskrit
Order; Sequence
Boy/Male
Indian, Sikh
Music; In-sequence
POLYNOMIAL SEQUENCE
POLYNOMIAL SEQUENCE
Boy/Male
Hindu, Indian, Sanskrit
Beloved by Indra
Boy/Male
American, Australian, Chinese, Christian, Dutch, German, Hawaiian, Hebrew, Swedish
Dove
Girl/Female
Arabic, Muslim
Eyes with Long Lashes
Surname or Lastname
English
English : probably a variant Saylor.
Girl/Female
Muslim
Life, Vivaciousness, Living prosperous, Women life
Boy/Male
American, Anglo, Australian, British, Danish, English
Dwells by the Torrent; From the Linden Tree Hill
Girl/Female
Indian
Imperishability
Girl/Female
Hindu
Speech, **
Surname or Lastname
English
English : variant of Haselden.
Boy/Male
Tamil
Manishith | மாஂநீஷித
Desired, Loved
POLYNOMIAL SEQUENCE
POLYNOMIAL SEQUENCE
POLYNOMIAL SEQUENCE
POLYNOMIAL SEQUENCE
POLYNOMIAL SEQUENCE
n.
A sequence of three playing cards of the same suit. Tierce of ace, king, queen, is called tierce-major.
n.
Simple succession, or the coming after in time, without asserting or implying causative energy; as, the reactions of chemical agents may be conceived as merely invariable sequences.
n.
That which follows as a result; a sequence.
n.
A hymn introduced in the Mass on certain festival days, and recited or sung immediately before the gospel, and after the gradual or introit, whence the name.
n.
A melodic phrase or passage successively repeated one tone higher; a rosalia.
a.
Containing many names or terms; multinominal; as, the polynomial theorem.
n.
The state of being sequent; succession; order of following; arrangement.
a.
Consisting of two or more words; having names consisting of two or more words; as, a polynomial name; polynomial nomenclature.
n.
A form of melody in which a phrase or passage is successively repeated, each time a step or half step higher; a melodic sequence.
n.
All five cards, of a hand, in consecutive order as to value, but not necessarily of the same suit; when of one suit, it is called a sequence flush.
n.
A polynomial of four terms connected by the signs plus or minus.
n.
Three or more cards of the same suit in immediately consecutive order of value; as, ace, king, and queen; or knave, ten, nine, and eight.
a.
Possessing the same number of factors of a given kind; as, a homogeneous polynomial.
n.
The quality or state of succession in a series; sequence.
n. & a.
Same as Polynomial.
n.
A number of things or events standing or succeeding in order, and connected by a like relation; sequence; order; course; a succession of things; as, a continuous series of calamitous events.
n.
Any succession of chords (or harmonic phrase) rising or falling by the regular diatonic degrees in the same scale; a succession of similar harmonic steps.
n.
An expression composed of two or more terms, connected by the signs plus or minus; as, a2 - 2ab + b2.
n.
A polynomial name or term.
n.
That which follows or succeeds as an effect; sequel; consequence; result.