A constructive proof of Tucker's combinatorial lemma
โ Scribed by Robert M Freund; Michael J Todd
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 241 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract Suppose that __f~n~__ is a sequence of nonnegative functions with compact support on a locally compact metric space, that __T__ is a nonnegative linear functional, and that $ \sum ^\infty \_{n=1}$ __T f~n~__ < __T f~0~__. A result of Bishop, foundational to a constructive theory of func
Let Q c R a be open and LZ~=ZcaD026 be n linear differential opentor with constant coefficients, and adjoint L\*zi = C (l)'"'e,Dazs. We give D proof of the following variant of WEYL'S lemma. d Letit~rta. Every contiwma 8olutim of h = O in the distributional sense is the iocalhj uniform h i t of G+'-
Elementary asymptotic methods suffice to establish asymptotic series for the coeficients of analytic functions with algebraic singularities.