Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,703,768 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find…

2015

2015

The Khovanov-Lauda-Rouquier (KLR) algebra arose out of attempts to cat- egorify quantum groups. Kleshchev and Ram proved a result…

2012

2012

We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler…

2010

2010

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…

2008

2008

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…

2006

2006

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…

2002

2002

It is shown that the methods established in [HKN3] can be effectively used to study polynomial cycles in certain rings. We shall…

1981

1981

Syntactical graphs are representations of derivations of arbitrary grammars. The height of syntactical graphs is introduced here…