Maximum trees of finite sequences (Q1904988): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3741626 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: When is one estimate of evolutionary relationships a refinement of another? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of cladistic characters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Families of finite sets with prescribed cardinalities for pairwise intersections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal problems and coverings of the space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Set-systems with prescribed cardinalities for pairwise intersections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4306949 / rank | |||
Normal rank |
Revision as of 09:12, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum trees of finite sequences |
scientific article |
Statements
Maximum trees of finite sequences (English)
0 references
13 August 1996
0 references
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\).
0 references
trees
0 references
enumeration
0 references
sequences
0 references