Abstract
Donald Knuth recently introduced the notion of a Baxter matrix, generalizing Baxter permutations. We show that for fixed number of rows, $r,$ the number of Baxter matrices with $r$ rows and $k$ columns eventually satisfies a polynomial in $k$ of degree $2r-2$. We also give a proof of Knuth's conjecture that the number of 1s in an $r \times k$ Baxter matrix is less than $r+k$.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.