A Müntz space having no complement in $L_{1}$
نویسندگان
چکیده
منابع مشابه
Müntz Systems and Orthogonal Müntz - Legendre Polynomials
The Müntz-Legendre polynomials arise by orthogonalizing the Müntz system {xxo, xx¡, ...} with respect to Lebesgue measure on [0, 1]. In this paper, differential and integral recurrence formulae for the Müntz-Legendre polynomials are obtained. Interlacing and lexicographical properties of their zeros are studied, and the smallest and largest zeros are universally estimated via the zeros of Lague...
متن کاملLow Decision Space Means No Decentralization in Fiji; Comment on “Decentralisation of Health Services in Fiji: A Decision Space Analysis”
Mohammed, North, and Ashton find that decentralization in Fiji shifted health-sector workloads from tertiary hospitals to peripheral health centres, but with little transfer of administrative authority from the centre. Decisionmaking in five functional areas analysed remains highly centralized. They surmise that the benefits of decentralization in terms of services and outcomes will be limited....
متن کامل$L_1/\ell_1$-to-$L_1/\ell_1$ analysis of linear positive impulsive systems with application to the $L_1/\ell_1$-to-$L_1/\ell_1$ interval observation of linear impulsive and switched systems
Sufficient conditions characterizing the asymptotic stability and the hybrid L1/`1-gain of linear positive impulsive systems under minimum and range dwell-time constraints are obtained. These conditions are stated as infinite-dimensional linear programming problems that can be solved using sum of squares programming, a relaxation that is known to be asymptotically exact in the present case. The...
متن کاملBipartite subspaces having no LOCC-distinguishable bases
It is proved that there exist subspaces of bipartite tensor product spaces that have no orthonormal bases that can be perfectly distinguished by means of LOCC protocols. A corollary of this fact is that there exist quantum channels having sub-optimal classical capacity even when the receiver may communicate classically with a third party that represents the channel’s environment.
متن کاملExtremal graphs having no matching cuts
A graph G = (V, E) is matching immune if there is no matching cut in G. We show that for any matching immune graph G, |E| ≥ ⌈3(|V | − 1)/2⌉. This bound is tight, as we define operations that construct, from a given vertex, exactly the class of matching immune graphs that attain the bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2008
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-07-09090-9