Skip to main content
AClockTicks's user avatar
AClockTicks's user avatar
AClockTicks's user avatar
AClockTicks
  • Member for 10 years, 8 months
  • Last seen more than 10 years ago
comment
Calculating the probability that all possible length $r$ subwords exists in a string, with or without overlaps allowed
Let's scratch (2) because its too hard. But for (1) I was hoping for either an exact expression OR some approximate expression that works well for strings with $L \geq 10$ and $q \geq 2$ or so. I'm less interested in asymptotics, but that's not to say I didn't appreciate the paper.
comment
Calculating the probability that all possible length $r$ subwords exists in a string, with or without overlaps allowed
From the paper (researchgate.net/publication/…) I don't think there's going to be a reasonable analytic expression for the exact probability for (1). Scenario (2) seems hopeless. Do you agree with this?
awarded
comment
Calculating the probability that all possible length $r$ subwords exists in a string, with or without overlaps allowed
@BrendanMcKay Sorry for the typo, it should now be fixed. Also, thanks in general for your comment - this ended up being tricky for me to work out and I feel relieved to know at least one other person doesn't think the problem is trivial.
Loading…
awarded
Loading…