✦ LIBER ✦

The enumeration of integer sequences with a given number of colored records

✍ Scribed by Heinrich Niederhausen

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 685 KB
Volume: 34
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(93)90007-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotic Enumeration of Tournaments wi

Asymptotic Enumeration of Tournaments with a Given Score Sequence

✍ Brendan D. McKay; Xiaoji Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 560 KB

We obtain the asymptotic number of labeled trounaments with a given score sequence in the case where each score is nÂ2+O(n 3Â4+= ) for sufficiently small =>0. Some consequences for the score sequences of random tournaments are also noted. The method used is integration in n complex dimensions.

The asymptotic number of labeled graphs

The asymptotic number of labeled graphs with given degree sequences

✍ Edward A Bender; E.Rodney Canfield 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 470 KB

Asymptotic enumeration of tournaments wi

Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph

✍ Zhicheng Gao; Brendan D. McKay; Xiaoji Wang 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

This paper studies the probability that a random tournament with specified score sequence contains a specified subgraph. The exact asymptotic value is found in the case that the scores are not too far from regular and the subgraph is not too large. An ndimensional saddle-point method is used. As a s

Techniques for the compression of sequen

Techniques for the compression of sequences of integer numbers and real numbers with fixed absolute precision

✍ Omar G. Stradella; Giorgina Corongiu; Enrico Clementi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 657 KB

Algorithms to reduce the space needed to store information either in memory or magnetic media are presented. These algorithms were designed to pack and unpack two common kinds of data types: sequences of sets of integers that change in a regular fashion and real numbers of fixed absolute precision.

The number of blocks with a given defect

The number of blocks with a given defect group

✍ Geoffrey R Robinson 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 562 KB

The Enumeration of Permutations with a P

The Enumeration of Permutations with a Prescribed Number of “Forbidden” Patterns

✍ John Noonan; Doron Zeilberger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 219 KB

We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of ''forbidden'' patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns ''abc, '' ''cab,'' and ''