Skip to main content
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
Search options not deleted user 37555

Questions in which polynomials (single or several variables) play a key role. It is typically important that this tag is combined with other tags; polynomials appear in very different contexts. Please, use at least one of the top-level tags, such as nt.number-theory, co.combinatorics, ac.commutative-algebra, in addition to it. Also, note the more specific tags for some special types of polynomials, e.g., orthogonal-polynomials, symmetric-polynomials.

3 votes

Does there exist another form of the derivative for polynomials?

As there are several possibilities for $F$, here is an attempt at determining $H$. Using the linearity of $F$ we have $H(\lambda x, y, \lambda u, v)=\lambda H(x, y, u, v)$. Taking the derivative with …
Jan-Christoph Schlage-Puchta's user avatar
4 votes
Accepted

Divergence of a series related to Schinzel's hypothesis H

In the 1960's Turán wrote several papers on a function-theoretic sieve. He managed to express the number of prime twins in terms of roots of $L$-series. He began like you did by expressing $\Lambda$ a …
Jan-Christoph Schlage-Puchta's user avatar
3 votes
Accepted

Parallel algorithm for modular multiplication of polynomials over Z/nZ

If the degree of the polynomials is $k$, then generalized Karatsuba schemes give the product of these polynomials in $O(k^{1+\varepsilon})$ multiplications modulo $n$, and these schemes parallelize very … well, as each step splits the multiplication of two polynomials into several multiplications of polynomials of smaller degree. …
Stefan Kohl's user avatar
  • 19.6k
1 vote

counting complex roots which are root of unity times a real number

Now compute the gcd of these polynomials, compute the roots of the gcd numerically, and check whether these roots are on the lines $\{t\zeta:t\in\mathbb{R}\}$. …
Jan-Christoph Schlage-Puchta's user avatar