Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 10 / 13
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
1.
Uniform equations for bipartite graphs and the center of a Terwilliger algebra
Štefko Miklavič, Giusy Monzillo, 2026, izvirni znanstveni članek

Opis: The uniform property was introduced by P. Terwilliger in the context of graded posets and was later extended to connected bipartite graphs. The core of this definition involves the so called uniform equations that must be satisfied. Let Γ denote a connected bipartite graph. Fix a vertex x of Γand let T=T(x) denote the corresponding Terwilliger algebra. In this paper, we study the connections between the uniform equations and the center of T. We show that these uniform equations give rise to a certain subspace of the center of T. Changing the logical direction, we show that if a matrix of a particular form belongs to the center of T, then uniform equations are satisfified.
Ključne besede: uniform equations, center of a Terwilliger algebra, bipartite graphs
Objavljeno v RUP: 08.05.2026; Ogledov: 271; Prenosov: 8
.pdf Celotno besedilo (966,73 KB)
Gradivo ima več datotek! Več...

2.
3.
4.
5.
6.
On a certain class of 1-thin distance-regular graphs
Mark MacLean, Štefko Miklavič, 2020, izvirni znanstveni članek

Ključne besede: distance-regular graph, Terwilliger algebra, subconstituent algebra
Objavljeno v RUP: 20.07.2020; Ogledov: 4640; Prenosov: 98
.pdf Celotno besedilo (379,60 KB)

7.
8.
9.
10.
On the Terwilliger algebra of bipartite distance-regular graphs with [Delta][sub]2 = 0 and c[sub]2=1
Mark MacLean, Štefko Miklavič, Safet Penjić, 2016, izvirni znanstveni članek

Opis: Let ▫$\Gamma$▫ denote a bipartite distance-regular graph with diameter ▫$D \geq 4$▫ and valency ▫$k \geq 3$▫. Let ▫$X$▫ denote the vertex set of ▫$\Gamma$▫, and let ▫$A$▫ denote the adjacency matrix of ▫$\Gamma$▫. For ▫$x \in X$▫ and for ▫$0 \leq i \leq D$▫, let ▫$\operatorname{\Gamma}_i(x)$▫ denote the set of vertices in ▫$X$▫ that are distance ▫$i$▫ from vertex ▫$x$▫. Define a parameter ▫$\operatorname{\Delta}_2$▫ in terms of the intersection numbers by ▫$\operatorname{\Delta}_2 = (k - 2)(c_3 - 1) -(c_2 - 1) p_{22}^2$▫. We first show that ▫$\operatorname{\Delta}_2 = 0$▫ implies that ▫$D \leq 5$▫ or ▫$c_2 \in \{1, 2 \}$▫. For ▫$x \in X$▫ let ▫$T = T(x)$▫ denote the subalgebra of ▫$\text{Mat}_X(\mathbb{C})$▫ generated by ▫$A, E_0^\ast, E_1^\ast, \ldots, E_D^\ast$▫, where for ▫$0 \leq i \leq D$, $E_i^\ast$▫ represents the projection onto the▫ $i$▫th subconstituent of ▫$\Gamma$▫ with respect to ▫$x$▫. We refer to ▫$T$▫ as the Terwilliger algebra of ▫$\Gamma$▫ with respect to ▫$x$▫. By the endpoint of an irreducible ▫$T$▫-module ▫$W$▫ we mean ▫$\min \{i | E_i^\ast W \ne 0 \}$▫. In this paper we assume ▫$\Gamma$▫ has the property that for ▫$2 \leq i \leq D - 1$▫, there exist complex scalars ▫$\alpha_i$▫, ▫$\beta_i$▫ such that for all ▫$x, y, z \in X$▫ with ▫$\partial(x, y) = 2$▫, ▫$\partial(x, z) = i$▫, ▫$\partial(y, z) = i$▫, we have ▫$\alpha_i + \beta_i | \operatorname{\Gamma}_1(x) \cap \operatorname{\Gamma}_1(y) \cap \operatorname{\Gamma}_{i - 1}(z) | = | \operatorname{\Gamma}_{i - 1}(x) \cap \operatorname{\Gamma}_{i - 1}(y) \cap \operatorname{\Gamma}_1(z) |$▫. We additionally assume that▫ $\operatorname{\Delta}_2 = 0$▫ with ▫$c_2 = 1$▫. Under the above assumptions we study the algebra ▫$T$▫. We show that if ▫$\Gamma$▫ is not almost 2-homogeneous, then up to isomorphism there exists exactly one irreducible ▫$T$▫-module with endpoint 2. We give an orthogonal basis for this ▫$T$▫-module, and we give the action of ▫$A$▫ on this basis.
Ključne besede: distance-regular graphs, terwilliger algebra, subconstituent algebra
Objavljeno v RUP: 14.11.2017; Ogledov: 4332; Prenosov: 150
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.03 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici