We consider a recursive algorithm for constructing an ordered system of generators of a symmetric group of degree n. We show that the number of transpositions that form this system is O(n log 2 2 n). This is only by a factor of log2 n greater in order than the lower bound on the number of transpositions in such a system.
Problems of Information Transmission – Springer Journals
Published: Oct 23, 2009
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud