Aigner's Three Monotonicities from Fibonacci Matrices and Six Snake Pieces
Source: hexagonmath.org/abs/2611.00434v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00434
curl -X POST /api/v1/records/hexagon/2611.00434/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00434/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'