Intersection problems for linear codes and polynomials over finite fields
Sam Adriaensen

TL;DR
This paper establishes a stability result for intersecting families of polynomials over finite fields, showing large intersecting families are essentially contained within a star, extending to homogeneous polynomials and linear codes.
Contribution
It proves a stability theorem for intersecting polynomial families over finite fields and extends the framework to linear codes using projective geometry.
Findings
Large intersecting polynomial families are contained in a star if sufficiently big.
The stability result applies to homogeneous polynomials and linear codes.
The proof uses geometric analysis of projective systems associated with codes.
Abstract
This paper proves a stability result for a variation of the Erd\H{o}s-Ko-Rado theorem in the context of polynomials over finite fields. Let be a family of polynomials of degree at most in . Call intersecting if for any two polynomials in , there exists a point for which . An intersecting family is called a star if it consists of all polynomials with such that for some fixed points . In this paper we prove that if is an intersecting family with , then is contained in a star. In fact, we prove that this is still true if we also evaluate the polynomials "at infinity", which is equivalent to studying the problem for homogeneous bivariate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Polynomial and algebraic computation · Finite Group Theory Research
