Harmonic Structures in Posets and Digit Polygons: Exact Valuations, Fluctuations, and Reconstruction

A periodic digit expansion draws a polygonal walk whose overlap and empty regions retain arithmetic information. Harmonic Structures in Posets and Digit Polygons develops an analytical account of these connections, bringing order constraints and geometric multiplicity into a common harmonic framework while keeping their probability laws and metric weights explicit. For finite posets, an ideal-frontier representation yields harmonic identities, sharp width bounds, and exact record covariances. At fixed width the variance grows at most logarithmically, while a family of ordinal sums has independent increments, an explicit dilogarithm variance constant, and a normal limit. For finite measured covers, overlap depth becomes a positive moment problem on reciprocal integers. Interpolation reconstructs every layer, and linear-programming duality determines sharp minimax errors for recovery from bounded-noise measurements. Applied to digit polygons, the theory identifies winding multiplicity with interval-order width. An exact rational algorithm evaluates all depth tails directly from the original edges, with a quadratic operation count apart from sorting, while integer coordinates provide explicit margins for noisy depth certification. Closed-section incidence preserves the information needed to detect connectivity and holes. Protected barriers produce period-79 orbits with at least two holes in infinitely many bases of both quadratic families, and a safe periodic closing theorem gives conditions for further constructions. The treatment also retains the boundary harmonic laws and prefix geometry of the predecessor, with explanatory figures and reproducible checks accompanying the proofs. Order-polytope formulas and path likelihoods identify the change of measure leading to uniform linear extensions. Uniform frontier choice is exact precisely for ordinal sums of antichains, and comparison certificates transfer under sharp density conditions. Optimal fixed-width variance constants, unbounded arithmetic hole counts, linear hole bounds, sharper arithmetic recovery, and general uniform-extension balance applications remain open. The finite edge evaluation does not imply bounded closed harmonic formulas in the base.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-04
DOI
https://doi.org/10.5281/zenodo.23964874
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Harmonic Structures in Posets and Digit Polygons: Exact Valuations, Fluctuations, and Reconstruction

K. Fathi
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
article

Harmonic Structures in Posets and Digit Polygons: Exact Valuations, Fluctuations, and Reconstruction

K. Fathi
article en

Abstract

A periodic digit expansion draws a polygonal walk whose overlap and empty regions retain arithmetic information. Harmonic Structures in Posets and Digit Polygons develops an analytical account of these connections, bringing order constraints and geometric multiplicity into a common harmonic framework while keeping their probability laws and metric weights explicit. For finite posets, an ideal-frontier representation yields harmonic identities, sharp width bounds, and exact record covariances. At fixed width the variance grows at most logarithmically, while a family of ordinal sums has independent increments, an explicit dilogarithm variance constant, and a normal limit. For finite measured covers, overlap depth becomes a positive moment problem on reciprocal integers. Interpolation reconstructs every layer, and linear-programming duality determines sharp minimax errors for recovery from bounded-noise measurements. Applied to digit polygons, the theory identifies winding multiplicity with interval-order width. An exact rational algorithm evaluates all depth tails directly from the original edges, with a quadratic operation count apart from sorting, while integer coordinates provide explicit margins for noisy depth certification. Closed-section incidence preserves the information needed to detect connectivity and holes. Protected barriers produce period-79 orbits with at least two holes in infinitely many bases of both quadratic families, and a safe periodic closing theorem gives conditions for further constructions. The treatment also retains the boundary harmonic laws and prefix geometry of the predecessor, with explanatory figures and reproducible checks accompanying the proofs. Order-polytope formulas and path likelihoods identify the change of measure leading to uniform linear extensions. Uniform frontier choice is exact precisely for ordinal sums of antichains, and comparison certificates transfer under sharp density conditions. Optimal fixed-width variance constants, unbounded arithmetic hole counts, linear hole bounds, sharper arithmetic recovery, and general uniform-extension balance applications remain open. The finite edge evaluation does not imply bounded closed harmonic formulas in the base.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 9%
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