Examples of PDEs all whose points are characteristic

Let π : FM ! M be the bundle of linear frames of a manifold M. A basis Lijk , j < k, of diffeomorphism invariant Lagrangians on J1 (FM) was determined in [J. Muñoz Masqué, M. E. Rosado, Invariant variational problems on linear frame bundles, J. Phys. A35 (2002) 2013-2036]. The notion of a characteristic hypersurface for an arbitrary first-order PDE system on an ar- bitrary bred manifold π : P → M, is introduced and for the systems dened by the Euler-Lagrange equations of Lijk every hypersurface is shown to be characteristic. The Euler-Lagrange equations of the natural basis of Lagrangian densities Lijk on the bundle of linear frames of a manifold M which are invariant under diffeomorphisms, are shown to be an underdetermined PDEs systems such that every hypersurface of M is characteristic for such equations. This explains why these systems cannot be written in the Cauchy-Kowaleska form, although they are known to be formally integrable by using the tools of geometric theory of partial differential equations, see [J. Muñoz Masqué, M. E. Rosado, Integrability of the eld equations of invariant variational problems on linear frame bundles, J. Geom. Phys. 49 (2004), 119-155]

Relational and Allegorical Semantics for Constraint Logic Programming

El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de primer orden, la lógica de orden superior así como la teoría de conjuntos. A partir de los resultados matemáticos de Tarski y Freyd, esta tesis desarrolla semánticas denotacionales y operacionales para la programación lógica con restricciones usando el álgebra relacional como base. La idea principal es la utilización del concepto de semántica ejecutable, semánticas cuya característica principal es el que la ejecución es posible utilizando el razonamiento estándar del universo semántico, este caso, razonamiento ecuacional. En el caso de este trabajo, se muestra que las álgebras relacionales distributivas con un operador de punto fijo capturan toda la teoría y metateoría estándar de la programación lógica con restricciones incluyendo los árboles utilizados en la búsqueda de demostraciones. La mayor parte de técnicas de optimización de programas, evaluación parcial e interpretación abstracta pueden ser llevadas a cabo utilizando las semánticas aquí presentadas. La demostración de la corrección de la implementación resulta extremadamente sencilla. En la primera parte de la tesis, un programa lógico con restricciones es traducido a un conjunto de términos relacionales. La interpretación estándar en la teoría de conjuntos de dichas relaciones coincide con la semántica estándar para CLP. Las consultas contra el programa traducido son llevadas a cabo mediante la reescritura de relaciones. Para concluir la primera parte, se demuestra la corrección y equivalencia operacional de esta nueva semántica, así como se define un algoritmo de unificación mediante la reescritura de relaciones. La segunda parte de la tesis desarrolla una semántica para la programación lógica con restricciones usando la teoría de alegorías—versión categórica del álgebra de relaciones—de Freyd. Para ello, se definen dos nuevos conceptos de Categoría Regular de Lawvere y _-Alegoría, en las cuales es posible interpretar un programa lógico. La ventaja fundamental que el enfoque categórico aporta es la definición de una máquina categórica que mejora e sistema de reescritura presentado en la primera parte. Gracias al uso de relaciones tabulares, la máquina modela la ejecución eficiente sin salir de un marco estrictamente formal. Utilizando la reescritura de diagramas, se define un algoritmo para el cálculo de pullbacks en Categorías Regulares de Lawvere. Los dominios de las tabulaciones aportan información sobre la utilización de memoria y variable libres, mientras que el estado compartido queda capturado por los diagramas. La especificación de la máquina induce la derivación formal de un juego de instrucciones eficiente. El marco categórico aporta otras importantes ventajas, como la posibilidad de incorporar tipos de datos algebraicos, funciones y otras extensiones a Prolog, a la vez que se conserva el carácter 100% declarativo de nuestra semántica. ABSTRACT The calculus of binary relations was introduced by De Morgan in 1860, to be greatly developed by Peirce and Schröder, as well as many others in the twentieth century. Using different formulations of relational structures, Tarski, Givant, Freyd, and Scedrov have shown how relation algebras can provide a variable-free way of formalizing first order logic, higher order logic and set theory, among other formal systems. Building on those mathematical results, we develop denotational and operational semantics for Constraint Logic Programming using relation algebra. The idea of executable semantics plays a fundamental role in this work, both as a philosophical and technical foundation. We call a semantics executable when program execution can be carried out using the regular theory and tools that define the semantic universe. Throughout this work, the use of pure algebraic reasoning is the basis of denotational and operational results, eliminating all the classical non-equational meta-theory associated to traditional semantics for Logic Programming. All algebraic reasoning, including execution, is performed in an algebraic way, to the point we could state that the denotational semantics of a CLP program is directly executable. Techniques like optimization, partial evaluation and abstract interpretation find a natural place in our algebraic models. Other properties, like correctness of the implementation or program transformation are easy to check, as they are carried out using instances of the general equational theory. In the first part of the work, we translate Constraint Logic Programs to binary relations in a modified version of the distributive relation algebras used by Tarski. Execution is carried out by a rewriting system. We prove adequacy and operational equivalence of the semantics. In the second part of the work, the relation algebraic approach is improved by using allegory theory, a categorical version of the algebra of relations developed by Freyd and Scedrov. The use of allegories lifts the semantics to typed relations, which capture the number of logical variables used by a predicate or program state in a declarative way. A logic program is interpreted in a _-allegory, which is in turn generated from a new notion of Regular Lawvere Category. As in the untyped case, program translation coincides with program interpretation. Thus, we develop a categorical machine directly from the semantics. The machine is based on relation composition, with a pullback calculation algorithm at its core. The algorithm is defined with the help of a notion of diagram rewriting. In this operational interpretation, types represent information about memory allocation and the execution mechanism is more efficient, thanks to the faithful representation of shared state by categorical projections. We finish the work by illustrating how the categorical semantics allows the incorporation into Prolog of constructs typical of Functional Programming, like abstract data types, and strict and lazy functions.

Hiord: A type-free higher-order logic programming language with predicate abstraction

A new formalism, called Hiord, for defining type-free higherorder logic programming languages with predicate abstraction is introduced. A model theory, based on partial combinatory algebras, is presented, with respect to which the formalism is shown sound. A programming language built on a subset of Hiord, and its implementation are discussed. A new proposal for defining modules in this framework is considered, along with several examples.

Categorical Structures in Non-Commutative Measure Theory.

In this paper, we investigate effect algebras and base normed spaces from the categorical point of view. We prove that the category of effect algebras is complete and cocomplete as well as the category of base normed spaces is complete, and discuss the contravariant functor from the category of effect algebras to the category of base normed spaces.

Prime factors

We use Voiculescu’s free probability theory to prove the existence of prime factors, hence answering a longstanding problem in the theory of von Neumann algebras.

On representations of finite type

Representations of the (infinite) canonical anticommutation relations and the associated operator algebra, the fermion algebra, are studied. A “coupling constant” (in (0,1]) is defined for primary states of “finite type” of that algebra. Primary, faithful states of finite type with arbitrary coupling are constructed and classified. Their physical significance for quantum thermodynamical systems at high temperatures is discussed. The scope of this study is broadened to include a large class of operator algebras sharing some of the structural properties of the fermion algebra.

Quantum groups with invariant integrals

Quantum groups have been studied intensively for the last two decades from various points of view. The underlying mathematical structure is that of an algebra with a coproduct. Compact quantum groups admit Haar measures. However, if we want to have a Haar measure also in the noncompact case, we are forced to work with algebras without identity, and the notion of a coproduct has to be adapted. These considerations lead to the theory of multiplier Hopf algebras, which provides the mathematical tool for studying noncompact quantum groups with Haar measures. I will concentrate on the *-algebra case and assume positivity of the invariant integral. Doing so, I create an algebraic framework that serves as a model for the operator algebra approach to quantum groups. Indeed, the theory of locally compact quantum groups can be seen as the topological version of the theory of quantum groups as they are developed here in a purely algebraic context.

The operator algebra approach to quantum groups

A relatively simple definition of a locally compact quantum group in the C*-algebra setting will be explained as it was recently obtained by the authors. At the same time, we put this definition in the historical and mathematical context of locally compact groups, compact quantum groups, Kac algebras, multiplicative unitaries, and duality theory.

Equações de onda generalizadas e quantização funtorial para teorias de campo escalar livre

Nesta dissertação apresentamos um método de quantização matemática e conceitualmente rigoroso para o campo escalar livre de interações. Trazemos de início alguns aspéctos importantes da Teoria de Distribuições e colocamos alguns pontos de geometria Lorentziana. O restante do trabalho é dividido em duas partes: na primeira, estudamos equações de onda em variedades Lorentzianas globalmente hiperbólicas e apresentamos o conceito de soluções fundamentais no contexto de equações locais. Em seguida, progressivamente construímos soluções fundamentais para o operador de onda a partir da distribuição de Riesz. Uma vez estabelecida uma solução para a equação de onda em uma vizinhança de um ponto da variedade, tratamos de construir uma solução global a partir da extensão do problema de Cauchy a toda a variedade, donde as soluções fundamentais dão lugar aos operadores de Green a partir da introdução de uma condição de contorno. Na última parte do trabalho, apresentamos um mínimo da Teoria de Categorias e Funtores para utilizar esse formalismo na contrução de um funtor de segunda quantização entre a categoria de variedades Lorentzianas globalmente hiperbólicas e a categoria de redes de álgebras C* satisfazendo os axiomas de Haag-Kastler. Ao fim, retomamos o caso particular do campo escalar quântico livre.

Rings of operators.

"Prepared with the assistance of a grant from the Research Corporation."

Linear operators and their spectra with applications to quantum mechanics.

From lectures given at the New York university Institute for mathematica and mechanics, by R. Cournat and others.

Analysis of edge detection algorithms on DIAL /

Mode of access: Internet.

Entangled subspaces and quantum symmetries

Entanglement is defined for each vector subspace of the tensor product of two finite-dimensional Hilbert spaces, by applying the notion of operator entanglement to the projection operator onto that subspace. The operator Schmidt decomposition of the projection operator defines a string of Schmidt coefficients for each subspace, and this string is assumed to characterize its entanglement, so that a first subspace is more entangled than a second, if the Schmidt string of the second majorizes the Schmidt string of the first. The idea is applied to the antisymmetric and symmetric tensor products of a finite-dimensional Hilbert space with itself, and also to the tensor product of an angular momentum j with a spin 1/2. When adapted to the subspaces of states of the nonrelativistic hydrogen atom with definite total angular momentum (orbital plus spin), within the space of bound states with a given total energy, this leads to a complete ordering of those subspaces by their Schmidt strings.

Pseudo memory effects, majorization and entropy in quantum random walks

A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial distribution. In a classical walk, entropy increase can be regarded as a consequence of the majorization ordering of successive distributions. The Lorenz curves of successive distributions for a symmetric quantum walk reveal no majorization ordering in general. Nevertheless, entropy can increase, and computer experiments show that it does so on average. Varying the stages at which the quantum coin system is traced out leads to new quantum walks, including a symmetric walk for which majorization ordering is valid but the spreading rate exceeds that of the usual symmetric quantum walk.

Coherent state construction of representations of osp(2|2) and primary fields of osp(2|2) conformal field theory

Representations of the superalgebra osp(2/2)(k)((1)) and current superalgebra. osp(2/2)k in the standard basis are investigated. All finite-dimensional typical and atypical representations of osp(2/2) are constructed by the vector coherent state method. Primary fields of the non-unitary conformal field theory associated with osp(2/2)(k)((1)) in the standard basis are obtained for arbitrary level k. (C) 2004 Elsevier B.V. All rights reserved.