Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,703,768 papers from all fields of science
Search
Sign In
Create Free Account
Height of a polynomial
Known as:
Length (disambiguation)
, Length of a polynomial
, Polynomial height
In mathematics, the height and length of a polynomial P with complex coefficients are measures of its "size".
Wikipedia
Create Alert
Alert
Related topics
Related topics
2 relations
Mahler measure
Polynomial
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Sets of lengths of powers of a variable
R. Belshoff
,
Daniel Kline
,
M. W. Rogers
Rocky Mountain Journal of Mathematics
2019
Corpus ID: 119155301
A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find…
Expand
2015
2015
HOMOGENEOUS REPRESENTATIONS OF TYPE A KLR-ALGEBRAS AND DYCK PATHS
Gabriel Feinberg
,
Kyu-Hwan Lee
2015
Corpus ID: 39371220
The Khovanov-Lauda-Rouquier (KLR) algebra arose out of attempts to cat- egorify quantum groups. Kleshchev and Ram proved a result…
Expand
2015
2015
Parabolic-cylindrical moving least squares surfaces
Brett Ridel
,
Gaël Guennebaud
,
P. Reuter
,
Xavier Granier
Comput. Graph.
2015
Corpus ID: 206374169
2012
2012
Flat Cyclotomic Polynomials: A New Approach
Sam Elder
2012
Corpus ID: 117091150
We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler…
Expand
2010
2010
Some conjectures on the maximal height of divisors of x n 1
Nathan C. Ryan
,
Bryan C. Ward
,
Ryan Ward
2010
Corpus ID: 34479750
Define B.n/ to be the largest height of a polynomial in ZTxU dividing x n 1. We formulate a number of conjectures related to the…
Expand
2008
2008
The reduced length of a polynomial with complex coefficients
A. Schinzel
2008
Corpus ID: 54180479
l(P ) = inf L(PG), l̂(P ) = min{l(P ), l(P ∗)}, where G runs through all monic polynomials in C[x]. This notation is consistent…
Expand
2006
2006
Littlewood polynomials with high order zeros
D. Berend
,
Shahar Golan
Math. Comput.
2006
Corpus ID: 10717321
Let N*(m) be the minimal length of a polynomial with ±1 coefficients divisible by (x-1) m . Byrnes noted that N*(m) < 2 m for…
Expand
2002
2002
Polynomial cycles in certain rings of rationals
W. Narkiewicz
2002
Corpus ID: 56258290
It is shown that the methods established in [HKN3] can be effectively used to study polynomial cycles in certain rings. We shall…
Expand
1993
1993
Algebraically rectifiable parametric curves
T. Sakkalis
,
R. Farouki
Comput. Aided Geom. Des.
1993
Corpus ID: 205070624
1981
1981
On the Height of Syntactical Graphs
F. Brandenburg
Theoretical Computer Science
1981
Corpus ID: 38627763
Syntactical graphs are representations of derivations of arbitrary grammars. The height of syntactical graphs is introduced here…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE