Search arXivSearch

arXiv · 2510.04675

The Intersection Distribution: New Results and Perspectives

Abstract

Intersection distribution and non-hitting index are concepts introduced recently by Li and Pott as a new way to view the behaviour of a collection of finite field polynomials. With both an algebraic interpretation via the intersection of a polynomial with a set of lines, and a geometric interpretation via a $(q+1)$-set possessing an internal nucleus, the concepts have proved their usefulness as a new way to view various long-standing problems, and have applications in areas such as Kakeya sets. In this paper, by exploiting connections with diverse areas including the theory of algebraic curves, cyclotomy and the enumeration of irreducible polynomials, we establish new results and resolve various Open Problems of Li and Pott. We prove geometric results which shed new light on the relationship between intersection distribution and projective equivalence of polynomials, and algebraic results which describe and characterise the degree of $S_f$ - the index of the largest non-zero entry in the intersection distribution of $f$. We provide new insights into the non-hitting spectrum, and show the limitations of the non-hitting index as a tool for characterisation. Finally, the benefits provided by the connections to other areas are evidenced in two short new proofs of the cubic case.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sophie Huczynska, Lukas Klawuhn, Maura B. Paterson. 2025-10-31. The Intersection Distribution: New Results and Perspectives. https://doi.org/10.1016/j.ffa.2026.102828

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO