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 laurent-polynomials
Search options answers only
not deleted
user 4312
4
votes
Constant term extraction using combinatorial Nullstellensatz
The argument below works only for odd $r$. This is annoying, but I do not see how to modify it for even $r$. Of course, there is a simple argument without CN, but I guess it is not what you ask for.
W …
- 109k
7
votes
Idempotent Laurent polynomials (in noncommuting variables)
No, it can not. $R$ is a group ring of the free group with $n$ generators. This group is locally indicable (any non-trivial subgroup has a homomorphism onto $\mathbb{Z}$), thus by result of Higman (Hi …
- 109k