Skip to main content
15 events
when toggle format what by license comment
Jan 10, 2020 at 20:59 comment added Martin Brandenburg Just to catch up here, the answers so far don't give a full solution yet, right?
Nov 18, 2019 at 18:37 answer added Will Sawin timeline score: 4
Nov 18, 2019 at 16:40 answer added Valery Isaev timeline score: 4
Nov 18, 2019 at 11:23 comment added Ivan Di Liberti The paper "Colimits of Monads" by Jiri Adamek might be relevant for glueing monads in order to obtain more complex sequences from easier ones.
Nov 18, 2019 at 11:07 comment added Ivan Di Liberti $a_n = 2^{a_{n-1}}$ is the trace of the powerset monad. Combining this and the previous example one can probably approximate or even precisely shape a lot of (strictly increasing?) sequences.
Nov 18, 2019 at 11:00 comment added Ivan Di Liberti Every sequence of the form $a_n = p(n)$ is the trace of a polynomial monad. Be careful, the polynomial is always the same and has positive coefficients.
Nov 18, 2019 at 10:53 comment added Ivan Di Liberti By the triangular equalities, you get that $a_{a_n} \geq a_n$.
Nov 18, 2019 at 10:41 comment added David Roberts You definitely need $a_n \gt 0$ for all $n\gt 0$, but $a_0=0$ is possible (eg taking for $T$ the identity functor)
Nov 18, 2019 at 10:39 history edited David Roberts CC BY-SA 4.0
cleaned up notation, added link and tag
S Nov 18, 2019 at 8:32 history edited GNiklasch CC BY-SA 4.0
mathbb N
S Nov 18, 2019 at 8:32 history suggested Daniele Tampieri CC BY-SA 4.0
Math Jaxed
Nov 18, 2019 at 8:00 review Suggested edits
S Nov 18, 2019 at 8:32
Nov 18, 2019 at 7:25 review Low quality posts
Nov 18, 2019 at 8:35
Nov 18, 2019 at 7:10 review First posts
Nov 18, 2019 at 8:00
Nov 18, 2019 at 7:07 history asked Felix Dilke CC BY-SA 4.0