Name
Abstract | ||
|---|---|---|
Letq be a prime power not divisible by 3. We show that the number of points (or rank-1 flats) in a combinatorial geometry (or simple matroid) of rankn representable over GF(3) and GF(q) is at mostn2. Whenq is odd, this bound is sharp and is attained by the Dowling geometries over the cyclic group of order 2. |
Year | DOI | Venue |
|---|---|---|
1990 | https://doi.org/10.1007/BF02187781 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Discrete Comput Geom,Prime Power,Rank Function,Line Incident,Minimum Rank | Matroid,Discrete geometry,Discrete mathematics,Combinatorics,Cyclic group,Prime power,Mathematics | Journal |
Volume | Issue | ISSN |
5 | 1 | 0179-5376 |
Citations | PageRank | References |
4 | 0.91 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joseph P. S. Kung | 1 | 78 | 20.60 |