Skip to main content

Timeline for combinatorics on cyclic sequences

Current License: CC BY-SA 3.0

16 events
when toggle format what by license comment
S Apr 1, 2016 at 11:26 history bounty ended Darío G
S Apr 1, 2016 at 11:26 history notice removed Darío G
Mar 26, 2016 at 16:17 vote accept Darío G
Mar 26, 2016 at 9:50 answer added Moritz Firsching timeline score: 6
S Mar 26, 2016 at 8:19 history bounty started Darío G
S Mar 26, 2016 at 8:19 history notice added Darío G Draw attention
S Mar 24, 2016 at 22:50 history bounty ended CommunityBot
S Mar 24, 2016 at 22:50 history notice removed CommunityBot
Mar 18, 2016 at 14:57 comment added Darío G @JonMarkPerry If $k=1$, then a position $j$ is $2b$ iff $a_j=0$. Since an interval only has one zero at the end, then the element before is $1g1b$. for instance, if the interval ends with $(\ldots,1,0]$ and this 1 is $a_j$, then $U_{1,j}(1)=1$ and $U_{2,j}(1)=0$ (because you start the counting from the position $j$ until the next $0$, which is $a_{j+1}$.
Mar 18, 2016 at 14:37 comment added JMP why don't bad intervals then end with 2b,...,2b?
Mar 17, 2016 at 15:52 comment added JMP oh, okay then..
Mar 17, 2016 at 15:50 comment added Darío G The definition of good intervals includes at least two elements 2g before the first 1g1b, while the neutral intervals have only one element 2g and then 1g1b.
Mar 17, 2016 at 12:39 comment added JMP your definition of a good interval invokes that of a neutral one.
S Mar 16, 2016 at 21:17 history bounty started Darío G
S Mar 16, 2016 at 21:17 history notice added Darío G Draw attention
Mar 14, 2016 at 13:17 history asked Darío G CC BY-SA 3.0