Abstract
A rank function is a function f:2[d]→N such that f()=0 and f(A)≤ f(A∪x)≤f(A)+1 for all A⊆[d], x∈[d]\A. Athanasiadis conjectured an upper bound on the number of rank functions on 2[d]. We prove this conjecture and generalize it to functions with bounded jumps.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 398-403 |
| Number of pages | 6 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 87 |
| Issue number | 2 |
| DOIs | |
| State | Published - Aug 1999 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics