Non-Hitting Index in Finite Geometry & Probability

• Non-Hitting Index is a measure that counts how many lines or events do not intersect a specified point set or graph, highlighting avoidance properties.
• In finite geometry, it tracks the complete intersection distribution of (q+1)-sets in PG(2,q), linking combinatorial counts with algebraic structure.
• In stochastic analysis, it quantifies critical thresholds and survival exponents, distinguishing regimes where points are hit with positive probability versus polar behavior.

The term non-hitting index has two closely related uses. In finite geometry and finite-field polynomial theory, it is an explicit numerical invariant counting lines that do not meet a prescribed point set or graph. In stochastic analysis, the same phrase is not always used formally, but several papers identify canonical critical numbers that play the same role: they separate target sets that are hit with positive probability from polar sets, or quantify the long-time decay of survival probabilities. Across these settings, the central theme is the same: a non-hitting index measures how strongly an object avoids intersections, either combinatorially, through incidence counts, or probabilistically, through capacity, Hausdorff measure, and hitting-time asymptotics (Li et al., 2020, Dalang et al., 2018).

1. Finite-geometric definition and basic formalism

In the finite-geometric setting introduced by Li and Pott, the non-hitting index is defined for point sets in the classical projective plane $PG(2,q)$ and for polynomials over $\mathbb{F}_q$. If $D \subset PG(2,q)$ with $|D|=q+1$, its projective intersection distribution is the sequence

$$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$

The non-hitting index is

$u_0(D),$

the number of lines in $PG(2,q)$ that contain no point of $D$. The largest $i$ with $u_i(D)\neq 0$ is called the degree of $\mathbb{F}_q$0 (Li et al., 2020, Huczynska et al., 6 Oct 2025).

The affine polynomial version is defined as follows. For $\mathbb{F}_q$1, let

$\mathbb{F}_q$2

Then the affine non-hitting index of $\mathbb{F}_q$3 is

$\mathbb{F}_q$4

which counts the non-vertical affine lines $\mathbb{F}_q$5 that do not intersect the graph $\mathbb{F}_q$6 (Huczynska et al., 6 Oct 2025).

The affine and projective viewpoints are canonically linked by the $\mathbb{F}_q$7-set

$\mathbb{F}_q$8

For this construction,

$\mathbb{F}_q$9

so the non-hitting index is the same invariant seen in affine and projective coordinates (Huczynska et al., 6 Oct 2025). The point $D \subset PG(2,q)$0 is an internal nucleus of $D \subset PG(2,q)$1, and conversely every $D \subset PG(2,q)$2-set with an internal nucleus is projectively equivalent to some $D \subset PG(2,q)$3 (Li et al., 2020, Huczynska et al., 6 Oct 2025).

2. Algebraic and geometric meaning

Geometrically, a large non-hitting index means that a $D \subset PG(2,q)$4-set is sparse with respect to lines: many lines of the ambient plane miss it entirely. Algebraically, for a polynomial $D \subset PG(2,q)$5, the same quantity measures how often the equations

$D \subset PG(2,q)$6

have no solution in $D \subset PG(2,q)$7. This is the most direct interpretation of $D \subset PG(2,q)$8 (Huczynska et al., 6 Oct 2025).

The polynomial formulation has an equivalent value-set description. For each $D \subset PG(2,q)$9, define

$|D|=q+1$0

Then

$|D|=q+1$1

Thus the non-hitting index records the total deficiency of the $|D|=q+1$2 value sets $|D|=q+1$3: the larger $|D|=q+1$4 is, the smaller these value sets are on average (Li et al., 2020).

This invariant is constrained by standard incidence identities. For a $|D|=q+1$5-set $|D|=q+1$6,

$|D|=q+1$7

and

$|D|=q+1$8

From these identities one obtains

$|D|=q+1$9

so higher-order secants necessarily reduce the non-hitting index (Li et al., 2020). In the later work on intersection distributions, the same counting philosophy is extended to reconstruct $$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$0 or $$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$1 once the higher intersection numbers are known (Huczynska et al., 6 Oct 2025).

The degree of $$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$2 interacts strongly with the non-hitting index. Since $$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$3 is the largest possible number of $$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$4-solutions of $$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$5, it measures the maximum line-intersection multiplicity, while $$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$6 measures the number of lines with zero intersection. The papers emphasize that these are complementary descriptors of the same incidence distribution (Huczynska et al., 6 Oct 2025).

3. Extremal bounds, spectrum, and classification in finite planes

For a $$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$7-set $$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$8, the non-hitting index satisfies

$$u_i(D)=\#\{\text{lines } \ell \subset PG(2,q): |\ell\cap D|=i\}, \qquad 0\le i\le q+1.$$9

The lower extreme $u_0(D),$0 holds if and only if $u_0(D),$1 is a line, while the upper extreme $u_0(D),$2 holds if and only if $u_0(D),$3 is a $u_0(D),$4-arc (Li et al., 2020). These are the fundamental extremal cases: a line is maximally hit, and an arc is maximally avoided.

A finer lower bound depends on the degree $u_0(D),$5 of $u_0(D),$6. If $u_0(D),$7 has degree $u_0(D),$8, then

$u_0(D),$9

In particular, if $PG(2,q)$0, then $PG(2,q)$1 if and only if $PG(2,q)$2 points of $PG(2,q)$3 lie on a line and the remaining point is off that line. For $PG(2,q)$4, one has $PG(2,q)$5 (Li et al., 2020). This shows that small non-hitting index corresponds to highly collinear configurations.

For polynomials, the same extremal picture becomes a classification statement. One always has

$PG(2,q)$6

with equality if and only if $PG(2,q)$7 is linear. At the other end,

$PG(2,q)$8

Equality holds if and only if $PG(2,q)$9 is a $D$0-arc; for even $D$1, this means that for exactly one $D$2, the polynomial $D$3 is an o-polynomial, while for odd $D$4, $D$5 is projectively equivalent to $D$6 (Li et al., 2020).

The later paper develops the non-hitting spectrum

$D$7

equivalently the set of possible values $D$8 for polynomially representable $D$9-sets (Huczynska et al., 6 Oct 2025). Li–Pott had previously identified the smallest values

$i$0

and the later analysis shows that, for large $i$1, the next values include

$i$2

while also demonstrating that these larger values no longer determine a set up to projective equivalence (Huczynska et al., 6 Oct 2025). This corrects a possible misconception: the non-hitting index is a strong invariant, but it is not a complete classifier once one moves beyond the extremal part of the spectrum.

Concrete families illustrate the range of behavior. For a linear polynomial $i$3, one has $i$4, $i$5, and $i$6, so the non-hitting index is minimal among polynomial examples. For cubic polynomials $i$7, the non-hitting index is computed through irreducible cubic counts: $i$8 For monomials $i$9, the degree $u_i(D)\neq 0$0 is controlled by $u_i(D)\neq 0$1, $u_i(D)\neq 0$2, and $u_i(D)\neq 0$3, which in turn constrains the non-hitting index through the global intersection identities (Huczynska et al., 6 Oct 2025).

4. Capacity and Hausdorff thresholds in stochastic PDEs

In stochastic PDEs, the phrase non-hitting index is not always part of the paper’s formal terminology, but several works identify exact critical quantities with the same operational meaning: they determine whether sets are polar or non-polar. This is explicit in the fractional stochastic heat system of spatial dimension $u_i(D)\neq 0$4,

$u_i(D)\neq 0$5

with $u_i(D)\neq 0$6, globally Lipschitz coefficients, and a uniformly elliptic diffusion matrix $u_i(D)\neq 0$7 (Dalang et al., 2018).

The analytic input is a sharp Gaussian-type bound for the two-point density of $u_i(D)\neq 0$8: $u_i(D)\neq 0$9 where the adapted parabolic distance is

$\mathbb{F}_q$00

This estimate yields lower bounds on hitting probabilities in terms of Newtonian capacity and upper bounds in terms of Hausdorff measure (Dalang et al., 2018).

For the three natural observation sets, the critical quantities are

$\mathbb{F}_q$01

Equivalently, the capacity indices are

$\mathbb{F}_q$02

The paper states that, although it does not use the term “non-hitting index,” these numbers naturally define such an index: if $\mathbb{F}_q$03 is larger than the relevant threshold, points are polar; if $\mathbb{F}_q$04 is smaller, points are non-polar (Dalang et al., 2018). For $\mathbb{F}_q$05, these become

$\mathbb{F}_q$06

recovering the classical heat-equation critical dimensions and removing the extra $\mathbb{F}_q$07 present in earlier multiplicative-noise results (Dalang et al., 2018).

A related picture appears for stochastic heat and wave equations driven by an additive fractional Brownian sheet with temporal index $\mathbb{F}_q$08 and spatial index $\mathbb{F}_q$09. For the Gaussian field $\mathbb{F}_q$10, the anisotropic Hölder exponents are

$\mathbb{F}_q$11

so the effective parameter

$\mathbb{F}_q$12

becomes

$\mathbb{F}_q$13

The hitting-probability bounds are

$\mathbb{F}_q$14

For singleton targets, points are non-polar when $\mathbb{F}_q$15 and polar when $\mathbb{F}_q$16. The paper explicitly calls $\mathbb{F}_q$17 the critical dimension of hitting probabilities, and this is precisely the role of a non-hitting index in the SPDE context (Hong et al., 2016).

5. Hitting-time formulations and survival exponents

A different probabilistic usage arises from first hitting times. For a one-dimensional strictly $\mathbb{F}_q$18-stable Lévy process with $\mathbb{F}_q$19, killed upon hitting the origin,

$\mathbb{F}_q$20

the survival probability admits the spectral representation

$\mathbb{F}_q$21

where $\mathbb{F}_q$22 is a generalized eigenfunction and $\mathbb{F}_q$23 encodes skewness (Mucha, 2019). The reconstruction of the paper’s consequences identifies a natural temporal non-hitting index

$\mathbb{F}_q$24

through the large-time asymptotic

$\mathbb{F}_q$25

This interpretation is presented as a natural definition suggested by the spectral formula rather than as the paper’s own terminology (Mucha, 2019).

For non-backtracking random walks on $\mathbb{F}_q$26 networks, the paper studies the first hitting time $\mathbb{F}_q$27, defined as the path length before termination by retracing or trapping. The tail distribution satisfies

$\mathbb{F}_q$28

with

$\mathbb{F}_q$29

The tail therefore factors into a discrete Rayleigh component and an exponential component. The same reconstruction proposes several possible non-hitting indices for this setting, including the normalized mean first hitting time $\mathbb{F}_q$30, the Rayleigh scale parameter $\mathbb{F}_q$31, and composite quantities involving $\mathbb{F}_q$32 (Tishby et al., 2016). Here again, the underlying idea is that non-hitting is quantified not by a line-incidence count but by how long a dynamics remains self-avoiding before a first hit occurs.

These examples show that, in stochastic processes, a non-hitting index need not be a single canonical number. Depending on the model, it may appear as a persistence exponent, a capacity threshold, or a scale parameter in a hitting-time distribution. This suggests that the concept is structural rather than purely terminological.

6. Conceptual unification and scope

Across the cited literatures, the non-hitting index has a precise core meaning: it quantifies avoidance relative to a family of potential intersections. In finite geometry, the family consists of projective or affine lines, and the index is exactly the number of lines that miss the set. In stochastic PDEs, the relevant family is a class of target sets $\mathbb{F}_q$33, and the index appears as the critical exponent in $\mathbb{F}_q$34 or $\mathbb{F}_q$35. In hitting-time problems, the same role is played by survival exponents or effective scale parameters controlling the decay of $\mathbb{F}_q$36 (Li et al., 2020, Dalang et al., 2018, Mucha, 2019).

The finite-geometric theory is the most explicit and terminologically settled. There, the non-hitting index is a coarse but robust invariant, tightly linked to projective equivalence, internal nuclei, and the degree of $\mathbb{F}_q$37. It controls extremal configurations, constrains the full intersection distribution, and has direct applications to Kakeya sets in affine planes through the identity

$\mathbb{F}_q$38

where $\mathbb{F}_q$39 is the dual $\mathbb{F}_q$40-set associated with a Kakeya set $\mathbb{F}_q$41 (Li et al., 2020, Huczynska et al., 6 Oct 2025).

The stochastic literature suggests a broader interpretation. For the stochastic fractional heat system, smaller $\mathbb{F}_q$42 increases the indices

$\mathbb{F}_q$43

so, in a fixed state-space dimension $\mathbb{F}_q$44, points and other thin sets become less likely to be polar (Dalang et al., 2018). For rough fractional noises, smaller $\mathbb{F}_q$45 increases

$\mathbb{F}_q$46

again making hitting of points possible in higher dimensions (Hong et al., 2016). In both cases, rougher or more dispersive dynamics correspond to a larger critical hitting dimension and therefore to weaker non-hitting behavior for small targets.

A plausible synthesis is that a non-hitting index always identifies a transition between regimes of guaranteed avoidance and possible intersection. In finite planes, this transition is exact and combinatorial. In stochastic systems, it is potential-theoretic or asymptotic. The common structure is the existence of a threshold parameter—$\mathbb{F}_q$47, $\mathbb{F}_q$48, $\mathbb{F}_q$49, $\mathbb{F}_q$50, or $\mathbb{F}_q$51—that summarizes how an object interacts with the ambient family of probes, whether those probes are lines, compact target sets, or the origin itself under time evolution (Huczynska et al., 6 Oct 2025, Dalang et al., 2018, Mucha, 2019).