On the base sequence conjecture

Details On the base sequence conjecture On the base sequence conjecture

2010-03-07

arxiv.org/abs/1003.1454v1

Discrete Math. 310 (2010) 1956-1964

Mathematics

Combinatorics

19 pages, 10 tables. To appear in Discrete Mathematics.

Scientific paper

Let BS(m,n) denote the set of base sequences (A;B;C;D), with A and B of length m and C and D of length n. The base sequence conjecture (BSC) asserts that BS(n+1,n) exist (i.e., are non-empty) for all n. This is known to be true for n <= 36 and when n is a Golay number. We show that it is also true for n=37 and n=38. It is worth pointing out that BSC is stronger than the famous Hadamard matrix conjecture. In order to demonstrate the abundance of base sequences, we have previously attached to BS(n+1,n) a graph Gamma_n and computed the Gamma_n for n <= 27. We now extend these computations and determine the Gamma_n for n=28,...,35. We also propose a conjecture describing these graphs in general.

Affiliated with

Also associated with

No associations

Rating

On the base sequence conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the base sequence conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the base sequence conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-668042