A matrix is Bohemian if its elements are taken from a finite set of integers. An upper
Hessenberg matrix is normalized if all its subdiagonal elements are ones, and hollow if it …

This thesis develops several algorithms for working with matrices whose entries are
multivariate polynomials in a set of parameters. Such parametric linear systems often appear …

We look at Bohemian matrices, specifically those with entries from {− 1, 0,+ 1}. More, we
specialize the matrices to be upper Hessenberg, with subdiagonal entries±1. Many …

We recount our experience teaching an experimental mathematics course using computer
algebra and other computational tools. We used active learning methods [1, 2]. The central …

Bohemian matrices are families of matrices whose entries come from a fixed discrete set of
small integers. The term is a contraction of BOunded HEight Matrix of Integers and was …