The nucleus of the Johnson graph J(N,D)
Abstract
In this paper, we describe the nucleus of the Johnson graph = J(N,D) with N > 2D. Let X denote the vertex set of . Let A ∈ MatX( C) denote the adjacency matrix of . Let \Ei\i=0D denote the Q-polynomial ordering of the primitive idempotents of A. Fix x ∈ X, and consider the corresponding dual adjacency matrix A* and dual primitive idempotents \E*i\i=0D. The subalgebra T of MatX( C) generated by A, A* is called the subconstituent algebra of with respect to x. Let V= CX denote the standard module of . For 0 ≤ i ≤ D define \[ Ni = (E*0 V + E*1 V + ·s + E*i V) (E0 V + E1 V + ·s + ED-i V). \] It is known that the sum N = Σi=0D Ni is direct, and N is a T-module. The T-module N is called the nucleus of with respect to x. For 0 ≤ i ≤ D we construct a basis for Ni and a basis for E*i N. From this we obtain two bases of N. We give a combinatorial interpretation of these two bases. We give the transition matrices between these two bases. We also give the action of A, A* on these bases.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.