\documentclass[11pt,letterpaper,reqno]{amsart} \usepackage[T1]{fontenc} \usepackage{lmodern} \usepackage[margin=1in]{geometry} \usepackage[hidelinks,unicode]{hyperref} \hypersetup{ pdftitle={Counting triangles with interlacing rows}, pdfauthor={Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer}, pdfsubject={An exact row-transfer formula for Clark Kimberling's Problem 18}, pdfkeywords={interlacing triangles, inclusion-exclusion, enumeration, transfer matrices} } \newtheorem{theorem}{Theorem}[section] \numberwithin{equation}{section} \newcommand{\one}{\mathbf{1}} \title[Counting triangles with interlacing rows]{Counting triangles with interlacing rows} \author[W. Howe]{Will Howe} \author[G. Huffman]{Grant Huffman} \author[J. Kohlmeyer]{Jensen Kohlmeyer} \author[L. Kruer]{Liam Kruer} \date{November 19, 2026} \subjclass[2020]{05A15} \keywords{interlacing triangles, inclusion--exclusion, transfer matrices} \thanks{The authors acknowledge assistance from OpenAI Codex in mathematical exploration, checking, and manuscript preparation.} \begin{document} \begin{abstract} We give an exact formula for the number of ways to arrange the first \(n(n+1)/2\) positive integers in \(n\) triangular rows so that every parent lies strictly between its two children. The smallest and largest labels occur in the bottom row. Fixing their positions leaves a sequence of row counts with repeated interior labels allowed. Inclusion--exclusion over those labels recovers the desired count and its refinement by the positions of both extrema. \end{abstract} \maketitle \section{Introduction} Clark Kimberling's Problem~18 \cite{kimberling} asks for the number \(T_n\) of fillings of rows of lengths \(1,2,\ldots,n\) with the integers \(1,\ldots,M\), where \(M=n(n+1)/2\), each used once. Each parent is required to lie strictly between its two children, in either order. Reflected configurations are counted separately when they differ. James B. Sidoli \cite{sidoli} gives an enumeration in terms of linear extensions of posets. We obtain a formula using integer matrices indexed by rows. Write \([M]=\{1,\ldots,M\}\). For \(1\le r