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

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:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.11769/365572
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact