𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized Samuel numbers and A.P filtrations

✍ Scribed by Philippe Ayegnon; Daouda Sangare

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
877 KB
Volume
65
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generalized Rotation numbers
Generalized Rotation numbers
✍ Robin J. Chapman; Julie Haviland πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 484 KB

## Abstract A __rooted graph__ is a pair (__G,x__), where __G__ is a simple undirected graph and __x__ ∈ __V__(__G__). If __G__ is rooted at __x__, its k__th rotation number h~k~__ (__G,x__) is the minimum number of edges in a graph __F__ of order |__G__| + __k__ such that for every __v__ ∈ __V__(_

Generalized Stirling and Lah numbers
Generalized Stirling and Lah numbers
✍ Carl G. Wagner πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 836 KB

The theory of modular binomial lattices enables the simultaneous combinatorial analysis of finite sets, vector spaces, and chains. Within this theory three generalizations of Stifling numbers of the second kind, and of Lah numbers, are developed.

Generalized VAN DER POL numbers
Generalized VAN DER POL numbers
✍ F. T. Howard πŸ“‚ Article πŸ“… 1970 πŸ› John Wiley and Sons 🌐 English βš– 359 KB
Generalized Split Graphs and Ramsey Numb
Generalized Split Graphs and Ramsey Numbers
✍ AndrΓ‘s GyΓ‘rfΓ‘s πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 283 KB

A graph G is called a ( p, q)-split graph if its vertex set can be partitioned into A, B so that the order of the largest independent set in A is at most p and the order of the largest complete subgraph in B is at most q. Applying a well-known theorem of Erdo s and Rado for 2-systems, it is shown th