7 papers
Variations on a circular Hessenberg pair
Kazumasa Nomura, Paul Terwilliger
A square matrix is called Hessenberg whenever each entry below the subdiagonal is zero and each entry on the subdiagonal is nonzero. A Hessenberg pair is an ordered pair of diagona…
Circular Hessenberg pairs and the tridiagonal relations
Kazumasa Nomura, Paul Terwilliger
A square matrix is said to be Hessenberg whenever each entry below the subdiagonal is zero, and each entry on the subdiagonal is nonzero. A Hessenberg matrix is called circular whe…
Strengthening the balanced set condition for the distance-regular graph of the bilinear forms
Paul Terwilliger, Jason Williford
We consider a distance-regular graph called the bilinear forms graph ; we assume and . We show that satisfies the follo…
An equitable partition for the distance-regular graph of the bilinear forms
Paul Terwilliger, Jason Williford
We consider a type of distance-regular graph called a bilinear forms graph. We assume that the diameter of is at least . Fix adjacent vertices $x,y…
Raising and lowering maps for tridiagonal pairs
Paul Terwilliger
Let denote a nonzero finite-dimensional vector space. A tridiagonal pair on is an ordered pair of maps in such that (i) each of is diagonal…
2-Homogeneous bipartite distance-regular graphs and the quantum group
Paul Terwilliger
We consider a 2-homogeneous bipartite distance-regular graph with diameter . We assume that is not a hypercube nor a cycle. We fix a -polynomial ordering of…