Operadores de Bishop : subespacios invariantes y teoría espectral

Tesis inédita de la Universidad Complutense de Madrid, Facultad de Ciencias Matemáticas, leída el 26-11-2020For nearly a century, various classes of linear bounded operators have been posed as potential counter examples to the Invariant Subspace Problem: maybe, the most important long-standing open question in Operator Theory. One of the simplest candidates consists of the family of Bishop operators T acting on Lp [0; 1) spaces, which were suggested by Errett Bishop in the fifties. Unlike their seeming simplicity, the structure and features of Bishop operators remain largely uncharted. In particular, hitherto, it is still unknown whether T has non-trivial invariant subspaces in Lp [0; 1) for each 1 p < 1 and any irrational 2 (0; 1)...Desde hace casi un siglo, se han propuesto varias clases de operadores como posibles contraejemplos para el Problema del Subespacio Invariante: quizas, la pregunta abierta mas importante en Teoría de Operadores en espacios de Banach reflexivos y, en particular, en espacios de Hilbert. Uno de los candidatos mas sencillos viene dado por la familia de los operadores de Bishop de nidos sobre los espacios Lp [0; 1) para 1 p < 1, los cuales fueron sugeridos por Errett Bishop durante la decada de los cincuenta. A pesar de su aparente sencillez, resulta que las propiedades de los operadores de Bishop T siguen siendo ampliamente desconocidas. En particular, hasta la fecha, es una cuestion abierta determinar si T dispone de subespacios invariantes no triviales en Lp [0; 1) para cualquier irracional 2 (0; 1)...Fac. de Ciencias MatemáticasTRUEunpu

Computer Aided Verification

This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications

Computer Aided Verification

This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications