The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics (Q1102973): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0095-8956(90)90095-h / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2064283091 / rank | |||
Normal rank |
Latest revision as of 10:20, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics |
scientific article |
Statements
The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics (English)
0 references
1990
0 references
Let q be a power of a prime and let s be zero or a prime not dividing q. Then the number of points in a combinatorial geometry (or simple matroid of rank n which is representable over GF(q) and a field of characteristic s is at most \((q^{\nu}-q^{\nu -1})\left( \begin{matrix} n+1\\ 2\end{matrix} \right)-n,\) where \(\nu =2^{q-1}-1\). The proof uses the notion of the long-line graph introduced in an earlier paper [Q. J. Math. Oxf., II. Ser. 39, 223-234 (1988)].
0 references
combinatorial geometry
0 references
matroid
0 references
growth rates
0 references
representability
0 references
integer matrices
0 references