TOPICS
Search

Bohemian Matrix


A Bohemian matrix is a matrix whose entries are restricted to a fixed finite set, called its population (Corless 2021). Such populations yield finite families at each matrix size, allowing the spectra and other properties of the whole family to be studied.

For example, let T_m(u) be the m×m tridiagonal matrix with zero diagonal, superdiagonal u=(u_1,...,u_(m-1)) in {1,i}^(m-1), and subdiagonal -u. It is skew-symmetric using transpose, without taking complex conjugates. Blattner (2026) proved that T_m(u) is a nilpotent matrix iff m=2^K-1 for a positive integer K and u is obtained from the empty vector by K-1 applications of

 u|->(u,1,i,revu), u|->(u,i,1,revu),

where revu reverses the order of the coordinates. There are exactly 2^(K-1) such matrices of order 2^K-1. Each is similar to a single Jordan block.

These matrices are diagonally similar to tridiagonal matrices with zero diagonal, all superdiagonal entries equal to 1, and subdiagonal entries in {-1,1}. Blattner (2026) reports that Claude wrote the Lean formalization and exact verification programs for the classification and that he checked the mathematical arguments.


See also

Matrix, Nilpotent Matrix, Tridiagonal Matrix

Explore with Wolfram|Alpha

References

Blattner, M. "Nilpotent Skew-Symmetric Tridiagonal Bohemian Matrices: A Proof of Corless's Conjecture." 18 Nov 2026. https://arxiv.org/abs/2611.25266v1.Corless, R. M. "Skew-Symmetric Tridiagonal Bohemian Matrices." Maple Trans. 1, 14360, 2021. https://doi.org/10.5206/mt.v1i2.14360.

Cite this as:

Weisstein, Eric W. "Bohemian Matrix." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BohemianMatrix.html

Subject classifications