Timeline for Question on weights and minimal degree
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2013 at 10:15 | vote | accept | Freddy | ||
| Jun 11, 2013 at 9:56 | history | edited | user34821 | CC BY-SA 3.0 |
added 123 characters in body
|
| Jun 11, 2013 at 9:28 | comment | added | user34821 | ok, I think that's correct in the general case: for $n\geq 2, k>n$, then if $F$ is, up to reordering, the minimal element of $B_k$ in the lexicographic ordering, then there are infinitely many $w's$ for which you have a positive answer to your question. It's probably true that this condition is also sufficient, i.e. if $F$ is not minimal, then there are no solutions. | |
| Jun 11, 2013 at 9:16 | history | answered | user34821 | CC BY-SA 3.0 |