Previous Page 2

Displaying 21 – 31 of 31

Showing per page

On sets of vectors of a finite vector space in which every subset of basis size is a basis

Simeon Ball (2012)

Journal of the European Mathematical Society

It is shown that the maximum size of a set S of vectors of a k -dimensional vector space over 𝔽 q , with the property that every subset of size k is a basis, is at most q + 1 , if k p , and at most q + k p , if q k p + 1 4 , where q = p k and p is prime. Moreover, for k p , the sets S of maximum size are classified, generalising Beniamino Segre’s “arc is a conic” theorem. These results have various implications. One such implication is that a k × ( p + 2 ) matrix, with k p and entries from 𝔽 p , has k columns which are linearly dependent. Another is...

The Nonexistence of some Griesmer Arcs in PG(4, 5)

Landjev, Ivan, Rousseva, Assia (2008)

Serdica Journal of Computing

In this paper, we prove the nonexistence of arcs with parameters (232, 48) and (233, 48) in PG(4,5). This rules out the existence of linear codes with parameters [232,5,184] and [233,5,185] over the field with five elements and improves two instances in the recent tables by Maruta, Shinohara and Kikui of optimal codes of dimension 5 over F5.

Currently displaying 21 – 31 of 31

Previous Page 2