Monic polynomial

Known as: Monic 
In algebra, a monic polynomial is a univariate polynomial in which the leading coefficient (the nonzero coefficient of highest degree) is equal to 1… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
For a measureμ onR, the situation is more subtle. One can always orthogonalize the subspaces of polynomials of differentotal… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Let K, S, D be a division ring an endomorphism and a S-derivation of K, respectively. In this setting we introduce generalized… (More)
Is this relevant?
2006
2006
We study the problem of finding nonconstant monic integer polynomials, normalized by their degree, with small supremum on an… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider polynomials that are orthogonal on [−1, 1] with respect to a modified Jacobi weight (1 − x)α(1 + x)βh(x), with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
It is shown that monic orthogonal polynomials on the unit circle are the characteristic polynomials of certain five-diagonal… (More)
Is this relevant?
2003
2003
We prove a uniqueness result about the factorization of a monic polynomial over a general commutative ring into comaximal factors… (More)
Is this relevant?
2003
2003
We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let Mn(Z) denote the monic… (More)
Is this relevant?
2002
2002
We study rational homology groups of one-point compactifications of spaces of complex monic polynomials with multiple roots… (More)
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A Chebyshev polynomial of a square matrix A is a monic polynomial p of specified degree that minimizes ‖p(A)‖2. The study of such… (More)
  • figure 12
  • figure 13
  • figure 14
  • figure 9
  • figure 10
Is this relevant?
Highly Cited
1996
Highly Cited
1996
An algorithm for computing polynomial zeros, based on Aberth's method, is presented. The starting approximations are chosen by… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?