Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Journal of Group Theory

Editor-in-Chief: Parker, Christopher W. / Wilson, John S.

Managing Editor: Khukhro, Evgenii I. / Kramer, Linus

6 Issues per year


IMPACT FACTOR 2016: 0.457
5-year IMPACT FACTOR: 0.521

CiteScore 2016: 0.53

SCImago Journal Rank (SJR) 2016: 0.673
Source Normalized Impact per Paper (SNIP) 2016: 1.049

Mathematical Citation Quotient (MCQ) 2016: 0.43

Online
ISSN
1435-4446
See all formats and pricing
More options …
Volume 11, Issue 6 (Sep 2008)

Issues

On the single-orbit conjecture for uncoverings-by-bases

Robert F. Bailey
  • Robert F. Bailey, School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada. E-mail:
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Peter J. Cameron
  • Peter J. Cameron, School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, United Kingdom. E-mail:
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
Published Online: 2008-09-30 | DOI: https://doi.org/10.1515/jgt.2008.053

Abstract

Let G be a permutation group acting on a finite set Ω. An uncovering-by-bases (or UBB) for G is a set of bases for G such that any r-subset of Ω is disjoint from at least one base in , where , for d the minimum degree of G. The single-orbit conjecture asserts that for any finite permutation group G, there exists a UBB for G contained in a single orbit of G on its irredundant bases. We prove a case of this conjecture, for when G is k-transitive and has a base of size k + 1. Furthermore, in the more restricted case when G is primitive and has a base of size 2, we show how to construct a UBB of minimum possible size.

About the article

Received: 2007-07-18

Revised: 2007-12-03

Published Online: 2008-09-30


Citation Information: Journal of Group Theory, ISSN (Online) 1435-4446, ISSN (Print) 1433-5883, DOI: https://doi.org/10.1515/jgt.2008.053.

Export Citation

Comments (0)

Please log in or register to comment.
Log in