Multisets with few special directions and small weight codewords in Desarguesian planes
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917224092008448 |
|---|---|
| author | Adriaensen, Sam Szőnyi, Tamás Weiner, Zsuzsa |
| author_facet | Adriaensen, Sam Szőnyi, Tamás Weiner, Zsuzsa |
| contents | In this paper, we tie together two well studied topics related to finite Desarguesian affine and projective planes. The first topic concerns directions determined by a set, or even a multiset, of points in an affine plane. The second topic concerns the linear code generated by the incidence matrix of a projective plane. We show how a multiset determining only $k$ special directions, in a modular sense, gives rise to a codeword whose support can be covered by $k$ concurrent lines. The reverse operation of going from a codeword to a multiset of points is trickier, but we describe a possible strategy and show some fruitful applications.
Given a multiset of affine points, we use a bound on the degree of its so-called projection function to yield lower bounds on the number of special directions, both in an ordinary and in a modular sense.
In the codes related to projective planes of prime order $p$, there exists an odd codeword, whose support is covered by 3 concurrent lines, but which is not a linear combination of these 3 lines. We generalise this codeword to codewords whose support is contained in an arbitrary number of concurrent lines. In case $p$ is large enough, this allows us to extend the classification of codewords from weight at most $4p-22$ to weight at most $5p-36$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19201 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Multisets with few special directions and small weight codewords in Desarguesian planes Adriaensen, Sam Szőnyi, Tamás Weiner, Zsuzsa Combinatorics 05B25, 94B05 In this paper, we tie together two well studied topics related to finite Desarguesian affine and projective planes. The first topic concerns directions determined by a set, or even a multiset, of points in an affine plane. The second topic concerns the linear code generated by the incidence matrix of a projective plane. We show how a multiset determining only $k$ special directions, in a modular sense, gives rise to a codeword whose support can be covered by $k$ concurrent lines. The reverse operation of going from a codeword to a multiset of points is trickier, but we describe a possible strategy and show some fruitful applications. Given a multiset of affine points, we use a bound on the degree of its so-called projection function to yield lower bounds on the number of special directions, both in an ordinary and in a modular sense. In the codes related to projective planes of prime order $p$, there exists an odd codeword, whose support is covered by 3 concurrent lines, but which is not a linear combination of these 3 lines. We generalise this codeword to codewords whose support is contained in an arbitrary number of concurrent lines. In case $p$ is large enough, this allows us to extend the classification of codewords from weight at most $4p-22$ to weight at most $5p-36$. |
| title | Multisets with few special directions and small weight codewords in Desarguesian planes |
| topic | Combinatorics 05B25, 94B05 |
| url | https://arxiv.org/abs/2411.19201 |