Timeline for Combinatorics of resultants
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25, 2013 at 16:33 | vote | accept | minar | ||
| Jul 22, 2013 at 19:35 | history | edited | Igor Rivin | CC BY-SA 3.0 |
fixed typo
|
| Jul 22, 2013 at 18:51 | comment | added | minar | Thanks for the pointer. As @David Speyer noted, it addresses the sparse case and it is not clear whether the bound will be tight for the dense case ($r=m+1$ and $s=n+1$). At least, it gives a starting point. | |
| Jul 22, 2013 at 18:06 | comment | added | David E Speyer | Seems a little off target: This answers the question for $f$ and $g$ sparse (with $r$ and $s$ nonzero terms respectively). The closest I can do for the question where all coefficients are nonzero is Gelfand, Kapranov, Zelevinsky "Newton polytopes of the classical resultant and discrimant", but they don't really answer the question either. | |
| Jul 22, 2013 at 17:52 | history | answered | Igor Rivin | CC BY-SA 3.0 |