On the Class of Similar Square {-1,0,1}-Matrices Arising from Vertex maps on Trees
Bau-Sen Du

TL;DR
This paper demonstrates that transition matrices from continuous vertex maps on trees are similar over certain fields and have a specific characteristic polynomial, revealing uniform algebraic properties across all such maps.
Contribution
It establishes the similarity and characteristic polynomial form of transition matrices for all continuous vertex maps on oriented trees, both oriented and unoriented.
Findings
Transition matrices are similar over ield and ield for all maps.
Characteristic polynomial is orm or all such matrices.
Coefficients are all odd integers when considered over ield.
Abstract
Let be an integer. In this note, we show that the {\it oriented} transition matrices over the field of all real numbers (over the finite field of two elements respectively) of all continuous {\it vertex maps} on {\it all} oriented trees with vertices are similar to one another over (over respectively) and have characteristic polynomial . Consequently, the {\it unoriented} transition matrices over the field of all continuous {\it vertex maps} on {\it all} oriented trees with vertices are similar to one another over and have characteristic polynomial . Therefore, the coefficients of the characteristic polynomials of these {\it unoriented} transition matrices, when considered over the field , are all odd integers (and hence nonzero).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Graph theory and applications · advanced mathematical theories
