Congruence of rational matrices defined by an integer matrix
type: Item
instance of: scholarly article
title: Congruence of rational matrices defined by an integer matrix
author: Marcin Gąsiorek
published in: Applied Mathematics and Computation
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 05Cxx
Mathematics Subject Classification ID: 15Axx
Mathematics Subject Classification ID: 06Axx
zbMATH DE Number: 7627642
zbMATH Keywords: matrix congruence
zbMATH Keywords: graph isomorphism
zbMATH Keywords: graph automorphism
zbMATH Keywords: Coxeter spectral graph theory
zbMATH Keywords: Coxeter matrix
zbMATH Keywords: positive-definite matrices
MaRDI profile type: Publication
full work available at URL: j.amc.2022.127639
OpenAlex ID: W4308219885
cites work: Quadratic forms. Combinatorics and numerical results
cites work: Q5422499
cites work: Bounds related to Coxeter spectral measures of graphs
cites work: A Coxeter type classification of one-peak principal posets
cites work: On algorithmic Coxeter spectral analysis of positive posets
cites work: One-peak posets with positive quadratic Tits form, their mesh translation quivers of roots, and programming in Maple and Python
cites work: On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams.
cites work: On algorithmic study of non-negative posets of corank at most two and their Coxeter-Dynkin types
cites work: Algorithms for isotropy groups of Cox-regular edge-bipartite graphs
cites work: Quadratic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix
cites work: A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
cites work: Inflation Agorithm for Cox-regular Postive Edge-bipartite Graphs with Loops
cites work: Mesh geometries of root orbits of integral quadratic forms
cites work: Algorithms Determining Matrix Morsifications, Weyl orbits, Coxeter Polynomials and Mesh Geometries of Roots for Dynkin Diagrams
cites work: A Coxeter-Gram classification of positive simply laced edge-bipartite graphs
cites work: Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification
cites work: Q1790462
cites work: A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices
cites work: A Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\)
cites work: Weyl orbits of matrix morsifications and a Coxeter spectral classification of positive signed graphs and quasi-Cartan matrices of Dynkin type \(\mathbb{A}_n\)
cites work: On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs
cites work: On the structure of loop-free non-negative edge-bipartite graphs
cites work: On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
DOI: 10.1016/J.AMC.2022.127639
description: scientific article; zbMATH DE number 7627642