QSS

I’ve opened a technical discussion on Math StackExchange about a text segmentation problem with structural constraints (probability / combinatorics).

The exchange is ongoing with mathematicians and computer scientists, discussing approaches such as dynamic programming, bounds, and asymptotic estimates.

If you’re interested in following the discussion (or contributing), here’s the link:

👉 https://math.stackexchange.com/questions/5123168/probability-of-existence-of-a-valid-global-pagination-under-palindrome-line-init

Feel free to read along — the conversation is evolving.