Learned by Reading
In Wikipedia:
A generic invariant renormalizable superpotential is a (complex) [Formula 32] invariant cubic polynomial in the superfields which has an R – charge of 2.
(Parse)
(S1 (S (NP (DT A) (JJ generic) (JJ invariant) (JJ renormalizable) (NN superpotential))
(VP (AUX is)
(NP (NP (DT a) (PRN (-LRB- -LRB-) (JJ complex) (-RRB- -RRB-)) (JJ -LSB-) (NN Formula))
(NP (NP (CD 32) (JJ -RSB-) (JJ invariant) (JJ cubic) (NN polynomial))
(PP (IN in)
(NP (NP (DT the) (NNS superfields))
(SBAR (WHNP (WDT which))
(S (VP (AUX has)
(NP (DT an) (NN R)))))
(: -)
(NP (NP (NN charge))
(PP (IN of)
(NP (CD 2)))
(. .)))
In the ICWSM 2009 Weblog Corpus:
That is, until, I came face – to – face with calculus and the realization that the function of’ ‘x’’ in regards to the derivative of any cubic polynomial does not and will not ever equal “COWABUNGA!
(Parse)
(S1 (S (NP (DT That))
(VP (AUX is) (, ,)
(SBAR (IN until) (, ,)
(S (NP (PRP I))
(VP (VBD came)
(NP (NN face) (PRN (: -)
(PP (TO to)) (: -)) (NN face))
(PP (IN with)
(NP (NP (NN calculus)) (CC and)
(NP (NP (DT the) (NN realization))
(PP (IN that)
(NP (NP (DT the) (NN function))
(PP (IN of)
(NP (NP (POS ')) (: ')
(NP (NP (NNP x) (POS ')) (: ')
(PP (IN in)
(NP (NP (VBZ regards))
(PP (TO to)
(NP (DT the) (NN derivative)
(SBAR (IN of)
(S (NP (DT any) (JJ cubic) (NN polynomial))
(VP (VP (AUX does) (RB not)) (CC and)
(VP (MD will) (RB not) (ADVP (RB ever))
(ADJP (JJ equal))))
(: ')) (: ')
(NP (NNP COWABUNGA))))
(. !)))
In Wikipedia:
If one takes “L” to be the splitting field of “X ’n” “a” over Q’ “, where” a “is not a cube in the rational numbers, then” L “contains a subfield” K “with three cube roots of 1; that is because if and are roots of the cubic polynomial, we shall have (/) 3 = 1 and the cubic is a separable polynomial.
(Parse)
(S1 (S (FRAG (SBAR (IN If)
(S (NP (PRP one))
(VP (VBZ takes)
(S ('' '')
(NP (NNP L)) ('' '')
(VP (TO to)
(VP (AUX be)
(NP (NP (DT the) (JJ splitting) (NN field))
(PP (IN of) ('' '')
(NP (NNP X) (CC 'n) ('' '') (NN ) ('' '')
(NP (DT a)) ('' '')
(PP (IN over)
(NP (NNP Q) (POS ')))))
('' '')))))
(, ,) (WRB where) ('' '')
(NP (DT a)) ('' '')
(S (VP (AUX is) (RB not)
(NP (NP (DT a) (NN cube))
(PP (IN in)
(NP (DT the) (JJ rational) (NNS numbers))))
(, ,) (ADVP (RB then)))))
('' '')
(NP (NNP L)) ('' '')
(VP (VBZ contains)
(NP (NP (DT a) (JJ subfield) ('' '') (NN K)) ('' '')
(PP (IN with)
(NP (NP (CD three) (NN cube) (NNS roots))
(PP (IN of)
(NP (NP (CD 1)) (: ;)
(SBAR (WHNP (WDT that))
(S (VP (AUX is)
(SBAR (IN because)
(S (S (SBAR (IN if)
(S (NP (NN ) (CC and) (NN ) (NNS ))
(VP (AUX are)
(NP (NP (NNS roots))
(PP (IN of)
(NP (DT the) (JJ cubic) (NN polynomial))))
(, ,)
(NP (PRP we))
(VP (MD shall)
(VP (AUX have) (PRN (-LRB- -LRB-)
(PP (FW ) (FW /)
(NP (NNP ) (NNP )))
(-RRB- -RRB-))
(NP (CD 3) (SYM =) (CD 1)))))
(CC and)
(S (NP (DT the) (JJ cubic))
(VP (AUX is)
(NP (DT a) (JJ separable) (NN polynomial)))
(. .)))
In the British National Corpus:
Remark With regard to irreducibility, 1.11.6 is chiefly of use in showing certain cubic polynomials in Q[x] irreducible, because if a cubic polynomial is reducible at least one of the facts must have degree 1.
(Parse)
(S1 (S (S (VP (VB Remark)
(PP (IN With)
(NP (NP (NN regard))
(PP (TO to)
(NP (NN irreducibility))))
(, ,)
(NP (CD 1.11.6))
(VP (AUX is) (ADVP (RB chiefly)
(PP (IN of)
(NP (NN use))))
(PP (IN in)
(S (VP (VBG showing)
(NP (JJ certain) (JJ cubic) (NNS polynomials))
(PP (IN in)
(NP (NNP Q[x]) (NN irreducible)))
(, ,)
(SBAR (IN because)
(S (SBAR (IN if)
(S (NP (DT a) (JJ cubic) (NN polynomial))
(VP (AUX is)
(NP (NP (QP (JJR reducible) (IN at) (JJS least) (CD one)))
(PP (IN of)
(NP (DT the) (NNS facts))))
(VP (MD must)
(VP (AUX have)
(NP (NN degree) (CD 1))))
(. .)))
In Wikipedia:
The sign map has kernel [Formula 17] which yields the short exact sequence [Formula 18] In Galois theory, the map [Formula 19] corresponds to the resolving quadratic for a cubic polynomial, as discovered by Gerolamo Cardano, while the [Formula 20] kernel corresponds to the use of the discrete Fourier transform of order 3 in the solution, in the form of Lagrange resolvents.
(Parse)
(S1 (S (NP (DT The) (NN sign) (NN map))
(VP (AUX has)
(NP (NP (NP (NN kernel) (NN -LSB-) (NN Formula))
(NP (CD 17) (NNS -RSB-)))
(SBAR (WHNP (WDT which))
(S (VP (VBZ yields)
(NP (DT the) (JJ short) (JJ exact) (NN sequence))
(NP (JJ -LSB-) (NN Formula))
(NP (CD 18) (NN -RSB-))
(PP (IN In)
(NP (NP (NNP Galois) (NN theory)) (, ,)
(NP (NP (NP (DT the) (NN map) (NN -LSB-) (NN Formula))
(NP (CD 19) (JJ -RSB-) (NNS corresponds)))
(PP (TO to)
(NP (DT the) (VBG resolving) (NN quadratic)))
(PP (IN for)
(NP (DT a) (JJ cubic) (NN polynomial))))
(, ,)))
(SBAR (IN as)
(S (VP (VBN discovered)
(PP (IN by)
(NP (NNP Gerolamo) (NNP Cardano)))
(, ,)
(SBAR (IN while)
(S (NP (NP (DT the) (JJ -LSB-) (NN Formula)) (CD 20) (JJ -RSB-) (NN kernel))
(VP (VBZ corresponds)
(PP (TO to)
(NP (NP (DT the) (NN use))
(PP (IN of)
(S (NP (DT the) (JJ discrete) (NNP Fourier))
(VP (VB transform)
(PP (IN of)
(NP (NN order) (CD 3)))
(PP (IN in)
(NP (DT the) (NN solution)))))
(, ,)
(PP (IN in)
(NP (NP (DT the) (NN form))
(PP (IN of)
(NP (NNP Lagrange) (NNS resolvents))))
(. .)))
In Wikipedia:
Definition of the terms. defines a non – singular cubic curve with integer coefficients “a”, “b”, “c”, and let “D” be the discriminant of the cubic polynomial on the right side: Statement of the theorem.
(Parse)
(S1 (S (S (NP (NP (NN Definition))
(PP (IN of)
(NP (DT the) (NNS terms)))
(. .))
(VP (VBZ defines)
(NP (NP (DT a) (NN non)) (: -)
(NP (JJ singular) (JJ cubic) (NN curve)))
(PP (IN with)
(NP (NP (JJR integer) (NNS coefficients) ('' ''))
(NP (DT a) ('' '') (PRN (, ,) ('' '')
(NP (NNP b)) ('' '') (, ,) ('' '')) (NN c) ('' '')))
(, ,) (CC and)
(S (VP (VB let)
(S ('' '')
(NP (NNP D)) ('' '')
(VP (AUX be)
(NP (NP (DT the) (NN discriminant))
(PP (IN of)
(NP (DT the) (JJ cubic) (NN polynomial))))
(PP (IN on)
(NP (DT the) (JJ right) (NN side)))
(: :)
(NP (NP (NN Statement))
(PP (IN of)
(NP (DT the) (NN theorem)))))
(. .)))
In Wikipedia:
In the same way, the symmetric group of order four S4 has a Klein four – group as normal subgroup, with quotient a symmetric group of order three S3, which allows one to solve a quartic in terms of a cubic resolving polynomial.
(Parse)
(S1 (S (PP (IN In)
(NP (DT the) (JJ same) (NN way)))
(, ,)
(NP (NP (DT the) (JJ symmetric) (NN group))
(PP (IN of)
(NP (NN order) (CD four))))
(NP (NNP S4))
(VP (AUX has)
(NP (NP (DT a) (NNP Klein) (CD four)) (: -)
(NP (NP (NN group))
(PP (IN as)
(NP (JJ normal) (NN subgroup))))
(, ,)
(PP (IN with)
(NP (NP (JJ quotient) (DT a) (JJ symmetric) (NN group))
(PP (IN of)
(NP (NP (NN order) (CD three) (NNP S3)) (, ,)
(SBAR (WHNP (WDT which))
(S (VP (VBZ allows)
(S (NP (PRP one))
(VP (TO to)
(VP (VB solve)
(NP (NP (DT a) (NN quartic))
(PP (IN in)
(NP (NP (NNS terms))
(PP (IN of)
(NP (DT a) (JJ cubic) (VBG resolving) (NN polynomial)))
(. .)))
In Wikipedia:
For a cubic polynomial the expressions are Signal distortion and noise reduction.
(Parse)
(S1 (S (PP (IN For)
(NP (DT a) (JJ cubic) (NN polynomial)))
(NP (DT the) (NNS expressions))
(VP (AUX are)
(NP (NP (NNP Signal) (NN distortion)) (CC and)
(NP (NN noise) (NN reduction))))
(. .)))
In Wikipedia:
The geometric problem of angle trisection can be related to algebra specifically, the roots of a cubic polynomial since by the triple – angle formula, [Formula 1] Denote the rational numbers [Formula 2].
(Parse)
(S1 (S (S (NP (NP (DT The) (JJ geometric) (NN problem))
(PP (IN of)
(NP (NN angle) (NN trisection))))
(VP (MD can)
(VP (AUX be)
(ADJP (VBN related)
(PP (TO to)
(NP (NN algebra) (NNS ))))
(ADVP (RB specifically)))))
(, ,)
(NP (NP (DT the) (NNS roots))
(PP (IN of)
(NP (DT a) (JJ cubic) (NN polynomial))))
(VP (VBP )
(SBAR (IN since)
(S (PP (IN by)
(NP (DT the) (JJ triple) (: -) (NN angle) (NN formula)))
(, ,)
(NP (NP (JJ -LSB-) (NN Formula))
(ADJP (CD 1) (JJ -RSB-)))
(VP (VBP Denote)
(NP (NP (DT the) (JJ rational) (NNS numbers) (NN -LSB-) (NN Formula))
(ADJP (CD 2) (JJ -RSB-))))
(. .)))
In Wikipedia:
Operator of order 3. with smooth coefficients and look for a factorization Similar to the case of the operator [Formula 51] the conditions of factorization are described by the following system: with [Formula 62] and again [Formula 63] i. e. [Formula 28] and three – step procedure yields: At the first step’ “, the roots of a” cubic polynomial “have to be found.
(Parse)
(S1 (S (NP (NP (NN Operator))
(PP (IN of)
(NP (NN order) (CD 3)) (. .))
(PP (IN with)
(NP (NP (NP (NP (JJ smooth) (NNS coefficients)) (CC and)
(NP (NN look)))
(PP (IN for)
(NP (NP (DT a) (NN factorization))
(ADJP (JJ Similar)
(PP (TO to)
(NP (NP (DT the) (NN case))
(PP (IN of)
(NP (NP (NP (DT the) (NN operator) (NN -LSB-) (NN Formula))
(NP (CD 51) (NNS -RSB-)))
(SBAR (S (NP (NP (DT the) (NNS conditions))
(PP (IN of)
(NP (NN factorization))))
(VP (AUX are)
(VP (VBN described)
(PP (IN by)
(NP (DT the) (JJ following) (NN system)))
(: :)
(PP (IN with)
(NP (NP (NP (JJ -LSB-) (NN Formula))
(NP (CD 62) (NNS -RSB-)))
(CC and)
(NP (RB again) (JJ -LSB-) (NN Formula))))
(NP (NP (CD 63) (NNS -RSB-))
(NP (PRP i)))
(. .)))
(X (SYM e) (. .)
(ADJP (JJ -LSB-)
(S (VP (NN Formula)
(NP (NP (CD 28) (NN -RSB-) (CC and) (CD three)) (: -)
(VP (VB step)
(NP (NN procedure) (NNS yields)))
(: :))
(PP (IN At)
(NP (DT the) (JJ first) (NN step) (POS ')))
('' '')))
(, ,)
(NP (NP (DT the) (NNS roots))
(PP (IN of)
(NP (DT a) ('' '') (JJ cubic) (NN polynomial) ('' ''))))
(VP (AUX have)
(S (VP (TO to)
(VP (AUX be)
(VP (VBN found)))
(. .)))
In Wikipedia:
If “f (x)” is a cubic or quartic polynomial, then the resulting curve is an elliptic curve.
(Parse)
(S1 (S (SBAR (IN If)
(S ('' '')
(NP (NP (SYM f)) (PRN (-LRB- -LRB-)
(NP (NNP x)) (-RRB- -RRB-)))
('' '')
(VP (AUX is)
(NP (DT a)
(ADJP (JJ cubic) (CC or) (JJ quartic)) (NN polynomial)))))
(, ,) (ADVP (RB then))
(NP (DT the) (VBG resulting) (NN curve))
(VP (AUX is)
(NP (DT an) (JJ elliptic) (NN curve)))
(. .)))
In Wikipedia:
By fitting a cubic polynomial to the points and their derivatives (gotten through the differential equation), one can predict a point [Formula 5] by extrapolating to a future time [Formula 6].
(Parse)
(S1 (S (PP (IN By)
(NP (NP (NP (JJ fitting) (DT a) (JJ cubic) (NN polynomial))
(PP (TO to)
(NP (DT the) (NNS points))))
(CC and)
(NP (NP (PRP$ their) (NNS derivatives)) (PRN (-LRB- -LRB-)
(VP (VBN gotten)
(PP (IN through)
(NP (DT the) (NN differential) (NN equation))))
(-RRB- -RRB-)))))
(, ,)
(NP (PRP one))
(VP (MD can)
(VP (VB predict)
(NP (NP (DT a) (NN point) (JJ -LSB-) (NN Formula))
(ADJP (CD 5) (NN -RSB-)))
(PP (IN by)
(S (VP (VBG extrapolating)
(PP (TO to)
(NP (DT a) (JJ future) (NN time) (NN -LSB-) (NN Formula)))
(NP (CD 6) (NN -RSB-))))
(. .)))
In Wikipedia:
It will be isomorphic to a field of the form where “f” is an irreducible cubic polynomial with coefficients in Q ’”.
(Parse)
(S1 (S (NP (PRP It))
(VP (MD will)
(VP (AUX be)
(ADJP (JJ isomorphic)
(PP (TO to)
(NP (NP (DT a) (NN field))
(PP (IN of)
(NP (NP (DT the) (NN form))
(SBAR (S (NP (INTJ (WRB where)) ('' '') (NN f) ('' ''))
(VP (AUX is)
(NP (NP (DT an) (JJ irreducible) (JJ cubic) (NN polynomial))
(PP (IN with)
(NP (NP (NNS coefficients))
(PP (IN in)
(NP (NNP Q) (POS ')))
('' '')))))
(. .)))
In the ICWSM 2009 Weblog Corpus:
This is almost certainly because I’ve used a cubic polynomial to fit to the data to detrend it.
(Parse)
(S1 (S (NP (DT This))
(VP (AUX is) (ADVP (RB almost) (RB certainly))
(SBAR (IN because)
(S (NP (PRP I))
(VP (AUX 've)
(VP (VBN used)
(NP (DT a) (JJ cubic) (NN polynomial))
(S (VP (TO to)
(VP (VB fit)
(PP (TO to)
(NP (DT the) (NN data)
(S (VP (TO to)
(VP (VB detrend)
(NP (PRP it)))
(. .)))
In the ICWSM 2009 Weblog Corpus:
Statistical analysis runs the gamut from linear, logarithmic, exponential and power to quadratic polynomial, cubic polynomial, and quartic polynomial regressions.
(Parse)
(S1 (S (NP (JJ Statistical) (NN analysis))
(VP (VBZ runs)
(NP (DT the) (NN gamut))
(PP (PP (IN from)
(ADJP (JJ linear) (, ,) (JJ logarithmic) (, ,) (JJ exponential) (CC and) (NN power)))
(PP (TO to)
(NP (NP (JJ quadratic) (NN polynomial)) (, ,)
(NP (JJ cubic) (NN polynomial)) (, ,) (CC and)
(NP (JJ quartic) (JJ polynomial) (NNS regressions)))
(. .)))
In Wikipedia:
Another example is an implicit function given by “x” – “C” (“y”) = 0 where “C” is a cubic polynomial having a “hump” in its graph.
(Parse)
(S1 (S (NP (DT Another) (NN example))
(VP (AUX is)
(NP (NP (DT an) (JJ implicit) (NN function))
(VP (VBN given)
(PP (IN by) ('' '')
(NP (NP (SYM x)) ('' '') (: -) ('' '')
(NP (SYM C)) ('' '')
(SBAR (S (-LRB- -LRB-)
(NP ('' '') (NNPS y) ('' '')) (-RRB- -RRB-)
(VP (SYM =)
(NP (CD 0)) (ADVP (WRB where)) ('' '')
(SBAR (S (NP (SYM C) ('' ''))
(VP (AUX is)
(NP (NP (DT a) (JJ cubic) (NN polynomial))
(VP (AUXG having)
(NP (DT a) ('' '') (NNP hump)) ('' '')
(PP (IN in)
(NP (PRP$ its) (NN graph))))
(. .)))
In Wikipedia:
Still better might be a cubic polynomial “a” + “b” (“x” – “x” 0) + “c” (“x” – “x” 0) + “d” (“x” – “x” 0), and this idea can be extended to arbitrarily high degree polynomials.
(Parse)
(S1 (FRAG (ADJP (RB Still) (JJR better))
(S (VP (MD might)
(VP (AUX be)
(NP (NP (DT a) (JJ cubic) (NN polynomial)) ('' '')
(SBAR (S (NP (NP (DT a) (PRN ('' '')
(S (VP (VBG +) ('' '')
(NP (NNP b))))
('' '') (-LRB- -LRB-) ('' '')
(S (NP (SYM x) ('' '') (: -) ('' ''))
(VP (SYM x)))
('' '')
(NP (CD 0)) (-RRB- -RRB-)) (NN +) ('' '')
(NP (NNP c) ('' '') (PRN (-LRB- -LRB-) ('' '')
(S (NP (SYM x) ('' '') (: -) ('' ''))
(VP (SYM x)))
('' '')
(NP (CD 0)) (-RRB- -RRB-)) (NNP ) (NNP ) (NNP +) ('' '') (NNP d)) ('' '') (PRN (-LRB- -LRB-) ('' '')
(S (NP (SYM x) ('' '') (: -) ('' ''))
(VP (SYM x)))
('' '')
(NP (CD 0)) (-RRB- -RRB-))
(NP (CD ) (NNS )))
(, ,) (CC and)
(NP (DT this) (NN idea)))
(VP (MD can)
(VP (AUX be)
(VP (VBN extended)
(PP (TO to)
(NP (ADJP (RB arbitrarily) (JJ high)) (NN degree) (NNS polynomials)))
(. .)))
In Wikipedia:
The graph of the cubic polynomial on the real line If this set is plotted on a Cartesian plane, the result is a curve (see figure).
(Parse)
(S1 (S (NP (NP (DT The) (NN graph))
(PP (IN of)
(NP (DT the) (JJ cubic) (NN polynomial)))
(PP (IN on)
(NP (DT the) (JJ real) (NN line)
(SBAR (IN If)
(S (NP (DT this) (NN set))
(VP (AUX is)
(VP (VBD plotted)
(PP (IN on)
(NP (DT a) (NNP Cartesian) (NN plane))))
(, ,)
(NP (DT the) (NN result))
(VP (AUX is)
(NP (NP (DT a) (NN curve)) (PRN (-LRB- -LRB-)
(S (VP (VB see)
(NP (NN figure))))
(-RRB- -RRB-))))
(. .)))
In Wikipedia:
The graph of the cubic polynomial on the real line If this set is plotted on a Cartesian plane, the result is a curve (see figure).
(Parse)
(S1 (S (NP (NP (DT The) (NN graph))
(PP (IN of)
(NP (DT the) (JJ cubic) (NN polynomial)))
(PP (IN on)
(NP (DT the) (JJ real) (NN line)
(SBAR (IN If)
(S (NP (DT this) (NN set))
(VP (AUX is)
(VP (VBD plotted)
(PP (IN on)
(NP (DT a) (NNP Cartesian) (NN plane))))
(, ,)
(NP (DT the) (NN result))
(VP (AUX is)
(NP (NP (DT a) (NN curve)) (PRN (-LRB- -LRB-)
(S (VP (VB see)
(NP (NN figure))))
(-RRB- -RRB-))))
(. .)))
And 12 more sentences.