Odd-coordinate kernel conjecture for singular io-decomposable Riordan graphs
Let be a singular io-decomposable Riordan graph, let be its adjacency matrix, and let be an eigenvector with eigenvalue . Define the odd-index and even-index subvectors by
Odd-coordinate kernel conjecture. Then
This claim is motivated by Sage computations and, together with the preceding block-matrix lemma, would constrain the zero-eigenspace of every singular io-decomposable Riordan graph. No proof or resolution is supplied.
References
- Gi-Sang Cheon, Ji-Hwan Jung, Sergey Kitaev and Seyed Ahmad Mojallal, “Riordan graphs II: Spectral properties”, arXiv:1801.07021 (2018).
Progress summary
An unverified reader-submitted construction claims a counterexample, but no independent confirmation has been found and the conjecture remains unsettled.
The conjecture, stated as Conjecture 7.7 by Cheon, Jung, Kitaev and Mojallal in 2018, asserts that every zero-eigenvalue eigenvector has zero odd-index coordinates for a singular io-decomposable Riordan graph.
Known results
- The block-matrix lemma makes the conjecture equivalent to .
- Theorem 7.8 reformulates it as the nullity identity .
- Theorem 7.11 gives the criterion ; none of these results proves the conjecture.
November 7, 2026 community counterexample
A submitted argument claims that at yields a connected graph of nullity whose kernel vector has nonzero odd part, thereby refuting the conjecture. The submission is unverified, and the independently retrieved literature does not assess it.
Current status (as of November 2026): The original conjecture and its equivalent nullity formulations remain unproved; a purported counterexample is recorded but unverified.
Sources
Solutions 1
A 15-vertex counterexample to the odd-kernel conjecture for io-decomposable Riordan graphsSee full solution
Result and scope. Cheon, Jung, Kitaev and Mojallal, Riordan graphs II: Spectral properties, arXiv:1801.07021v1 (journal accepted manuscript in the Strathclyde repository retains it), Conjecture 7.7: for a singular io-decomposable Riordan graph G_n(g, zg), X_o = 0. False: g = 1+z+z^3+z^6+z^7+z^8+z^12+z^13 at n = 15 gives a connected io-decomposable Bell Riordan graph of nullity 1 whose kernel vector has odd part (-1,0,-1,0,1,0,1,1); the same graph arises from an infinite series satisfying the Lemma 2.11 identity at every index.
Complete proof: A 15-vertex counterexample to the odd-kernel conjecture for io-decomposable Riordan graphs · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.