Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Simson, Daniel
Affiliations: Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Chopina 12/18, 87-100 Toruń, Poland. simson@mat.umk.torun.pl
Note: [] Supported by Polish Research Grant NCN 2011/03/B/ST1/00824 Address for correspondence: Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, ul. Chopina 12/18, 87-100 Toruń, Poland
Abstract: Following the spectral Coxeter analysis of matrix morsifications for Dynkin diagrams, the spectral graph theory, a graph coloring technique, and algebraic methods in graph theory, we continue our study of the category 𝒰ℬigrn of loop-free edge-bipartite (signed) graphs Δ, with n ≥ 2 vertices, by means of the Coxeter number cΔ, the Coxeter spectrum speccΔ of Δ, that is, the spectrum of the Coxeter polynomial coxΔ(t) ∈ $\mathbb{Z}$[t] and the $\mathbb{Z}$-bilinear Gram form bΔ : $\mathbb{Z}$n × $\mathbb{Z}$n → $\mathbb{Z}$ of Δ [SIAM J. Discrete Math. 27(2013)]. Our main inspiration for the study comes from the representation theory of posets, groups and algebras, Lie theory, and Diophantine geometry problems. We show that the Coxeter spectral classification of connected edge-bipartite graphs Δ in 𝒰ℬigrn reduces to the Coxeter spectral classification of rational matrix morsifications A ∈ $\widehat{M}$orDΔ for a simply-laced Dynkin diagram DΔ associated with Δ. Given Δ in 𝒰ℬigrn, we study the isotropy subgroup Gl(n,$\mathbb{Z}$)Δ of Gl(n, $\mathbb{Z}$) that contains the Weyl group $\mathbb{W}$Δ and acts on the set $\widehat{M}$orΔ of rational matrix morsifications A of Δ in such a way that the map A $\mapsto$ (speccA, det A, cΔ) is Gl(n, $\mathbb{Z}$)Δ-invariant. It is shown that, for n ≤ 6, speccΔ is the spectrum of one of the Coxeter polynomials listed in Tables 3.11-3.11(a) (we determine them by computer search using symbolic and numeric computation). The question, if two connected positive edge-bipartite graphs Δ,Δ′ in 𝒰ℬigrn, with speccΔ = speccΔ′, are $\mathbb{Z}$-bilinear equivalent, is studied in the paper. The problem if any $\mathbb{Z}$-invertible matrix A ∈ Mn($\mathbb{Z}$) is $\mathbb{Z}$-congruent with its transpose Atr is also discussed.
Keywords: edge-bipartite graph, toroidal mesh algorithm, inflation algorithm, matrix morsification, Dynkin diagram, Coxeter spectrum, Weyl group, Euler bilinear form, mesh geometry of root orbits, toroidal mesh algorithm, sand-glass tube
DOI: 10.3233/FI-2013-836
Journal: Fundamenta Informaticae, vol. 124, no. 3, pp. 309-338, 2013
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl