Algorithms for isotropy groups of Cox-regular edge-bipartite graphs
From MaRDI portal
Publication:2805468
DOI10.3233/FI-2015-1234zbMATH Open1335.05146WikidataQ131316993 ScholiaQ131316993MaRDI QIDQ2805468FDOQ2805468
Authors: Stanisław Kasjan, Daniel Simson
Publication date: 11 May 2016
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Recommendations
- Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups
- Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
- Mesh algorithms for Coxeter spectral classification of Cox-regular edge-bipartite graphs with loops. II: Application to Coxeter spectral analysis
- Mesh algorithms for Coxeter spectral classification of Cox-regular edge-bipartite graphs with loops. I: Mesh root systems
- Inflation algorithm for Cox-regular positive edge-bipartite graphs with loops
Structural characterization of families of graphs (05C75) Other combinatorial number theory (11B75) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Cited In (21)
- A Coxeter spectral classification of positive edge-bipartite graphs. II: Dynkin type \(\mathbb{D}_n\)
- Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition I. Inflation Algorithm Revisited*
- Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups
- On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs
- Root systems and inflations of non-negative quasi-Cartan matrices
- A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices
- A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
- Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
- Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
- Periodicity in bilinear lattices and the Coxeter formalism
- Applications of mesh algorithms and self-dual mesh geometries of root Coxeter orbits to a Horn-Sergeichuk type problem
- A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
- Algorithms computing \(O (n, \mathbb Z)\)-orbits of \(P\)-critical edge-bipartite graphs and \(P\)-critical unit forms using Maple and C\#
- Weyl orbits of matrix morsifications and a Coxeter spectral classification of positive signed graphs and quasi-Cartan matrices of Dynkin type \(\mathbb{A}_n\)
- Weyl roots and equivalences of integral quadratic forms
- A Coxeter spectral classification of positive edge-bipartite graphs. I: Dynkin types \(\mathcal{B}_n\), \(\mathcal{C}_n\), \(\mathcal{F}_4\), \(\mathcal{G}_2\), \(\mathbb{E}_6\), \(\mathbb{E}_7\), \(\mathbb{E}_8\)
- Coxeter Invariants for Non-negative Unit Forms of Dynkin Type 𝔸r
- Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
- Quadratic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix
- Congruence of rational matrices defined by an integer matrix
- Graphical characterization of positive definite non symmetric quasi-Cartan matrices
This page was built for publication: Algorithms for isotropy groups of Cox-regular edge-bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805468)