Generalized Rank Functions and an Entropy Argument
β Scribed by Jeff Kahn; Alexander Lawrenz
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 99 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
A rank function is a function f : 2 [d] Γ N such that f (<)=0 and
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.
π SIMILAR VOLUMES
An essential point of view was of course the question how generalized entropy numbers and entropy ideals can be employed for getting informations about the usual entropy numbers e,(T) and thus about the degree of compactness of an operator T in the usual sense. It turned out that reiteration and fac
The methods for determining OWA operator weights have aroused wide attention. We first review the main existing methods for determining OWA operator weights. We next introduce the principle of maximum entropy for setting up probability distributions on the basis of partial knowledge and prove that X
By reformulating the equations governing such polygamma functions in terms of a truncated Riemann Zeta function, we derive expressions which enable their evaluation to a much higher degree of accuracy without any additional computational effort.
Antibody inhibition experiments are proving to be extremely valuable in probing the in vivo functions of actin-and microtubule-based motor proteins in the early development of echinoderm embryos, despite some skepticism among many cell biologists concerning the reliability of this approach. Antibody