CORE
CO
nnecting
RE
positories
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Research partnership
About
About
About us
Our mission
Team
Blog
FAQs
Contact us
Community governance
Governance
Advisory Board
Board of supporters
Research network
Innovations
Our research
Labs
research
Minimal generation of transitive permutation groups
Authors
Gareth M. Tracey
Publication date
1 January 2018
Publisher
Doi
View
on
arXiv
Abstract
It is proved in [21] that there is a constant
c
c
c
such that each transitive permutation group of degree
d
≥
2
d\ge 2
d
≥
2
can be generated by
⌊
c
d
/
log
d
⌋
\lfloor cd/\sqrt{\log{d}}\rfloor
⌊
c
d
/
lo
g
d
⌋
elements. In this paper, we explicitly estimate
c
c
c
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
University of Birmingham Research Portal
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.atira.dk:publications...
Last time updated on 04/01/2022
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1016%2Fj.jalgebra....
Last time updated on 02/11/2020
University of Birmingham Research Portal
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.atira.dk:openaire_cri...
Last time updated on 14/12/2021