
doi: 10.1007/bf02662865
Assume that \(s_1,\dots, s_n\) are natural numbers. There are at most \(n+ \sum s_i\) sequences \((a_1,\dots, a_n)\) with \(0\leq a_i\leq s_i\) such that if \((a_1,\dots, a_n)\), \((b_1,\dots, b_n)\) are two of them then either \(a_i\leq b_i\) holds for every \(i\), or vice versa, or \(a_i b_i= 0\) holds for every \(i\).
Exact enumeration problems, generating functions, Extremal set theory, sequences, trees, enumeration
Exact enumeration problems, generating functions, Extremal set theory, sequences, trees, enumeration
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
