| Naslov: | Every Q-polynomial distance-regular graph is sharp over $\mathbb{R}$ |
|---|
| Avtorji: | ID Fernández, Blas (Avtor)
ID Lee, Jae-Ho (Avtor)
ID Park, Jongyook (Avtor) |
|---|
| Datoteke: |  https://www.sciencedirect.com/science/article/pii/S009731652600066X
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Neznano |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | FAMNIT - Fakulteta za matematiko, naravoslovje in informacijske tehnologije
|
|---|
| Opis: | Let $\Gamma$ be a $Q$-polynomial distance-regular graph, and let $T=T(x)$ denote its Terwilliger algebra with respect to a fixed vertex $x$. While it has long been known that every irreducible $T$-module over the complex field is sharp, the corresponding result over the real field had remained unproved. In this work, we establish that every irreducible $T$-module over $\mathbb{R}$ is also sharp. This resolves the real analogue of a theorem of Nomura and Terwilliger and shows that every $Q$-polynomial distance-regular graph is sharp over both $\mathbb{R}$ and $\mathbb{C}$. As further consequences, we prove that the complexification of an irreducible real $T$-module remains irreducible, characterize isomorphism classes via complexification, determine the Wedderburn decomposition of the real Terwilliger algebra, and show that several naturally arising subalgebras are commutative and consist entirely of symmetric matrices. These results clarify the relationship between the real and complex representation theories of the Terwilliger algebra and
provide new structural insight into $Q$-polynomial distance-regular graphs.
|
|---|
| Ključne besede: | distance-regular graphs, Q-polynomial property, Terwilliger algebra |
|---|
| Leto izida: | 2026 |
|---|
| Št. strani: | str. 1-36 |
|---|
| Številčenje: | Vol. 224, article 106223 |
|---|
| PID: | 20.500.12556/RUP-23328  |
|---|
| UDK: | 519.17 |
|---|
| ISSN pri članku: | 0097-3165 |
|---|
| DOI: | 10.1016/j.jcta.2026.106223 |
|---|
| COBISS.SI-ID: | 285240579 |
|---|
| Datum objave v RUP: | 17.07.2026 |
|---|
| Število ogledov: | 20 |
|---|
| Število prenosov: | 1 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
