Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry

DOI10.1016/J.JCTA.2015.03.011MaRDI QIDQ2347979zbMATH OpenOpenAlexFDO

Authors Zipei Nie, Anthony Y. Wang

Publication date 10 June 2015

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.3018

zbMATH Keywords

finite field KakeyaFKG inequalitygraded monomial orderHilbert functionmethod of multiplicitiespolynomial method

Mathematics Subject Classification ID

Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Finite ground fields in algebraic geometry (14G15)

Abstract: The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state the theorem is via a sort of bounded degree Zariski closure operation: given a set, we consider all polynomials of some bounded degree vanishing on that set, and then the common zeros of these polynomials. For example, the degree d closure of d + 1 points on a line will contain the whole line, as any polynomial of degree at most d vanishing on the d + 1 points must vanish on the line. Our result is a bound on the size of a finite degree closure of a given set. Finally, we adapt our use of Hilbert functions to the method of multiplicities.

Recommendations

• Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
• scientific article; zbMATH DE number 6603592
• scientific article; zbMATH DE number 1342085
• scientific article; zbMATH DE number 6536324
• Combinatorial Nullstellensatz

Cites work

• Algebraic curves over a finite field
• An improved lower bound on the size of Kakeya sets over finite fields
• Colorings and orientations of graphs
• Combinatorial Nullstellensatz
• Correlation inequalities on some partially ordered sets
• Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
• On the size of Kakeya sets in finite fields
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(14)

• Generalized Hamming weights of affine Cartesian codes
• On hitting-set generators for polynomials that vanish rarely
• Covering symmetric sets of the Boolean cube by affine hyperplanes
• Relative generalized Hamming weights of affine Cartesian codes
• On the Hilbert function of complementary set families
• On the Hilbert schemes of finite algebras over an algebraically closed field
• Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression
• Quantified Derandomization: How to Find Water in the Ocean
• Parity helps to compute majority
• Sharp Effective Finite-Field Nullstellensatz
• On hitting-set generators for polynomials that vanish rarely
• Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes
• A robust version of Hegedűs's lemma, with applications
• Hilbert functions and low-degree randomness extractors

This page was built for publication: Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347979)