Generalized binomial coefficients of the first and second kind are defined in terms of object selection with and without repetition from weighted boxes. The combinatorial definition unifies the binomial coefficients, the Gaussian coefficients, and the Stirling numbers and their recurrence relations
Regularly decreasing weights and the topological subspace problem
β Scribed by Jari Taskinen
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 136 KB
- Volume
- 278
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We improve the example of a weighted space of analytic functions given in [8]: we replace the discontinuous weights of [8] by continuous ones and the disconnected domain by a connected one. (Β© 2005 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
π SIMILAR VOLUMES
This paper addresses the searchlight guarding problem, which is an extension of so-called graph searching/guarding problem on a weighted, undirected graph G by considering the time-slot parameter in addition to the traditional building cost. Given a weighted, undirected graph G G G, suppose that the
Various notions of stable ranks are studied for topological algebras. Some partial answers to R. G. Swan's problem (Have two Banach or good Fre chet algebras as in the density theorem in K-theory the same stable rank?) are obtained. For example, a Fre chet dense V -subalgebra A of a C\*-algebra B, c