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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The $d$-Simultaneous Conjugacy problem in the symmetric group $S_n$ askswhether there exists a permutation $\tau \in S_n$ such that $b_j = \tau^{-1}a_j\tau$ holds for all $j = 1,2,\ldots, d$, where $a_1, a_2,\ldots , a_d$ and$b_1, b_2,\ldots , b_d$ are given sequences of permutations in $S_n$. The timecomplexity of existing algorithms for solving the problem is $O(dn^2)$. We showthat for a given positive integer $d$ the $d$-Simultaneous Conjugacy problem in$S_n$ can be solved in $o(n^2)$ time.

A subquadratic algorithm for the simultaneous conjugacy problem