{"id":"hexagon/2611.00434","pdf":"https://hexagonmath.org/pdf/2611.00434v1","url":"https://hexagonmath.org/abs/2611.00434v1","tags":["math.CO","msc:11D25","msc:05C70","msc:11B39","Aigner's conjectures","Fibonacci matrices","Markoff numbers","Markov numbers","combinatorial number theory","fixed-denominator monotonicity"],"score":0,"title":"Aigner's Three Monotonicities from Fibonacci Matrices and Six Snake Pieces","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["Elleard Felix Webster Heffern"],"reviews":0,"subject":"math.NT","summary":"Starting from the established fact that Markov numbers count perfect matchings of their Markov snake graphs, we give a self-contained proof of the fixed-sum, fixed-numerator, and fixed-denominator orderings proposed by Aigner. The author's Fibonacci-matrix normalization begins with $(AC)_{11}-(B^2)_{11}=2$ for consecutive odd-indexed Fibonacci blocks. Fibonacci matrices prove normalization and fixed-numerator monotonicity. The author's six-piece decomposition proves the remaining fixed-sum comparison and fixed-denominator monotonicity. We credit the matching correspondence to its original…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT"],"discussed":0,"published":"2026-11-15","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}