Timeline for Is the small Davenport constant for $S_n$, $d(S_n)=n(n-1)/2$?
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 13 at 15:34 | comment | added | LSpice | @DavidRoberts, re, I did not mean to say that it was the customary spelling, only intentional, and that my understanding was that it's recommended to preserve the author's intent whenever possible. But, if it's not in this case, then the occurrence of "small davenport constant" in the body should also be changed. | |
| Jul 13 at 3:23 | comment | added | David Roberts♦ | @LSpice cf the title of doi.org/10.1016/j.jcta.2022.105617, page 2 of doi.org/10.37705/TechTrans/e2020027, page 720 of jtnb.cedram.org/item?id=JTNB_2011__23_3_715_0, abstract of arxiv.org/abs/1211.2614 etc | |
| Jul 12 at 23:59 | comment | added | LSpice | @DavidRoberts, about the edit, I took the "davenport" in the title to be intentional, per the usage in the post: there is the large-D Davenport constant $D$, and the small-d davenport constant $d$. (I am not sure how I would feel about this were it my name in play, but it seemed to be intentional.) | |
| Jul 10 at 18:22 | vote | accept | Mikel Martinez Puente | ||
| Jul 10 at 8:16 | history | edited | Mikel Martinez Puente | CC BY-SA 4.0 |
added 9 characters in body
|
| Jul 10 at 8:10 | comment | added | Fedor Petrov | @MikelMartinezPuente ah, ok. I would call it a "multiset", not a "sequence". | |
| Jul 10 at 3:18 | history | edited | David Roberts♦ | CC BY-SA 4.0 |
capitalise the name in title
|
| Jul 10 at 2:05 | answer | added | Noam D. Elkies | timeline score: 9 | |
| Jul 10 at 1:39 | comment | added | Mikel Martinez Puente | @FedorPetrov We are using that a sequence is one-product free if there is no subsequence with product one in ANY order. Thus, for n=4 for example we have (12)(34)(13)(24)(14)(23)=1. | |
| Jul 10 at 1:29 | history | edited | Mikel Martinez Puente | CC BY-SA 4.0 |
added 2 characters in body
|
| Jul 9 at 17:58 | comment | added | Fedor Petrov | The sequence of all $n\choose 2$ transpositions (in the lexicographic order) is 1-product free, right? | |
| Jul 9 at 17:23 | comment | added | LSpice | Your link to "another post" is to a comment by @PeterTaylor, itself linking to Sage code. Was that what you intended? Might you have meant to link to the answer on which it is a comment? | |
| Jul 9 at 17:22 | history | edited | Sam Hopkins | CC BY-SA 4.0 |
added 10 characters in body
|
| Jul 9 at 17:10 | history | asked | Mikel Martinez Puente | CC BY-SA 4.0 |