Solvability near the characteristic set for a special class of complex vector fields

This work deals with the solvability near the characteristic set Sigma = {0} x S-1 of operators of the form L = partial derivative/partial derivative t+(x(n) a(x)+ ix(m) b(x))partial derivative/partial derivative x, b not equivalent to 0 and a(0) not equal 0, defined on Omega(epsilon) = (-epsilon, epsilon) x S-1, epsilon > 0, where a and b are real-valued smooth functions in (-epsilon, epsilon) and m >= 2n. It is shown that given f belonging to a subspace of finite codimension of C-infinity (Omega(epsilon)) there is a solution u is an element of L-infinity of the equation Lu = f in a neighborhood of Sigma; moreover, the L-infinity regularity is sharp.

Homogeneous structures and rigidity of isoparametric submanifolds in Hilbert space

We study isoparametric submanifolds of rank at least two in a separable Hilbert space, which are known to be homogeneous by the main result in [E. Heintze and X. Liu, Ann. of Math. (2), 149 (1999), 149-181], and with such a submanifold M and a point x in M we associate a canonical homogeneous structure I" (x) (a certain bilinear map defined on a subspace of T (x) M x T (x) M). We prove that I" (x) , together with the second fundamental form alpha (x) , encodes all the information about M, and we deduce from this the rigidity result that M is completely determined by alpha (x) and (Delta alpha) (x) , thereby making such submanifolds accessible to classification. As an essential step, we show that the one-parameter groups of isometries constructed in [E. Heintze and X. Liu, Ann. of Math. (2), 149 (1999), 149-181] to prove their homogeneity induce smooth and hence everywhere defined Killing fields, implying the continuity of I" (this result also seems to close a gap in [U. Christ, J. Differential Geom., 62 (2002), 1-15]). Here an important tool is the introduction of affine root systems of isoparametric submanifolds.

GEOMETRIC RELATIONS BETWEEN SPACES OF NUCLEAR OPERATORS AND SPACES OF COMPACT OPERATORS

We extend and provide a vector-valued version of some results of C. Samuel about the geometric relations between the spaces of nuclear operators N(E, F) and spaces of compact operators K(E, F), where E and F are Banach spaces C(K) of all continuous functions defined on the countable compact metric spaces K equipped with the supremum norm. First we continue Samuel's work by proving that N(C(K-1), C(K-2)) contains no subspace isomorphic to K(C(K-3), C(K-4)) whenever K-1, K-2, K-3 and K-4 are arbitrary infinite countable compact metric spaces. Then we show that it is relatively consistent with ZFC that the above result and the main results of Samuel can be extended to C(K-1, X), C(K-2,Y), C(K-3, X) and C(K-4, Y) spaces, where K-1, K-2, K-3 and K-4 are arbitrary infinite totally ordered compact spaces; X comprises certain Banach spaces such that X* are isomorphic to subspaces of l(1); and Y comprises arbitrary subspaces of l(p), with 1 < p < infinity. Our results cover the cases of some non-classical Banach spaces X constructed by Alspach, by Alspach and Benyamini, by Benyamini and Lindenstrauss, by Bourgain and Delbaen and also by Argyros and Haydon.

Localizability in de Sitter space

An analogue of the Newton-Wigner position operator is defined for a massive neutral scalar field in de Sitter space. The one-particle subspace of the theory, consisting of positive-energy solutions of the Klein-Gordon equation selected by the Hadamard condition, is identified with an irreducible representation of the de Sitter group. Postulates of localizability analogous to those written by Wightman for fields in Minkowski space are formulated on it, and a unique solution is shown to exist. Representations in both the principal and the complementary series are considered. A simple expression for the time evolution of the Newton-Wigner operator is presented.

Kleiner's theorem for unitary representations of posets

A subspace representation of a poset S = {s(1), ..., S-t} is given by a system (V; V-1, ..., V-t) consisting of a vector space V and its sub-spaces V-i such that V-i subset of V-j if s(i) (sic) S-j. For each real-valued vector chi = (chi(1), ..., chi(t)) with positive components, we define a unitary chi-representation of S as a system (U: U-1, ..., U-t) that consists of a unitary space U and its subspaces U-i such that U-i subset of U-j if S-i (sic) S-j and satisfies chi 1 P-1 + ... + chi P-t(t) = 1, in which P-i is the orthogonal projection onto U-i. We prove that S has a finite number of unitarily nonequivalent indecomposable chi-representations for each weight chi if and only if S has a finite number of nonequivalent indecomposable subspace representations; that is, if and only if S contains any of Kleiner's critical posets. (c) 2012 Elsevier Inc. All rights reserved.

TWO NEW WEAK CONSTRAINT QUALIFICATIONS AND APPLICATIONS

We present two new constraint qualifications (CQs) that are weaker than the recently introduced relaxed constant positive linear dependence (RCPLD) CQ. RCPLD is based on the assumption that many subsets of the gradients of the active constraints preserve positive linear dependence locally. A major open question was to identify the exact set of gradients whose properties had to be preserved locally and that would still work as a CQ. This is done in the first new CQ, which we call the constant rank of the subspace component (CRSC) CQ. This new CQ also preserves many of the good properties of RCPLD, such as local stability and the validity of an error bound. We also introduce an even weaker CQ, called the constant positive generator (CPG), which can replace RCPLD in the analysis of the global convergence of algorithms. We close this work by extending convergence results of algorithms belonging to all the main classes of nonlinear optimization methods: sequential quadratic programming, augmented Lagrangians, interior point algorithms, and inexact restoration.

Identificação determinística por subespaços

Neste artigo é apresentada uma visão geral sobre o problema de identificação por subespaços em malha aberta. Existem diversos algoritmos que solucionam este problema (MOESP, DSR, N4SID, CVA). Baseado nos métodos MOESP e N4SID os autores apresentam um algoritmo alternativo para identificar sistemas determinísticos operando em malha aberta. Dois processos simulados, um SISO e um MIMO são usados para mostrar o desempenho deste algoritmo.