✦ LIBER ✦

On the algebraic theory of pseudo-distance-regularity around a set

✍ Scribed by M.A. Fiol; E. Garriga

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 216 KB
Volume: 298
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(99)00154-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The pseudo-cosine sequences of a distanc

The pseudo-cosine sequences of a distance-regular graph

✍ Arlene A. Pascasio; Paul Terwilliger 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 335 KB

Let denote a distance-regular graph with diameter D 3, valency k, and intersection numbers a i , b i , c i . By a pseudo-cosine sequence of we mean a sequence of real numbers σ 0 , σ 1 , . . . , σ D such that σ 0 = 1 and c i σ i-1 + a i σ i + b i σ i+1 = kσ 1 σ i for 0 i D -1. Let σ 0 , σ 1 , . . .

The Terwilliger algebra of a distance-re

The Terwilliger algebra of a distance-regular graph of negative type

✍ Štefko Miklavič 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Let denote a distance-regular graph with diameter D 3. Assume has classical parameters (D, b, α, β) with b < -1. Let X denote the vertex set of and let A ∈ Mat X (C) denote the adjacency matrix of . Fix x ∈ X and let A \* ∈ Mat X (C) denote the corresponding dual adjacency matrix. Let T denote the s

The Terwilliger Algebra of a 2-Homogeneo

The Terwilliger Algebra of a 2-Homogeneous Bipartite Distance-Regular Graph

✍ Brian Curtin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Let 1 denote a 2-homogeneous bipartite distance-regular graph with diameter D 3 and valency k 3. Assume that 1 is not isomorphic to a Hamming cube. Fix a vertex x of 1, and let T=T(x) denote the Terwilliger algebra of T with respect to x. We give three sets of generators for T, two of which satisfy

A Note on Regularity of Sets and of Dist

A Note on Regularity of Sets and of Distance Functions in Banach Space

✍ J.M. Borwein; M. Fabian 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 148 KB

On the distance to the zero-set of a pol

On the distance to the zero-set of a polynomial

✍ Matthew A Grayson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 49 KB

On the Boolean algebras of definable set

On the Boolean algebras of definable sets in weakly o-minimal theories

✍ Stefano Leonesi; Carlo Toffalori 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

## Abstract We consider the sets definable in the countable models of a weakly o‐minimal theory __T__ of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence __T__ is p‐__ω__‐categorical), in other words when each of these definable sets adm