We use two main techniques, namely, residuation and separators of points, to show that the Hilbert function of a certain fat point set supported on a grid complete intersection is the same as the Hilbert function of a reduced set of points called a partial intersection. As an application, we answer a question of TohÇŽneanu and Van Tuyl which relates the minimum Hamming distance of a special linear code and the minimum socle degree of the associated fat point set. (on line May 2019)
Fat Points, partial intersections and Hamming distance
Guardo E.
2020-01-01
Abstract
We use two main techniques, namely, residuation and separators of points, to show that the Hilbert function of a certain fat point set supported on a grid complete intersection is the same as the Hilbert function of a reduced set of points called a partial intersection. As an application, we answer a question of TohÇŽneanu and Van Tuyl which relates the minimum Hamming distance of a special linear code and the minimum socle degree of the associated fat point set. (on line May 2019)File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
Cooper_Guardo_may_3_2018.pdf
solo gestori archivio
Descrizione: articolo principale
Tipologia:
Documento in Pre-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
364.59 kB
Formato
Adobe PDF
|
364.59 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.