Intersection Distribution: Unified Perspective

• Intersection Distribution is a family of constructions that measure how objects intersect, capturing multiplicities and normalized counts across various mathematical settings.
• It bridges diverse fields such as finite-field incidence theory, random intersection graphs, and geometric probability, offering unified tools to analyze deterministic and random intersections.
• The study employs algebraic, combinatorial, and probabilistic methods to derive concrete invariants, enabling practical applications in network theory, computational geometry, and beyond.

In current arXiv literature, “intersection distribution” is not a single invariant but a family of distributional constructions centered on how objects intersect: the graph of a finite-field polynomial with affine lines, long geodesics with each other, random attribute sets in network models, independent random sets in finite spaces, and random flats in hyperbolic space (Li et al., 2020, Jaramillo, 2013, Bloznelis, 2014, Klein, 2018, Sönmez et al., 2024). Across these settings, the common theme is that intersections are not treated only as binary events; instead, one studies the full law of intersection multiplicities, normalized intersection counts, overlap-induced degree statistics, or the distribution of the geometric location of the intersection itself.

1. Finite-field incidence theory

In the finite-geometry literature initiated by Li and Pott, the intersection distribution of a polynomial $f\in\mathbb{F}_q[x]$ is defined by

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$

Equivalently, $v_i(f)$ counts the number of non-vertical affine lines $y=bx+c$ in $AG(2,q)$ that meet the graph

$\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$

in exactly $i$ points. The quantity $v_0(f)$ is the non-hitting index (Li et al., 2020).

A refinement is the multiplicity distribution at fixed slope $b$,

$$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$

with

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$0

The same paper relates the affine definition to a projective one. For a $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$1-set $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$2, one sets

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$3

and for

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$4

one has

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$5

This embeds the polynomial problem into the secant structure of a projective $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$6-set. The point $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$7 is an internal nucleus of $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$8, and conversely every $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$9-set with an internal nucleus is projectively equivalent to some $v_i(f)$0 (Li et al., 2020).

The non-hitting index has both geometric and algebraic interpretations. Writing

$v_i(f)$1

the paper gives

$v_i(f)$2

For polynomials, the extremal bounds are

$v_i(f)$3

The lower bound is attained exactly by linear polynomials, while the upper bound is attained exactly when $v_i(f)$4 is a $v_i(f)$5-arc; in even characteristic this is tied to o-polynomials, and in odd characteristic to functions projectively equivalent to $v_i(f)$6 (Li et al., 2020).

Subsequent work sharpens the projective viewpoint. In particular, for a polynomial

$v_i(f)$7

any polynomial of the form

$v_i(f)$8

with $v_i(f)$9, is projectively equivalent to $y=bx+c$0. When $y=bx+c$1 has exactly one internal nucleus, this form characterizes all projective equivalents. The same work elevates the degree of $y=bx+c$2,

$y=bx+c$3

to a central invariant, namely the index of the largest non-zero entry in the intersection distribution (Huczynska et al., 6 Oct 2025).

2. Cubic polynomials, monomials, and algebraic applications

For degree-three polynomials, the intersection distribution is completely explicit. After affine normalization, every cubic is of the form $y=bx+c$4, and the distribution depends only on the characteristic and on whether $y=bx+c$5 in characteristic $y=bx+c$6. For $y=bx+c$7,

$y=bx+c$8

For $y=bx+c$9 and $AG(2,q)$0,

$AG(2,q)$1

whereas for $AG(2,q)$2 and $AG(2,q)$3,

$AG(2,q)$4

These formulas exhaust all degree-three polynomials over $AG(2,q)$5 (Kyureghyan et al., 2020).

The same paper begins the classification of monomials $AG(2,q)$6 having the same intersection distribution as $AG(2,q)$7. It identifies several infinite families, including $AG(2,q)$8 in characteristic $AG(2,q)$9 under $\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$0, $\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$1 in characteristic $\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$2 under $\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$3, and, for $\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$4, $\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$5 together with the inverse exponent when $\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$6 and $\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$7 is odd. The analysis is organized through

$\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$8

whose value multiplicities control how secant lines to the graph of $\Gamma_f=\{(x,f(x)):x\in\mathbb{F}_q\}$9 are distributed (Kyureghyan et al., 2020).

A later paper resolves two conjectural characteristic-$i$0 families by proving that two classes of power functions have

$i$1

The proof uses the multivariate method and QM-equivalence on $i$2-to-$i$3 mappings, with the key step being the counting of solutions of low-degree equations (Li et al., 2020).

The cubic distributions also support explicit combinatorial constructions. Over $i$4, if $i$5 has the characteristic-$i$6 cubic distribution above, then the block set

$i$7

defines an $i$8. The same incidence data also produces infinite families of Kakeya sets in affine planes with previously unknown sizes (Kyureghyan et al., 2020).

3. Random intersection graphs and overlap-induced network laws

In network theory, “intersection” is literal set intersection. In the inhomogeneous random intersection graph $i$9, one starts from a bipartite graph between actors

$v_0(f)$0

and attributes

$v_0(f)$1

with edge probabilities

$v_0(f)$2

where $v_0(f)$3 and $v_0(f)$4 are i.i.d. weights. Two actors are adjacent iff their attribute sets intersect: $v_0(f)$5 The degree-degree distribution of adjacent vertices is

$v_0(f)$6

In the clustering regime $v_0(f)$7, this converges to a non-factorizable law $v_0(f)$8, whereas in the non-clustering regime $v_0(f)$9,

$b$0

so the endpoint degrees of a random edge become asymptotically independent up to size biasing. The non-factorizable form in the clustering regime reflects the random size of the shared witness attribute and is the mechanism behind positive assortativity (Bloznelis, 2014).

A related weighted model assigns each vertex $b$1 a random weight $b$2 and connects it to each of

$b$3

groups with probability

$b$4

Two vertices are adjacent iff their assigned subsets intersect. In this model, the degree distribution undergoes a regime change: for $b$5 it degenerates at $b$6; for $b$7 it converges conditionally on $b$8 to a compound Poisson law; and for $b$9 it converges to $$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$0. In the critical regime $$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$1, the clustering coefficient converges to

$$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$2

while heavy-tailed $$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$3 produce heavy-tailed degrees (Deijfen et al., 2015).

Minimal-moment versions of these degree laws are also available. In the inhomogeneous model, the asymptotic degree distribution of the typical vertex remains a mixed compound Poisson law under the weaker assumptions $$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$4 and $$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$5; in the passive random intersection graph, the compound Poisson limit persists once one assumes convergence in distribution of the subset size and convergence of its first moment (Bloznelis, 2019). For multitype random intersection graphs, typical graph distances have a defective law described by a mixture of translated and scaled Gumbel distributions, with the missing mass corresponding to the event that two vertices are not in the same component (Barbour et al., 2010).

4. Geometric probability, geodesics, and intersections of constraint sets

On a compact oriented surface $$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$6 of genus $$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$7 with constant negative curvature $$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$8, the normalized geometric intersection number of long closed geodesics concentrates around the Liouville-current constant

$$M_i(f,b)=\bigl|\{c\in\mathbb{F}_q: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions}\}\bigr|,$$9

More precisely, for every $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$00 there exists $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$01 such that

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$02

as $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$03 with $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$04. The same constant governs self-intersections: $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$05 and the normalized average of pairwise intersection numbers converges to $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$06 (Jaramillo, 2013).

For random flats in hyperbolic space, the object of study changes from counts to the distribution of the intersection itself. Let $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$07 be a uniform random $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$08-flat through an origin $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$09 in $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$10, $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$11, and let $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$12 be an independent random $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$13-flat uniformly distributed among those hitting a hyperbolic ball of radius $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$14. Then $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$15 is a random $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$16-flat, but unlike the Euclidean case it can be empty with strictly positive probability. The distribution of

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$17

with the convention $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$18 when the intersection is empty, has an atom at $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$19 and an absolutely continuous part on $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$20. As $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$21 and $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$22, the model exhibits a phase transition controlled by $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$23: if $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$24, the intersection probability tends to $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$25; if $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$26, it tends to $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$27; and if $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$28, it converges to a nontrivial limit $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$29 (Sönmez et al., 2024).

A distinct high-dimensional usage studies the uniform distribution on the geometric intersection

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$30

the intersection of a simplex and a sphere. For $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$31, low-dimensional marginals converge to a product measure with density proportional to $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$32; for $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$33, fixed marginals converge to $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$34 while the largest coordinate localizes according to

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$35

The transition at $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$36 separates a delocalized regime from a localized one (Chatterjee, 2010).

5. Abstract probabilistic formulations

For random sets on a finite discrete space $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$37, the distribution of the intersection itself becomes the primary object. A random set $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$38 is determined by a mass function

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$39

If $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$40 and $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$41 are independent, then the distribution of $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$42 is the conjunctive rule

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$43

At the level of commonalities, or inclusion functionals,

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$44

independence yields the factorization

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$45

If $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$46 is the $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$47-distance between commonality vectors, then for every fixed random set $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$48,

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$49

Thus intersecting with a fixed independent random set is $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$50-Lipschitz in the commonality metric. The dual statement for unions uses plausibility, or hitting functionals, and the disjunctive rule (Klein, 2018).

A nearby but distinct concept is the intersection property of conditional independence,

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$51

For continuous densities, the relevant criterion is geometric: for each $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$52 with $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$53, the path-connected components of

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$54

must all be equivalent under coordinate-wise connectivity. Strict positivity of the density and path-connected support are sufficient, but not necessary, for the property to hold (Peters, 2014). This distinction is important because “intersection distribution” and “intersection property” refer to different objects: one to a distributional law of intersections, the other to an axiom of conditional independence.

6. Spatial and computational viewpoints

In stochastic-geometry models for urban networks, the relevant object is the distance distribution from a typical street intersection. In the Manhattan Poisson line Cox process, one conditions on a typical horizontal and vertical line crossing at the origin and places a 1D Poisson process of intensity $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$55 on every line. If $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$56 denotes the $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$57-th nearest path distance from the typical intersection to the Cox points, then

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$58

where $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$59 is the probability of exactly $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$60 nodes in the $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$61-ball $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$62. For general $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$63, $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$64 is expressed as a sum over the integer partition function $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$65, which makes the exact CDF numerically tractable for practical values of $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$66. These distributions are proposed for $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$67-coverage of RSUs at intersections and for network-load dimensioning in V2X systems (Koufos et al., 2020).

A computationally different use of intersection structure appears in data distribution management. There the basic problem is to identify all intersecting pairs between two collections of $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$68-dimensional axis-aligned rectangles. The Interval Tree Matching algorithm stores one family of 1D projections in an interval tree and queries it with the other family, yielding an intersection matrix

$$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$69

The query phase is embarrassingly parallel because each update interval can be processed independently against the read-only tree. The reported experiments show that the sequential implementation is competitive with sort-based matching and that the parallel implementation provides good speedup on shared-memory multicore processors (Marzolla et al., 2013).

Taken together, these strands suggest that “intersection distribution” functions as a unifying statistical idea rather than a single formalism. In finite geometry it records secant multiplicities of polynomial graphs; in random intersection graphs it describes overlap-induced degree laws; in negatively curved geometry it governs normalized intersection counts or the law of the intersection flat itself; in random-set theory it is the exact distribution of $$v_i(f)=\bigl|\{(b,c)\in\mathbb{F}_q^2: f(x)-bx-c=0 \text{ has exactly } i \text{ solutions in }\mathbb{F}_q\}\bigr|, \qquad 0\le i\le q.$$70; and in spatial-network models it controls service radii measured from a typical intersection. The term is therefore best understood contextually, with the surrounding invariants—non-hitting index, commonality, clustering regime, normalized intersection density, or distance from the origin—specifying which distributional object is under study.