English

A classification of small operators using graph theory

History and Overview 2017-10-24 v1 Combinatorics

Abstract

Given a real n×mn \times m matrix BB, its operator norm can be defined as B=maxv=1Bv.|B|=\max_{|v|=1}|Bv|. We consider a matrix "small" if it has non-negative integer entries and its operator norm is less than 22. These matrices correspond to bipartite graphs with spectral radius less than 22, which can be classified as disjoint unions of Coxeter graphs. This gives a direct route to an ADEADE-classification result in terms of very basic mathematical objects. Our goal here is to see these results as part of a general program of classification of small objects, relating quadratic forms, reflection groups, root systems, and Lie algebras.

Keywords

Cite

@article{arxiv.1710.07809,
  title  = {A classification of small operators using graph theory},
  author = {Terrence Bisson and Jonathan Lopez},
  journal= {arXiv preprint arXiv:1710.07809},
  year   = {2017}
}

Comments

16 pages, the main goal of this paper is to exposit a self-contained ADE-classification result that requires minimal background

R2 v1 2026-06-22T22:21:26.582Z