English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study a random bisection problem where an interval of length x is cut into two random fragments at the first stage, then each of these two fragments is cut further, etc. We compute the probability P(n)(x) that at the nth stage, each of 2(n) fragments is shorter than 1. We show that P(n)(x) approaches a traveling wave form, and the front position x(n) increases as x(n) approximately n(beta)rho(n) for large n with rho = 1.261 076ellipsis and beta = 0.453 025ellipsis. We also solve the m-section problem where each interval is broken into m fragments and show that rho(m) approximately m/(lnm) and beta(m) approximately 3/(2lnm) for large m. Our approach establishes an intriguing connection between extreme value statistics and traveling wave propagation in the context of the fragmentation problem.

Traveling Waves, Front Selection, and Exact Nontrivial Exponents in a Random Fragmentation Problem