My graphs are not very regular, they are obtains after some operations on regular langages from a automaton obtain from a semi-group. So they have the property that there is at most 2 outgoing edges from each vertex (I study the case of 2-generated semi-groups). It is complicated to explain where they come from. I give a description here : http://www.latp.univ-mrs.fr/~paul.mercat/Publis/Semi-groupes%20fortement%20automatiques.pdf and you can find my source code here : http://trac.sagemath.org/ticket/15883. So to have a way to compute a approximate value of the spectral radius permits my to improve the computing of the critical exponent of a beta-adic monoid. But I'm also interested of the conjugate of this spectral radius (and hence its exact value). If could find symmetries in my graphs I would be happy !
Le jeudi 27 mars 2014 23:31:46 UTC+1, Dima Pasechnik a écrit : > > On 2014-03-27, Paul Mercat <mer...@yahoo.fr <javascript:>> wrote: > > No, I have no idea of what will be the degree of the number field in > which > > my spectral radius belongs to. > > But if I could compute the characteristic polynomial of the matrix, I > could > > have the minimal polynomial of the spectral radius (and that's what I > mean > > by exact value). > > if your graph is highly irregular, the degree of the minimal > polynomial will be not too far from the number of vertices, and so > you'd be really out of luck. > How do you obtain your graphs? Do they have any symmetry? > > > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
