Timeline for Mixing coded systems and period of their graph presentations
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 8, 2014 at 20:56 | comment | added | Dominik Kwietniak | But this does not answer my question. It is an answer to a question of user39115 stated in comments. I asked the following: Does there exists a mixing coded system X such that for every graph G representing X the lcd of all lengths of periods of loops in G is greater than 1? | |
S Apr 29, 2014 at 8:15 | review | Late answers | |||
Apr 29, 2014 at 8:46 | |||||
S Apr 29, 2014 at 8:15 | review | First posts | |||
Apr 29, 2014 at 8:49 | |||||
Apr 29, 2014 at 7:59 | history | answered | M. Dabbaghian | CC BY-SA 3.0 |