Paul M. Terwilliger

activity

20012009

P

-and

Q

-polynomial association schemes

40 citations · 240 across the 48 of their papers we have counts for

collaborators

Showing 2003 · math.COShow all

4 papers · 2 filters

math.CO2003

The Pseudo Cosine Sequences of a Distance-Regular Graph

Arlene A. Pascasio, Paul Terwilliger

Let $G$ denote a distance-regular graph with diameter $D \geq 3$ , valency $k$ , and intersection numbers $a_{i}$ , $b_{i}$ , $c_{i}$ . By a {\it pseudo cosine sequence} of $G$ we mean a sequen…

math.CO2003

An inequality for regular near polygons

Paul Terwilliger, Chih-wen Weng

Let $G$ denote a near-polygon distance-regular graph with diameter $d \geq 3$ , valency $k$ and intersection numbers $a_{1} > 0$ , $c_{2} > 1$ . Let $θ_{1}$ denote the second largest eigenvalue…

math.CO2003

Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra

Paul Terwilliger, Chih-wen Weng

Let $Γ$ denote a distance-regular graph with diameter $D \geq 3$ and Bose-Mesner algebra $M$ . For $θ \in C \cup \infty$ we define a 1 dimensional subspace of $M$ which we call $M (θ)$ .…

math.CO2003★ 1 cited

The displacement and split decompositions for a $Q$ -polynomial distance-regular graph

Paul Terwilliger

Let $Γ$ denote a $Q$ -polynomial distance-regular graph with diameter at least three and standard module $V$ . We introduce two direct sum decompositions of $V$ . We call these the di…

The Pseudo Cosine Sequences of a Distance-Regular Graph

An inequality for regular near polygons

Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra

The displacement and split decompositions for a Q-polynomial distance-regular graph

The displacement and split decompositions for a $Q$ -polynomial distance-regular graph