Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with polynomials
Search options not deleted
user 51246
0
votes
Bivariate low-degree polynomial testing of Polishchuk-Spielman
The irreducibles of $A[Y]$ are precisely
the irreducibles of $A$
the (positive degree) polynomials $f\in A[Y]$ that have content 1 and are irreducible in $F[Y]$. … Then by Lagrange interpolation we get
$$
P(X,Y) = \sum_{i=1}^m P(x_i,Y) L_i(X) \equiv \text{ multiple of }Q(Y)
$$
where the $L_i(X)=L_{x_i,(x_1,\dots,x_m)}(X)\in k[X]$ are the Lagrange interpolation polynomials …
- 101