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

Enumeration of alternating sequences

โœ Scribed by J.C. Parnami; K.C. Prasad


Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
143 KB
Volume
20
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Enumerating Alternating Trees
โœ Cedric Chauve; Serge Dulucq; Andrew Rechnitzer ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 164 KB

In this paper we examine the enumeration of alternating trees. We give a bijective proof of the fact that the number of alternating unrooted trees with n vertices is given by (1ร‚n2 n&1 ) n k=1 ( n k ) k n&1 , a problem first posed by A. Postnikov (1997, J. Combin. Theory Ser. A 79, 360 366). We also

The enumeration of generalised alternati
โœ I.P. Goulden; D.M. Jackson ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 595 KB

We &XV that a number of problems involving the en jmeration of alternating subsets of integers may be solved by a direct method as special cases of the enumeration of configurations which w have termed (2, q)-sequences. In this paper we consider a class of enumeration problems which have received a

Enumeration of subspaces by dimension se
โœ Edward A Bender; Raymond Coley; David P Robbins; Howard Rumsey Jr. ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 469 KB