B-Spline Laws and Nonreal Zeros for Weighted-Cycle Internal DLA

We give an exact finite-time distribution for single-source internal diffusion limited aggregation driven by an arbitrary positive nearest-neighbour chain on the integers. The probability of each occupied interval is a B-spline value on the harmonic-scale knots of the chain. Lifting a cycle until its penultimate occupation yields a last-site law and a divided-difference formula for arbitrary positive edge weights. For the four-cycle we characterize the full attainable probability region and every reversible realizing resistance vector up to scale. The shifted last-site polynomial has only negative real zeros for every positive nearest-neighbour chain on three or four vertices, but a five-cycle with resistances (10,10,1,1,20) has a nonreal conjugate pair. Thus five is the smallest possible cycle size for this obstruction. The homogeneous Eulerian and q-Eulerian laws and the spline identities used here are classical. This elementary note makes no absolute priority claim. It addresses the one-dimensional, single-source nearest-neighbour branch of AIM-COMBINATORICS-0093, not higher-dimensional or longer-jump IDLA. The real-rootedness assertion being refuted is a natural extension, not a conjecture stated in the source. Unrefereed preprint prepared with AI assistance and originating-researcher self-audit. No independent peer review or formal verification is claimed. Author: Alper Ferudun, Mercury Software GmbH.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-29
DOI
https://doi.org/10.5281/zenodo.23032028
Primary Topic
Complex Network Analysis Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

B-Spline Laws and Nonreal Zeros for Weighted-Cycle Internal DLA

Alper Ferudun
Zenodo (CERN European Organization for Nuclear Research)
Complex Network Analysis Techniques
preprint

B-Spline Laws and Nonreal Zeros for Weighted-Cycle Internal DLA

Alper Ferudun
preprint en

Abstract

We give an exact finite-time distribution for single-source internal diffusion limited aggregation driven by an arbitrary positive nearest-neighbour chain on the integers. The probability of each occupied interval is a B-spline value on the harmonic-scale knots of the chain. Lifting a cycle until its penultimate occupation yields a last-site law and a divided-difference formula for arbitrary positive edge weights. For the four-cycle we characterize the full attainable probability region and every reversible realizing resistance vector up to scale. The shifted last-site polynomial has only negative real zeros for every positive nearest-neighbour chain on three or four vertices, but a five-cycle with resistances (10,10,1,1,20) has a nonreal conjugate pair. Thus five is the smallest possible cycle size for this obstruction. The homogeneous Eulerian and q-Eulerian laws and the spline identities used here are classical. This elementary note makes no absolute priority claim. It addresses the one-dimensional, single-source nearest-neighbour branch of AIM-COMBINATORICS-0093, not higher-dimensional or longer-jump IDLA. The real-rootedness assertion being refuted is a natural extension, not a conjecture stated in the source. Unrefereed preprint prepared with AI assistance and originating-researcher self-audit. No independent peer review or formal verification is claimed. Author: Alper Ferudun, Mercury Software GmbH.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Complex Network Analysis Techniques
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.