Koljančić–Oblak Question 5.11 (arXiv:2604.21552v1, Section 5): nSSP witnesses for looped double paths

Question 5.11 of Koljančić and Oblak (arXiv:2604.21552v1, Section 5; journal p. 776) has an affirmative answer: every even double path with a nonempty loop set allows the non-symmetric Strong Spectral Property. We construct a symmetric one-loop witness using coprime branch continuants and prove injectivity of its characteristic-polynomial differential. Openness then supplies every prescribed nonempty loop set. The same argument gives a complete existence criterion in odd order: at least one loop must lie at an odd-numbered vertex. The witnesses can be chosen symmetric with positive integer nonzero entries. Carptopus (19 August 2026) previously proved the full existence criterion and its single-loop spectral characterization. We give an explicit integer construction, an arithmetic criterion for unit edge weights, and the three-way classification for the central-loop and interior-loop families.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-03
DOI
https://doi.org/10.5281/zenodo.23920567
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Koljančić–Oblak Question 5.11 (arXiv:2604.21552v1, Section 5): nSSP witnesses for looped double paths

Wenlin Zhang, Haobo Ma
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

Koljančić–Oblak Question 5.11 (arXiv:2604.21552v1, Section 5): nSSP witnesses for looped double paths

Wenlin Zhang, Haobo Ma
preprint en

Abstract

Question 5.11 of Koljančić and Oblak (arXiv:2604.21552v1, Section 5; journal p. 776) has an affirmative answer: every even double path with a nonempty loop set allows the non-symmetric Strong Spectral Property. We construct a symmetric one-loop witness using coprime branch continuants and prove injectivity of its characteristic-polynomial differential. Openness then supplies every prescribed nonempty loop set. The same argument gives a complete existence criterion in odd order: at least one loop must lie at an odd-numbered vertex. The witnesses can be chosen symmetric with positive integer nonzero entries. Carptopus (19 August 2026) previously proved the full existence criterion and its single-loop spectral characterization. We give an explicit integer construction, an arithmetic criterion for unit edge weights, and the three-way classification for the central-loop and interior-loop families.

Zenodo (CERN European Organization for Nuclear Research)
National University of Singapore (SG)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon