{"id":"hexagon/2611.00688","pdf":"https://hexagonmath.org/pdf/2611.00688v1","url":"https://hexagonmath.org/abs/2611.00688v1","tags":["msc:05A15","inclusion–exclusion","interlacing triangles","transfer matrices"],"score":0,"title":"Counting triangles with interlacing rows","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Will Howe","Grant Huffman","Jensen Kohlmeyer","Liam Kruer"],"reviews":0,"subject":"math.CO","summary":"For a triangle filled with distinct integers, require each entry above the bottom row to lie strictly between its two children. We give an exact formula for the number of fillings of any size, using row transfer matrices and inclusion–exclusion. A refinement prescribes the bottom-row positions of both extrema.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-20","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}