Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Minimum distance functions of complete intersections (1601.07604v4)

Published 28 Jan 2016 in math.AC, cs.IT, math.AG, math.CO, and math.IT

Abstract: We study the footprint function, with respect to a monomial order, of complete intersection graded ideals in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection, we give a formula for the footprint function and a sharp lower bound for the corresponding minimum distance function. This allows us to recover a formula for the minimum distance of an affine cartesian code and the fact that in this case the minimum distance and the footprint functions coincide. Then we present an extension of a result of Alon and F\"uredi, about coverings of the cube ${0,1}n$ by affine hyperplanes, in terms of the regularity of a vanishing ideal.

Citations (17)

Summary

We haven't generated a summary for this paper yet.