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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $g$, $h$ be a random pair of generators of $G=Sym(n)$ or $G=Alt(n)$. Weshow that, with probability tending to $1$ as $n\to \infty$, (a) the diameterof $G$ with respect to $S = \{g,h,g^{-1},h^{-1}\}$ is at most $O(n^2 (\logn)^c)$, and (b) the mixing time of $G$ with respect to $S$ is at most $O(n^3(\log n)^c)$. (Both $c$ and the implied constants are absolute.)  These bounds are far lower than the strongest worst-case bounds known (inHelfgott--Seress, 2013); they roughly match the worst known examples. We alsogive an improved, though still non-constant, bound on the spectral gap.  Our results rest on a combination of the algorithm in (Babai--Beals--Seress,2004) and the fact that the action of a pair of random permutations is almostcertain to act as an expander on $\ell$-tuples, where $\ell$ is an arbitraryconstant (Friedman et al., 1998).

Random generators of the symmetric group: diameter, mixing time and spectral gap