Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

ARSCOM
2004

favoriteEmaildiscussreport

72views more ARSCOM 2004»

Exponential lower bounds for the numbers of Skolem-type sequences

13 years 11 months ago

Exponential lower bounds for the numbers of Skolem-type sequences

Download mcs.open.ac.uk

It was shown by Abrham that the number of pure Skolem sequences of order n, n 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded below by 2 n/3 . These results are extended to give similar lower bounds for the numbers of hooked Skolem sequences, split Skolem sequences and split-hooked Skolem sequences.

G. K. Bennett, Mike J. Grannell, Terry S. Griggs

Real-time Traffic

ARSCOM 2004 | Hooked Skolem Sequences | Pure Skolem Sequences | Skolem Sequences |

claim paper

Related Content

» Lower bounds for modal logics

» Exponential lower bounds for the number of words of uniform length avoiding a pattern

» Lower bounds on multiple sequence alignment using exact 3way alignment

» Average equidistribution and statistical independence properties of digital inversive pseu...

» Lower Bounds for Lucas Chains

» A note on exponential circuit lower bounds from derandomizing ArthurMerlin games

» A lower bound for intuitionistic logic

» kSets Convex Quadrilaterals and the Rectilinear Crossing Number of Kn

» kmeans requires exponentially many iterations even in the plane

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	ARSCOM
Authors	G. K. Bennett, Mike J. Grannell, Terry S. Griggs

Comments (0)