Skip to main content
11 events
when toggle format what by license comment
Jun 15, 2020 at 7:27 history edited CommunityBot
Commonmark migration
Apr 13, 2017 at 12:58 history edited CommunityBot
replaced http://mathoverflow.net/ with https://mathoverflow.net/
Feb 1, 2017 at 2:41 comment added Will Sawin @KeD In the general version I want the answer for arbitrary $\alpha_0,\dots,\alpha_15$. That might be too much to ask! I would be interested even in the answer for a single new case (new modulo the symmetries of the problem, of course).
Feb 1, 2017 at 2:38 comment added KeD Hi @WillSawin, what are the $\alpha_i$'s in the general version of the combinatorial problem?
Jan 20, 2017 at 15:05 comment added Abdelmalek Abdesselam @user44191: what do you mean by $i_{m,A}(x)$? If this is the determinant map $(A^{\otimes m})^{\otimes n^m}\rightarrow k$ then the result on $x\in A$ is identically zero.
Jan 20, 2017 at 7:14 comment added user44191 Is there any specific reason not to look at the simpler question of: What is the set of elements of $A$ such that for all but finitely many $m, i_{m, A}(x) = 0$? If I'm not mistaken, it should answer your question directly, too, no?
Jan 20, 2017 at 3:43 comment added Will Sawin @SylvainJULIEN The second one. Fixed now.
Jan 20, 2017 at 3:43 history edited Will Sawin CC BY-SA 3.0
added 1 character in body
Jan 19, 2017 at 21:00 comment added Sylvain JULIEN +1 for the probably unintended pun with M&M's. More seriously, do you mean $ \sigma(x)x $ or $ \sigma(x)-x $?
Jan 19, 2017 at 20:12 history edited Abdelmalek Abdesselam CC BY-SA 3.0
fixed spelling of my name :)-
Jan 19, 2017 at 18:28 history asked Will Sawin CC BY-SA 3.0