Dual Polar Graphs of Hermitian Polar Spaces

• The paper establishes the algebraic and combinatorial structure of dual polar graphs with explicit eigenvalue formulas and intersection arrays derived from Hermitian geometry.
• It employs geometric embeddings, apartment characterizations, and Terwilliger algebra decompositions to elucidate distance-regularity and metric properties.
• The results imply significant applications in finite geometry, coding theory, and representation theory through q-polynomial association schemes and related algebraic frameworks.

A dual polar graph of a Hermitian polar space is a distance-regular graph whose vertices correspond to maximal totally isotropic subspaces (generators) of a finite-dimensional vector space $V$ over $\mathrm{GF}(q^2)$ equipped with a nondegenerate Hermitian form. Adjacency, combinatorial invariants, metric structure, and algebraic properties of these graphs are determined by the underlying Hermitian geometry. This structure provides a paradigmatic example of a $Q$-polynomial association scheme with deep connections to buildings, representation theory, and finite geometry.

1. Construction of Hermitian Dual Polar Graphs

Given $V = \mathrm{GF}(q^2)^n$ with nondegenerate Hermitian form $h$, the Hermitian polar space $H(n-1, q^2)$ of rank $d = \lfloor n/2 \rfloor$ consists of all totally isotropic subspaces under $h$. The set of $d$-dimensional totally isotropic subspaces (generators) forms the vertex set $\Omega$ of the dual polar graph $\mathrm{GF}(q^2)$0. Two generators $\mathrm{GF}(q^2)$1 are adjacent if $\mathrm{GF}(q^2)$2.

The resulting graph $\mathrm{GF}(q^2)$3 is distance-regular of diameter $\mathrm{GF}(q^2)$4. The distance between generators $\mathrm{GF}(q^2)$5 and $\mathrm{GF}(q^2)$6 is $\mathrm{GF}(q^2)$7. The number of generators is $\mathrm{GF}(q^2)$8 for the case $\mathrm{GF}(q^2)$9 (Witt index $Q$0) (Ihringer et al., 2015, Qiao et al., 2017). The intersection array and eigenvalues are explicitly determined by $Q$1 and $Q$2.

2. Apartments and Metric Characterization

Apartments in the dual polar graph correspond to subsets indexed by frames: sets of $Q$3 points $Q$4 partitioned into $Q$5 pairs so that within each pair the points are not collinear but every other distinct pair is collinear. The family of maximal singular subspaces selecting one point from each pair is an apartment, combinatorially forming an $Q$6-cube $Q$7 as an induced subgraph (Pankov, 2010).

Pankov's metric characterization (Theorem 2) states that any isometric embedding of an $Q$8-dimensional hypercube $Q$9 into $V = \mathrm{GF}(q^2)^n$0 arises from an apartment (possibly within a parabolic subspace corresponding to a lower-rank polar space), and any isometric copy of $V = \mathrm{GF}(q^2)^n$1 is a full apartment. The classification (Theorem 3) further asserts that every isometric embedding of a smaller dual polar graph into a larger arises from embedding into a parabolic determined by a singular subspace of requisite codimension. This rigidifies the geometry: all possible cube subgraphs with isometric distances are accounted for by geometric apartments (Pankov, 2010).

3. Combinatorial and Eigenvalue Structure

The Hermitian dual polar graph $V = \mathrm{GF}(q^2)^n$2 is $V = \mathrm{GF}(q^2)^n$3-polynomial and distance-regular, with intersection numbers: $V = \mathrm{GF}(q^2)^n$4 where $V = \mathrm{GF}(q^2)^n$5. The eigenvalues are

$V = \mathrm{GF}(q^2)^n$6

with multiplicities given by differences of $V = \mathrm{GF}(q^2)^n$7-Gaussian coefficients (Qiao et al., 2017).

$V = \mathrm{GF}(q^2)^n$8 is geometric: each edge belongs to a unique Delsarte clique of size $V = \mathrm{GF}(q^2)^n$9. The smallest eigenvalue is $h$0, and the graph satisfies the Krein condition with equality for a "light tail" idempotent at the minimal eigenvalue, characterizing the family among geometric $h$1-bounded distance-regular graphs (Koolen et al., 2015).

4. Algebraic, Module, and Polynomial Structures

The Terwilliger (subconstituent) algebra $h$2 generated by adjacency and dual adjacency matrices acting on the standard module decomposes into irreducible thin modules. On each irreducible, the restrictions of adjacency and dual adjacency satisfy the Leonard pair tridiagonal relations, with split sequences and eigenparameters matching dual $h$3-Krawtchouk type (Worawannotai, 2012).

A fundamental correspondence is established with the quantum algebra $h$4: $h$5 is generated by two commuting $h$6 actions up to its center, and the spectrum and recurrences of the adjacency operator correspond to those of dual $h$7-Krawtchouk polynomials. In the Hermitian case, the generalized Terwilliger algebra with respect to base vertex and maximal clique admits a primary $h$8-dimensional module which realizes a rank-one nil-DAHA of type $h$9, precisely encoding the dual $H(n-1, q^2)$0-Krawtchouk polynomials and their non-symmetric versions (Lee et al., 2017).

5. Clique Classification and Metric Dimension

Erdős–Ko–Rado-type theorems describe maximal $H(n-1, q^2)$1-cliques in the dual polar graph: for $H(n-1, q^2)$2, every maximal $H(n-1, q^2)$3-clique is the set of all generators containing a fixed totally isotropic subspace of codimension $H(n-1, q^2)$4 (for even $H(n-1, q^2)$5) or $H(n-1, q^2)$6 (for odd $H(n-1, q^2)$7). The size and structure of these cliques meet the Hoffman bound with equality, and there is a complete classification for large $H(n-1, q^2)$8 (Ihringer et al., 2015).

The metric dimension $H(n-1, q^2)$9, or smallest resolving set, satisfies the upper bound

$d = \lfloor n/2 \rfloor$0

where $d = \lfloor n/2 \rfloor$1 is the base field size and $d = \lfloor n/2 \rfloor$2 is the Witt index of the Hermitian form (Bailey et al., 2017). No matching lower bounds are known for arbitrary $d = \lfloor n/2 \rfloor$3.

6. Characterization Theorems and Isomorphism Criteria

A detailed characterization (Qiao–Koolen) shows that under the conditions of non-bipartiteness, geometricity, diameter $d = \lfloor n/2 \rfloor$4, $d = \lfloor n/2 \rfloor$5, and smallest eigenvalue $d = \lfloor n/2 \rfloor$6, the only possible distance-regular graph with parameters matching $d = \lfloor n/2 \rfloor$7 for $d = \lfloor n/2 \rfloor$8 and a specific relation for $d = \lfloor n/2 \rfloor$9 is the Hermitian dual polar graph $h$0. These numerical identities, together with spectral information, rigidly determine the graph's isomorphism class (Qiao et al., 2017).

The light tail condition at the minimal eigenvalue provides a characterization coinciding precisely with the Hermitian dual polar graphs among distance-regular $h$1-bounded graphs with the prescribed intersection array and eigenvalue structure (Koolen et al., 2015).

7. Broader Significance and Applications

Dual polar graphs of Hermitian spaces are central objects in the theory of finite geometries, combinatorics, and algebraic graph theory. Their apartments encode the cube geometry of Tits buildings, and the combinatorial embedding structure is completely dictated by the underlying geometry. Their highly regular structure underlies the classification of geometric distance-regular graphs and is instrumental in the study of Leonard systems, $h$2-polynomial association schemes, and related objects in algebraic combinatorics and representation theory (Pankov, 2010, Qiao et al., 2017, Worawannotai, 2012).

These graphs serve as fertile ground for connections to quantum algebra, representation theory (via $h$3 and DAHA), and the theory of special polynomials, especially dual $h$4-Krawtchouk families and their non-symmetric generalizations (Lee et al., 2017, Worawannotai, 2012). Advanced applications include metric dimension calculations, clique size bounds, and explicit control over spectral properties relevant to coding theory and extremal set theory (Bailey et al., 2017, Ihringer et al., 2015).