Character tables are ideal Perron similarities

An invertible matrix is called a Perron similarity if it diagonalizes an irreducible, nonnegative matrix. Each Perron similarity gives a nontrivial polyhedral cone, called the spectracone, and polytope, called the spectratope, of realizable spectra (thought of as vectors in complex Euclidean space). A Perron similarity is called ideal if its spectratope coincides with the conical hulls of its rows. Identifying ideal Perron similarities is of great interest in the pursuit of the longstanding nonnegative inverse eigenvalue problem. In this work, it is shown that the character table of a finite group is an ideal Perron similarity. In addition to expanding ideal Perron similarities to include a broad class of matrices, the results unify previous works into a single, theoretical framework. It is demonstrated that the spectracone can be described by finitely-many group-theoretic inequalities. When the character table is real, we derive a group-theoretic formula for the volume of the projected Perron spectratope, which is a simplex. Finally, an implication for further research is given.

Publication Details

Journal
ArXiv.org
Published
2025-08-04
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Character tables are ideal Perron similarities

ArXiv.org
Matrix Theory and Algorithms
article

Character tables are ideal Perron similarities

article en

Abstract

An invertible matrix is called a Perron similarity if it diagonalizes an irreducible, nonnegative matrix. Each Perron similarity gives a nontrivial polyhedral cone, called the spectracone, and polytope, called the spectratope, of realizable spectra (thought of as vectors in complex Euclidean space). A Perron similarity is called ideal if its spectratope coincides with the conical hulls of its rows. Identifying ideal Perron similarities is of great interest in the pursuit of the longstanding nonnegative inverse eigenvalue problem. In this work, it is shown that the character table of a finite group is an ideal Perron similarity. In addition to expanding ideal Perron similarities to include a broad class of matrices, the results unify previous works into a single, theoretical framework. It is demonstrated that the spectracone can be described by finitely-many group-theoretic inequalities. When the character table is real, we derive a group-theoretic formula for the volume of the projected Perron spectratope, which is a simplex. Finally, an implication for further research is given.

ArXiv.org
Reduced inequalities
Openalex Percentile: Top 47%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Character tables are ideal Perron similarities · ArXiv.org (2025) | TGRS Research Map | TGRS