default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul M. Terwilliger
Person information
- affiliation: University of Wisconsin, Department of Mathematics, Madison, WI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j44]Kazumasa Nomura, Paul M. Terwilliger:
Spin models and distance-regular graphs of q-Racah type. Eur. J. Comb. 124: 104069 (2025)- 2024
- [j43]Paul M. Terwilliger
:
A Q-polynomial structure for the Attenuated Space poset Aq(N,M). J. Comb. Theory, Ser. A 205: 105872 (2024) - 2023
- [j42]Paul M. Terwilliger:
A Q-Polynomial Structure Associated with the Projective Geometry LN(q). Graphs Comb. 39(4): 63 (2023) - [j41]Paul M. Terwilliger:
Tridiagonal pairs, alternating elements, and distance-regular graphs. J. Comb. Theory A 196: 105724 (2023) - 2022
- [j40]Paul M. Terwilliger:
A compact presentation for the alternating central extension of the positive part of Uq(sl^2). Ars Math. Contemp. 22(3): 3 (2022) - 2021
- [j39]Paul M. Terwilliger:
Notes on the Leonard System Classification. Graphs Comb. 37(5): 1687-1748 (2021) - [j38]Kazumasa Nomura, Paul M. Terwilliger:
Leonard pairs, spin models, and distance-regular graphs. J. Comb. Theory A 177: 105312 (2021) - [j37]Sebastian M. Cioaba, Jack H. Koolen, Paul M. Terwilliger:
Connectivity concerning the last two subconstituents of a Q-polynomial distance-regular graph. J. Comb. Theory A 177: 105325 (2021) - [j36]Paul M. Terwilliger:
The Norton algebra of a Q-polynomial distance-regular graph. J. Comb. Theory A 182: 105477 (2021)
2010 – 2019
- 2019
- [j35]Paul M. Terwilliger, Arjana Zitnik:
The quantum adjacency algebra and subconstituent algebra of a graph. J. Comb. Theory A 166: 297-314 (2019) - 2018
- [j34]Paul M. Terwilliger:
Tridiagonal pairs of q-Racah type, the Bockting operator ψ, and L-operators for Uq(L(sl2)). Ars Math. Contemp. 14(1): 55-65 (2018) - 2014
- [j33]Paul M. Terwilliger, Arjana Zitnik:
Distance-regular graphs of q-Racah type and the universal Askey-Wilson algebra. J. Comb. Theory A 125: 98-112 (2014) - 2013
- [j32]Paul M. Terwilliger, Chalermpong Worawannotai:
Augmented down-up algebras and uniform posets. Ars Math. Contemp. 6(2): 409-417 (2013) - 2010
- [j31]Aleksandar Jurisic, Paul M. Terwilliger, Arjana Zitnik:
Distance-regular graphs with light tails. Eur. J. Comb. 31(6): 1539-1552 (2010) - [j30]Aleksandar Jurisic, Paul M. Terwilliger, Arjana Zitnik:
The Q-polynomial idempotents of a distance-regular graph. J. Comb. Theory B 100(6): 683-690 (2010)
2000 – 2009
- 2009
- [j29]Tatsuro Ito, Paul M. Terwilliger:
Distance-regular graphs and the q-tetrahedron algebra. Eur. J. Comb. 30(3): 682-697 (2009) - 2008
- [j28]Mark S. MacLean, Paul M. Terwilliger:
The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two. Discret. Math. 308(7): 1230-1259 (2008) - 2007
- [j27]Michael S. Lang, Paul M. Terwilliger:
Almost-bipartite distance-regular graphs with the Q-polynomial property. Eur. J. Comb. 28(1): 258-265 (2007) - 2006
- [j26]Mark S. MacLean, Paul M. Terwilliger:
Taut distance-regular graphs and the subconstituent algebra. Discret. Math. 306(15): 1694-1721 (2006) - 2005
- [j25]Paul M. Terwilliger:
Two Linear Transformations each Tridiagonal with Respect to an Eigenbasis of the other; Comments on the Parameter Array. Des. Codes Cryptogr. 34(2-3): 307-332 (2005) - [j24]John S. Caughman IV, Mark S. MacLean, Paul M. Terwilliger:
The Terwilliger algebra of an almost-bipartite P- and Q-polynomial association scheme. Discret. Math. 292(1-3): 17-44 (2005) - [j23]Paul M. Terwilliger, Chih-Wen Weng:
An inequality for regular near polygons. Eur. J. Comb. 26(2): 227-235 (2005) - [j22]Paul M. Terwilliger:
The Displacement and Split Decompositions for a Q-Polynomial Distance-regular Graph. Graphs Comb. 21(2): 263-276 (2005) - 2004
- [j21]Paul M. Terwilliger, Chih-Wen Weng:
Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra. Eur. J. Comb. 25(2): 287-298 (2004) - 2003
- [j20]Eiichi Bannai, Akihiro Munemasa, Sung-Yell Song, Paul M. Terwilliger:
Preface. Discret. Math. 264(1-3): 1 (2003) - 2002
- [j19]Junie T. Go, Paul M. Terwilliger:
Tight Distance-regular Graphs and the Subconstituent Algebra*1. Eur. J. Comb. 23(7): 793-816 (2002)
1990 – 1999
- 1999
- [c1]Tatsuro Ito, Kenichiro Tanabe, Paul M. Terwilliger:
Some algebra related to P- and Q-polynomial association schemes. Codes and Association Schemes 1999: 167-192 - 1996
- [j18]Kequan Ding, Paul M. Terwilliger:
On Garsia-Remmel problem of rook equivalence. Discret. Math. 149(1-3): 59-68 (1996) - [j17]Garth A. Dickie, Paul M. Terwilliger:
Dual Bipartite Q-polynomial Distance-regular Graphs. Eur. J. Comb. 17(7): 613-623 (1996) - 1995
- [j16]Paul M. Terwilliger:
A new inequality for distance-regular graphs. Discret. Math. 137(1-3): 319-332 (1995) - [j15]Paul M. Terwilliger:
Kite-free distance-regular graphs. Eur. J. Comb. 16(4): 405-414 (1995) - 1993
- [j14]Paul M. Terwilliger:
P- and Q-Polynomial Association Schemes and Their Antipodal P-Polynomial Covers. Eur. J. Comb. 14(4): 355-358 (1993)
1980 – 1989
- 1988
- [j13]Paul M. Terwilliger:
The classification of distance-regular graphs of type IIB. Comb. 8(1): 125-132 (1988) - [j12]Paul M. Terwilliger:
Balanced sets andQ-polynomial association schemes. Graphs Comb. 4(1): 87-94 (1988) - 1987
- [j11]Paul M. Terwilliger:
Root Systems and The Johnson and Hamming Graphs. Eur. J. Comb. 8(1): 73-102 (1987) - [j10]Paul M. Terwilliger, Michel Deza:
The classification of finite connected hypermetric spaces. Graphs Comb. 3(1): 293-298 (1987) - [j9]Paul M. Terwilliger:
P and Q polynomial schemes with q = -1. J. Comb. Theory B 42(1): 64-67 (1987) - [j8]Paul M. Terwilliger:
A characterization of P- and Q-polynomial association schemes. J. Comb. Theory A 45(1): 8-26 (1987) - 1986
- [j7]Paul M. Terwilliger:
The Johnson graph J(d, r) is unique if (d, r) != (2, 8). Discret. Math. 58(2): 175-189 (1986) - [j6]Paul M. Terwilliger:
A new feasibility condition for distance-regular graphs. Discret. Math. 61(2-3): 311-315 (1986) - [j5]Paul M. Terwilliger:
A class of distance-regular graphs that are Q-polynomial. J. Comb. Theory B 40(2): 213-223 (1986) - 1985
- [j4]Paul M. Terwilliger:
Distance-regular graphs with girth 3 or 4: I. J. Comb. Theory B 39(3): 265-281 (1985) - 1983
- [j3]Paul M. Terwilliger:
Distance-regular graphs and (s, c, a, k)-graphs. J. Comb. Theory B 34(2): 151-164 (1983) - 1982
- [j2]Paul M. Terwilliger:
Eigenvalue multiplicities of highly symmetric graphs. Discret. Math. 41(3): 295-302 (1982) - [j1]Paul M. Terwilliger:
The diameter of bipartite distance-regular graphs. J. Comb. Theory B 32(2): 182-188 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
