# On the poset and asymptotics of Tesler Matrices

## TL;DR

This paper investigates the poset structure and asymptotic properties of Tesler matrices, proving a conjecture about their characteristic polynomial and exploring their enumeration relative to parking functions.

## Contribution

It proves a stronger version of Armstrong's conjecture for a class of generalized Tesler matrices using Hallam and Sagan's method.

## Key findings

- Characteristic polynomial of the poset is a power of (q-1) for certain Tesler matrices
- Bounds are established for the number of Tesler matrices
- Comparison made between Tesler matrices count and parking functions

## Abstract

Tesler matrices are certain integral matrices counted by the Kostant partition function and have appeared recently in Haglund's study of diagonal harmonics. In 2014, Drew Armstrong defined a poset on such matrices and conjectured that the characteristic polynomial of this poset is a power of $(q-1)$. We use a method of Hallam and Sagan to prove a stronger version of this conjecture for posets of a certain class of generalized Tesler matrices. We also study bounds for the number of Tesler matrices and how they compare to the number of parking functions, the dimension of the space of diagonal harmonics.