• generic polynomial refers usually to a polynomial whose coefficients are indeterminates. For example, if a, b, and c are indeterminates, the generic polynomial...
    4 KB (560 words) - 15:00, 14 February 2024
  • point that contains all other points Generic polynomial, a polynomial whose coefficients are indeterminates Generic property, a formal definition of a property...
    2 KB (351 words) - 22:04, 23 November 2023
  • statements, "A generic polynomial does not have a root at zero," or "A generic square matrix is invertible." As another example, a generic property of a...
    12 KB (1,640 words) - 21:59, 19 June 2025
  • 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...
    46 KB (8,061 words) - 20:15, 4 June 2025
  • Thumbnail for Polynomial lemniscate
    mathematics, a polynomial lemniscate or polynomial level curve is a plane algebraic curve of degree 2n, constructed from a polynomial p with complex coefficients...
    4 KB (482 words) - 22:49, 20 March 2025
  • Thumbnail for Chebyshev polynomials
    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)}...
    58 KB (11,026 words) - 12:31, 26 June 2025
  • century, is unsolved. There are some permutation groups for which generic polynomials are known, which define all algebraic extensions of Q {\displaystyle...
    16 KB (2,541 words) - 02:19, 2 June 2025
  • Abel–Ruffini theorem (category Theorems about polynomials)
    impossibility theorem) states that there is no solution in radicals to general polynomial equations of degree five or higher with arbitrary coefficients. Here,...
    28 KB (4,098 words) - 09:15, 8 May 2025
  • is in GenP (generically polynomial time) if it never gives incorrect answers and if it gives correct answers in polynomial time on a generic set of inputs...
    18 KB (2,706 words) - 15:11, 31 May 2024
  • doi:10.2478/jee-2018-0059, S2CID 115440420 "Fast CRC Computation for Generic Polynomials Using PCLMULQDQ Instruction" (PDF). www.intel.com. 2009. Retrieved...
    25 KB (2,865 words) - 02:35, 11 January 2025
  • Fundamental theorem of algebra (category Theorems about polynomials)
    non-constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomials with real coefficients, since...
    51 KB (7,637 words) - 03:42, 7 June 2025
  • it appears in the multiset. For example, the number of times a given polynomial has a root at a given point is the multiplicity of that root. The notion...
    11 KB (1,778 words) - 08:36, 3 June 2025
  • precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number...
    41 KB (6,704 words) - 20:17, 23 June 2025
  • gen-kill problems, or locally separable problems. Such problems have generic polynomial-time solutions. In addition to the reaching definitions and live variables...
    28 KB (3,562 words) - 13:44, 6 June 2025
  • abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials. This concept is analogous...
    52 KB (7,886 words) - 23:12, 24 May 2025
  • "complete", which in modern terminology would translate to generic. Since with generic polynomials, there are no points at infinity, and all multiplicities...
    24 KB (3,574 words) - 02:08, 16 June 2025
  • Thumbnail for Quadratic formula
    quadratic polynomial, the only ways to rearrange two roots are to either leave them be or to transpose them, so solving a quadratic polynomial is simple...
    35 KB (5,787 words) - 19:29, 24 May 2025
  • Thumbnail for Francesco Calogero
    of any generic polynomial of arbitrary degree [F. Calogero, “Novel differential algorithm to evaluate all the zeros of any generic polynomial”, J. Nonlinear...
    4 KB (508 words) - 02:07, 23 June 2025
  • det(A+tI) is a polynomial in t with degree at most n, so it has at most n roots. Note that the ijth entry of adj((A+tI)(B)) is a polynomial of at most order...
    29 KB (4,813 words) - 02:50, 10 May 2025
  • (xy-yx)^{2}=-\det(xy-yx)I} for any 2-by-2-matrices x and y. Generic matrix ring Formanek, Edward (1991). The polynomial identities and invariants of n×n matrices. Regional...
    1 KB (198 words) - 05:58, 13 May 2024
  • m = 1 then F 1 {\displaystyle F_{1}} is a polynomial ring in one variable. For example, a central polynomial is an element of the ring F n {\displaystyle...
    4 KB (629 words) - 23:21, 31 March 2024
  • Thumbnail for Zariski topology
    non-linear irreducible polynomials. In this case, the spectrum consists of one closed point for each monic irreducible polynomial, and a generic point corresponding...
    21 KB (3,483 words) - 05:09, 28 June 2025
  • root of a polynomial is sometimes said to be degenerate if it is a multiple root, since generically the n roots of an nth degree polynomial are all distinct...
    9 KB (1,100 words) - 22:45, 4 April 2025
  • titled "Polynomial Codes over Certain Finite Fields". The original encoding scheme described in the Reed and Solomon article used a variable polynomial based...
    75 KB (12,395 words) - 16:42, 29 April 2025
  • Archived from the original on 2019-08-06. "Fast CRC Computation for Generic Polynomials Using PCLMULQDQ" (PDF). Vlad Krasnov (2015-07-08). "Fighting Cancer:...
    6 KB (492 words) - 03:05, 13 May 2025
  • This solution does not count as polynomial time in complexity theory because B − A {\displaystyle B-A} is not polynomial in the size of the problem, which...
    25 KB (3,781 words) - 01:03, 19 June 2025
  • Thumbnail for Arrangement of hyperplanes
    −1.) This polynomial helps to solve some basic questions; see below. Another polynomial associated with A is the Whitney-number polynomial wA(x, y), defined...
    13 KB (1,806 words) - 08:52, 30 January 2025
  • Thumbnail for Cayley–Hamilton theorem
    } For a generic 2 × 2 matrix, A = ( a b c d ) , {\displaystyle A={\begin{pmatrix}a&b\\c&d\\\end{pmatrix}},} the characteristic polynomial is given by...
    65 KB (11,251 words) - 08:52, 2 January 2025
  • geometry and computational geometry, general position is a notion of genericity for a set of points, or other geometric objects. It means the general...
    10 KB (1,469 words) - 21:00, 5 March 2025
  • Consider the submodule K consisting of all those polynomials with zero constant term. Since every polynomial contains only finitely many terms whose coefficients...
    20 KB (2,878 words) - 01:09, 6 May 2025