Skip to main content
11 events
when toggle format what by license comment
Jun 28, 2021 at 1:48 comment added Sam Hopkins @MikeEarnest: True; OP should clarify.
Jun 28, 2021 at 0:56 comment added Mike Earnest Assuming that an $L$ can only be matched with a later $R$ (like parentheses), this is not quite the same as walks staying between $x=a$ and $x=-b$. For example, the string $RRRRLLLL$ stays between $x=0$ and $x=-4$, yet it has four unmatched $L$'s and $R$'s.
Jun 26, 2021 at 4:17 comment added Tuhin Mukherjee I have edited the question accordingly
Jun 26, 2021 at 4:16 history edited Tuhin Mukherjee CC BY-SA 4.0
deleted 5 characters in body
Jun 25, 2021 at 18:06 comment added მამუკა ჯიბლაძე @NathanReading In fact "$n$ pairs" can be understood in even more restrictive sense, e. g. forbidding $LLRR$ and allowing $LRRL$
Jun 25, 2021 at 13:47 comment added Sam Hopkins This is the same as walks from $(0,0)$ to $(2n,0)$ with steps of the form $(1,1)$ and $(1,-1)$ that never go above the horizontal line $x=a$ and never go below the horizontal line $x=-b$.
Jun 25, 2021 at 12:26 comment added Nathan Reading But "n pairs" suggests more than "words of even length in the alphabet ${L,R}$. It suggests exactly $n$ instances of $L$ and exactly $n$ instances of $R$. Is that what you mean?
Jun 25, 2021 at 10:13 comment added Tuhin Mukherjee Yes. Precisely, that.
Jun 25, 2021 at 10:11 comment added მამუკა ჯიბლაძე Sorry the formulation is slightly disorienting for me. Why do you say "$n$ pairs"? Do you just mean words of even length in the two letter alphabet?
Jun 25, 2021 at 9:31 history edited Martin Sleziak
added a top-level tag; see: https://meta.mathoverflow.net/questions/1457/why-are-mo-tags-formatted-as-they-are
Jun 25, 2021 at 9:23 history asked Tuhin Mukherjee CC BY-SA 4.0