Cyclotomic Integer Symmetric Matrices II: Proof of the Classification Theorem

Author(s):  
James McKee ◽  
Chris Smyth
Author(s):  
Benson Farb ◽  
Dan Margalit

This chapter explains and proves the Nielsen–Thurston classification of elements of Mod(S), one of the central theorems in the study of mapping class groups. It first considers the classification of elements for the torus of Mod(T² before discussing higher-genus analogues for each of the three types of elements of Mod(T². It then states the Nielsen–Thurston classification theorem in various forms, as well as a connection to 3-manifold theory, along with Thurston's geometric classification of mapping torus. The rest of the chapter is devoted to Bers' proof of the Nielsen–Thurston classification. The collar lemma is highlighted as a new ingredient, as it is also a fundamental result in the hyperbolic geometry of surfaces.


1996 ◽  
Vol 11 (31) ◽  
pp. 2531-2537 ◽  
Author(s):  
TATSUO KOBAYASHI ◽  
ZHI-ZHONG XING
Keyword(s):  

We study the Kielanowski parametrization of the Kobayashi-Maskawa (KM) matrix V. A new two-angle parametrization is investigated explicitly and compared with the Kielanowski ansatz. Both of them are symmetric matrices and lead to |V13/V23|=0.129. Necessary corrections to the off-diagonal symmetry of V are also discussed.


2021 ◽  
Vol 618 ◽  
pp. 76-96
Author(s):  
M.A. Duffner ◽  
A.E. Guterman ◽  
I.A. Spiridonov
Keyword(s):  

2019 ◽  
Vol 7 (1) ◽  
pp. 257-262
Author(s):  
Kenji Toyonaga

Abstract Given a combinatorially symmetric matrix A whose graph is a tree T and its eigenvalues, edges in T can be classified in four categories, based upon the change in geometric multiplicity of a particular eigenvalue, when the edge is removed. We investigate a necessary and sufficient condition for each classification of edges. We have similar results as the case for real symmetric matrices whose graph is a tree. We show that a g-2-Parter edge, a g-Parter edge and a g-downer edge are located separately from each other in a tree, and there is a g-neutral edge between them. Furthermore, we show that the distance between a g-downer edge and a g-2-Parter edge or a g-Parter edge is at least 2 in a tree. Lastly we give a combinatorially symmetric matrix whose graph contains all types of edges.


Author(s):  
A. E. Guterman ◽  
M. A. Duffner ◽  
I. A. Spiridonov
Keyword(s):  

2021 ◽  
Vol 9 (1) ◽  
pp. 31-35
Author(s):  
Isaac Cinzori ◽  
Charles R. Johnson ◽  
Hannah Lang ◽  
Carlos M. Saiago
Keyword(s):  

Abstract Using the recent geometric Parter-Wiener, etc. theorem and related results, it is shown that much of the multiplicity theory developed for real symmetric matrices associated with paths and generalized stars remains valid for combinatorially symmetric matrices over a field. A characterization of generalized stars in the case of combinatorially symmetric matrices is given.


Sign in / Sign up

Export Citation Format

Share Document