18 citations · 18 across the 3 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
Totally Positive Matrices and the Highest-Order Coefficients of the Characteristic Polynomial
Tiago Closs, Leandro Farina
We investigate the extent to which totally positive matrices can be distinguished through the highest-order coefficients of their characteristic polynomials. To identify the most i…
cs.LG2025
Explaining Deep Network Classification of Matrices: A Case Study on Monotonicity
Leandro Farina, Sergey Korotov
This work demonstrates a methodology for using deep learning to discover simple, practical criteria for classifying matrices based on abstract algebraic properties. By combining a…