Endpoint Walks Evaluate the Complete Homogeneous Symmetric Norms of Path Graphs
A graph-walk identity with exact computational checks
A candidate identity connecting endpoint walks on path graphs with complete homogeneous symmetric norms. Exact computational consistency checks cover 1,176 parameter pairs.
- Identifier
- MF-PRISM-MATH-2026-08
- Series
- Mathematics
- Edition
- Version 1.2
- Length
- 12 pages
What is this paper trying to establish?
Can endpoint walks on a path graph exactly evaluate a family of complete homogeneous symmetric norms?
The central idea.
A candidate identity connecting endpoint walks on path graphs with complete homogeneous symmetric norms. Exact computational consistency checks cover 1,176 parameter pairs.
Candidate identity released for independent specialist and publication-priority review.
This manuscript presents a candidate resolution. Publication is not verification: independent specialist review remains necessary before the result should be treated as established.
What changes if the method holds?
The identity would connect two different combinatorial descriptions—walk counts and symmetric functions—through an exact evaluative formula.
Where scrutiny should concentrate.
The paper identifies the following points as the highest-value targets for independent review.
- 01The endpoint-walk derivation and boundary conventions.
- 02The passage to complete homogeneous symmetric norms.
- 03Proof versus finite checks across 1,176 parameter pairs and prior-art priority.
An open, inspectable research artifact.
The public record links the manuscript to its release, source package, review materials, and persistent identifier. Status travels with the paper; a reserved DOI is not presented as a published Zenodo record.
- Document
- Preprint
- Review status
- Open for independent review
- Published
- 2026-07-18
- DOI status
- Published · 10.5281/zenodo.21434694
- Canonical record
- MF-PRISM-MATH-2026-08