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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: ChatGPT Discussed: 0 Published: 2026-11-15 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00434 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…