๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A study of the information conveyed about graphs defined by recurrence

โœ Scribed by V. V. Matyushkov

Book ID
105058502
Publisher
Springer US
Year
1966
Tongue
English
Weight
361 KB
Volume
1
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Zeros of a Class of Polynomials D
On the Zeros of a Class of Polynomials Defined by a Three Term Recurrence Relation
โœ E.K. Ifantis; P.N. Panagopoulos ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

Let \(P\_{N+1}(x)\) be the polynomial which is defined recursively by \(P\_{0}(x)=0\), \(P\_{1}(x)=1, \quad\) and \(\alpha\_{n} P\_{n+1}(x)+\alpha\_{n-1} P\_{n-1}(x)+b\_{n} P\_{n}(x)=x d\_{n} P\_{n}(x), \quad n=1, \quad 2, \ldots, N\), where \(\alpha\_{n}, b\_{n}, d\_{n}\) are real sequences with \(

The obstructions of a minor-closed set o
The obstructions of a minor-closed set of graphs defined by a context-free grammar
โœ B Courcelle; G Sรฉnizergues ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 979 KB

We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique soluti