Daniel Chen
Published 2024-04-05Version 1
Complete non-ambiguous trees have been studied in various contexts. Recently, a conjecture was made about their determinants, and subsequently proved by Aval. An alternative proof is given here.
On determinants of tournaments and $\mathcal{D}_k$
Minimizing the determinant of the graph Laplacian
Determinants from homomorphisms
![QR code for arXiv:2404.04058 [math.CO]](http://oss.arxitics.com/images/favicon.svg)