The smallest known length of an ordered system of generators of a symmetric group

The smallest known length of an ordered system of generators of a symmetric group 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

The smallest known length of an ordered system of generators of a symmetric group

Loading next page...
 
/lp/springer_journal/the-smallest-known-length-of-an-ordered-system-of-generators-of-a-y0mfO5b5Rc
Publisher
SP MAIK Nauka/Interperiodica
Copyright
Copyright © 2009 by Pleiades Publishing, Ltd.
Subject
Engineering; Systems Theory, Control; Information Storage and Retrieval; Electrical Engineering; Communications Engineering, Networks
ISSN
0032-9460
eISSN
1608-3253
D.O.I.
10.1134/S0032946009030053
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Problems of Information TransmissionSpringer Journals

Published: Oct 23, 2009

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

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

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off