Asplund Functions and Projectional Resolutions of the Identity

*Supported by the Grants AV ˇCR 101-97-02, 101-90-03, GA ˇCR 201-98-1449, and by the Grant of the Faculty of Civil Engineering of the Czech Technical University No. 2003.

Caractérisation Des Espaces 1-Matriciellement Normés

Let X be a closed subspace of B(H) for some Hilbert space H. In [9], Pisier introduced Sp [X] (1 ≤ p ≤ +∞) by setting Sp [X] = (S∞ [X] , S1 [X])θ , (where θ =1/p , S∞ [X] = S∞ ⊗min X and S1 [X] = S1 ⊗∧ X) and showed that there are p−matricially normed spaces. In this paper we prove that conversely, if X is a p−matricially normed space with p = 1, then there is an operator structure on X, such that M1,n (X) = S1 [X] where Sn,1 [X] is the finite dimentional version of S1 [X]. For p = 1, we have no answer.

Isomorphism Problems for the Baire Function Spaces of Topological Spaces

Let a compact Hausdorff space X contain a non-empty perfect subset. If α < β and β is a countable ordinal, then the Banach space Bα (X) of all bounded real-valued functions of Baire class α on X is a proper subspace of the Banach space Bβ (X). In this paper it is shown that: 1. Bα (X) has a representation as C(bα X), where bα X is a compactification of the space P X – the underlying set of X in the Baire topology generated by the Gδ -sets in X. 2. If 1 ≤ α < β ≤ Ω, where Ω is the first uncountable ordinal number, then Bα (X) is uncomplemented as a closed subspace of Bβ (X). These assertions for X = [0, 1] were proved by W. G. Bade [4] and in the case when X contains an uncountable compact metrizable space – by F.K.Dashiell [9]. Our argumentation is one non-metrizable modification of both Bade’s and Dashiell’s methods.

Three Spaces Problem for Lyapunov Theorem on Vector Measure

It is proved that a Banach space X has the Lyapunov property if its subspace Y and the quotient space X/Y have it.

Uniform Eberlein Compacta and Uniformly Gâteaux Smooth Norms

* Supported by grants: AV ĈR 101-95-02, GAĈR 201-94-0069 (Czech Republic) and NSERC 7926 (Canada).

Motzkin Decomposable Sets

Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. We have provided several characterizations of the larger class of closed convex sets, Motzkin decomposable, in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed. Another result establishes that a closed convex set is Motzkin decomposable if and only if the set of extreme points of its intersection with the linear subspace orthogonal to its lineality is bounded. We characterize the class of the extended functions whose epigraphs are Motzkin decomposable sets showing, in particular, that these functions attain their global minima when they are bounded from below. Calculus of Motzkin decomposable sets and functions is provided.

A Characterization of Weakly Lindelöf Determined Banach Spaces

2000 Mathematics Subject Classification: 46B26, 46B03, 46B04.

The Operators Aγ = γA + -γA for a Class of Nondissipative Operators A with a Limit of the Corresponding Correlation Function

2000 Mathematics Subject Classification: Primary 47A48, Secondary 60G12

Kneser and Hereditarily Kneser Subgroups of a Profinite Group

2000 Mathematics Subject Classification: 20E18, 12G05, 12F10, 12F99.

Every N-Dimensional Separable Metric Space Contains a Totally Disconnected (n-1)-Dimensional Subset with no True Quasi-Components

Владимир Тодоров, Петър Стоев - Тази бележка съдържа елементарна конструкция на множество с указаните в заглавието свойства. Да отбележим в допълнение, че така полученото множество остава напълно несвързано дори и след като се допълни с краен брой елементи.

Minimal Subspaces with Maximal Dimensioanal Diameters

Владимир Тодоров - Нека X е компактно метрично пространство с dim X = n. Тогава за n − 1 - мерния диаметър dn−1(X) на X е изпълнено неравенството dn−1(X) > 0, докато dn(X) = 0 (да отбележим, че това е една от характеристиките на размерността на Лебег). От тук се получава, че X съдържа минимално по включване затворено подмножество Y , за което dn−1(Y ) = dn−1(X). Известен резултат е, че от това следва, че Y е Канторово Многообразие. В тази бележка доказваме, че всяко такова (минимално) подпространство Y е даже континуум V^n. Получени са също така някои следствия.

About Homogeneous Spaces and Conditions of Completeness of Spaces

Александър В. Архангелски, Митрофан М. Чобан, Екатерина П. Михайлова - Въведени са понятията o-хомогенно пространство, lo-хомогенно пространство, do-хомогенно пространство и co-хомогенно пространство. Показано е, че ако lo-хомогенно пространство X има отворено подпространство, което е q-пълно, то и самото X е q-пълно. Показано е, че ако lo-хомогенно пространство X съдържа навсякъде гъсто екстремално несвързано подпространство, тогава X е екстремално несвързано.

About Homogeneous Spaces and the Baire Property in Remainders

Александър В. Архангелски, Митрофан М. Чобан, Екатерина П. Михайлова - В съобщението е продължено изследването на понятията o-хомогенно пространство, lo-хомогенно пространство, do-хомогенно пространство и co-хомогенно пространство. Показано е, че ако co-хомогенното пространство X съдържа Gδ -гъсто Московско подпространство, тогава X е Московско пространство.

Direction Finding Estimators of Cyclostationary Signals in Array Processing for Microwave Power Transmission

A solar power satellite is paid attention to as a clean, inexhaustible large- scale base-load power supply. The following technology related to beam control is used: A pilot signal is sent from the power receiving site and after direction of arrival estimation the beam is directed back to the earth by same direction. A novel direction-finding algorithm based on linear prediction technique for exploiting cyclostationary statistical information (spatial and temporal) is explored. Many modulated communication signals exhibit a cyclostationarity (or periodic correlation) property, corresponding to the underlying periodicity arising from carrier frequencies or baud rates. The problem was solved by using both cyclic second-order statistics and cyclic higher-order statistics. By evaluating the corresponding cyclic statistics of the received data at certain cycle frequencies, we can extract the cyclic correlations of only signals with the same cycle frequency and null out the cyclic correlations of stationary additive noise and all other co-channel interferences with different cycle frequencies. Thus, the signal detection capability can be significantly improved. The proposed algorithms employ cyclic higher-order statistics of the array output and suppress additive Gaussian noise of unknown spectral content, even when the noise shares common cycle frequencies with the non-Gaussian signals of interest. The proposed method completely exploits temporal information (multiple lag ), and also can correctly estimate direction of arrival of desired signals by suppressing undesired signals. Our approach was generalized over direction of arrival estimation of cyclostationary coherent signals. In this paper, we propose a new approach for exploiting cyclostationarity that seems to be more advanced in comparison with the other existing direction finding algorithms.

Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively low entropy. Our investigations demonstrate once again that modifications resulting to S-boxes which still satisfy some design criteria may lead to very weak ciphers. ACM Computing Classification System (1998): E.3, I.2.7, I.2.8.