Edge and full-support positivity of adjacent coefficient minors on a deformed squared Markov tree

At a vertex of the deformed squared Markov tree, order the two forward mutations by degree. Subtracting the old center from the smaller new center, and the smaller new center from the larger one, gives two symmetric Laurent coefficient rows. We study their adjacent two-by-two minors on the subtree rooted at the first strictly degree-ordered triple. At every vertex the last four minors are strictly positive. More generally, if the first row has degree s, the minor at distance h ≥ 2 from its upper edge is positive whenever s ≥ 32h(h+1). For a child obtained by retaining the larger endpoint of its parent, we prove positivity at every index, including the center, whenever that endpoint has degree b ≥ 10^1465. The proof compares a lower bound for a folded convolution minor with upper bounds for the two subtraction terms in the mutation. Positivity at every index of every vertex remains open. The PDF contains the 18-page preprint. The accompanying Python script uses only the standard library and reproduces the finite checks with exact integer arithmetic. Run python3 reproduce.py --long for the depth-six long-child check, python3 reproduce.py --upper for the three upper-edge scans, or python3 reproduce.py --h 1 for a quick check. OpenAI language-model agents assisted with proof discovery, symbolic estimates, drafting, internal checking and preparation of the verification code, as described in the manuscript.

Authors

Publication Details

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

Edge and full-support positivity of adjacent coefficient minors on a deformed squared Markov tree

Shoma Nakabayashi
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Edge and full-support positivity of adjacent coefficient minors on a deformed squared Markov tree

Shoma Nakabayashi
preprint en

Abstract

At a vertex of the deformed squared Markov tree, order the two forward mutations by degree. Subtracting the old center from the smaller new center, and the smaller new center from the larger one, gives two symmetric Laurent coefficient rows. We study their adjacent two-by-two minors on the subtree rooted at the first strictly degree-ordered triple. At every vertex the last four minors are strictly positive. More generally, if the first row has degree s, the minor at distance h ≥ 2 from its upper edge is positive whenever s ≥ 32h(h+1). For a child obtained by retaining the larger endpoint of its parent, we prove positivity at every index, including the center, whenever that endpoint has degree b ≥ 10^1465. The proof compares a lower bound for a folded convolution minor with upper bounds for the two subtraction terms in the mutation. Positivity at every index of every vertex remains open. The PDF contains the 18-page preprint. The accompanying Python script uses only the standard library and reproduces the finite checks with exact integer arithmetic. Run python3 reproduce.py --long for the depth-six long-child check, python3 reproduce.py --upper for the three upper-edge scans, or python3 reproduce.py --h 1 for a quick check. OpenAI language-model agents assisted with proof discovery, symbolic estimates, drafting, internal checking and preparation of the verification code, as described in the manuscript.

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