Integral Eulerian magnitude homology of paths

For a unit-edge path, each fixed-frame Eulerian magnitude chain complex is identified with a signed, degree-reindexed augmented join of discrete occurrence sets, one set for each vertex absent from the frame. Its integral homology is free and concentrated in the degree equal to the width of its interval hull. Translated inclusions of minimal subpaths consequently induce a direct-sum decomposition of every bigraded homology group. This yields the path-rank recurrence of Martin II and Sazdanović, a finite frame formula and explicit integral bases. A four-vertex example corrects a previously stated maximum-length value. The results are presented as candidate theorems, supported by a complete integral argument and reproducible finite checks; established-status verification is not claimed.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-28
DOI
https://doi.org/10.5281/zenodo.23741275
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Integral Eulerian magnitude homology of paths

Robert Barritz
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Integral Eulerian magnitude homology of paths

Robert Barritz
preprint en

Abstract

For a unit-edge path, each fixed-frame Eulerian magnitude chain complex is identified with a signed, degree-reindexed augmented join of discrete occurrence sets, one set for each vertex absent from the frame. Its integral homology is free and concentrated in the degree equal to the width of its interval hull. Translated inclusions of minimal subpaths consequently induce a direct-sum decomposition of every bigraded homology group. This yields the path-rank recurrence of Martin II and Sazdanović, a finite frame formula and explicit integral bases. A four-vertex example corrects a previously stated maximum-length value. The results are presented as candidate theorems, supported by a complete integral argument and reproducible finite checks; established-status verification is not claimed.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
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