Rational invariants on the space of all structures of algebras on a two-dimensional vector space

Rational invariants on the space of all structures of algebras on a two-dimensional vector space

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.

The scenario of two-dimensional instabilities of the cylinder wake under EHD forcing: A linear stability analysis

We propose to study the stability properties of an air flow wake forced by a dielectric barrier discharge (DBD) actuator, which is a type of electrohydrodynamic (EHD) actuator. These actuators add momentum to the flow around a cylinder in regions close to the wall and, in our case, are symmetrically disposed near the boundary layer separation point. Since the forcing frequencies, typical of DBD, are much higher than the natural shedding frequency of the flow, we will be considering the forcing actuation as stationary. In the first part, the flow around a circular cylinder modified by EHD actuators will be experimentally studied by means of particle image velocimetry (PIV). In the second part, the EHD actuators have been numerically implemented as a boundary condition on the cylinder surface. Using this boundary condition, the computationally obtained base flow is then compared with the experimental one in order to relate the control parameters from both methodologies. After validating the obtained agreement, we study the Hopf bifurcation that appears once the flow starts the vortex shedding through experimental and computational approaches. For the base flow derived from experimentally obtained snapshots, we monitor the evolution of the velocity amplitude oscillations. As to the computationally obtained base flow, its stability is analyzed by solving a global eigenvalue problem obtained from the linearized Navier–Stokes equations. Finally, the critical parameters obtained from both approaches are compared.

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.

Reentrant and whirling hexagons in non-Boussinesq convection

We review recent computational results for hexagon patterns in non- Boussinesq convection. For sufficiently strong dependence of the fluid parameters on the temperature we find reentrance of steady hexagons, i.e. while near onset the hexagon patterns become unstable to rolls as usually, they become again stable in the strongly nonlinear regime. If the convection apparatus is rotated about a vertical axis the transition from hexagons to rolls is replaced by a Hopf bifurcation to whirling hexagons. For weak non-Boussinesq effects they display defect chaos of the type described by the two-dimensional (2D) complex Ginzburg-andau equation. For stronger non-Boussinesq effects the Hopf bifurcation becomes subcritical and localized bursting of the whirling amplitude is found. In this regime the cou- pling of the whirling amplitude to (small) deformations of the hexagon lattice becomes important. For yet stronger non-Boussinesq effects this coupling breaks up the hexagon lattice and strongly disordered states characterized by whirling and lattice defects are obtained.

Convective instabilities in two superposed horizontal liquid layers heated laterally.

This work is devoted to the theoretical study of the stability of two superposed horizontal liquid layers bounded by two solid planes and subjected to a horizontal temperature gradient. The liquids are supposed to be immiscible with a nondeformable interface. The forces acting on the system are buoyancy and interfacial tension. Four different flow patterns and temperature profiles are found for the basic state. A linear perturbative analysis with respect to two- and three-dimensional perturbations reveals the existence of three kinds of patterns. Depending on the relative height of both liquids several situations are predicted: either wave propa- gation from cold to the hot regions, or waves propagating in the opposite direction or still stationary longitu- dinal rolls. The behavior of three different pairs of liquids which have been used in experiments on bilayers under vertical gradient by other authors have been examined. The instability mechanisms are discussed and a qualitative interpretation of the different behaviors exhibited by the system is provided. In some configurations it is possible to find a codimension-two point created by the interaction of two Hopf modes with different frequencies and wave numbers. These results suggest to consider two liquid layers as an interesting prototype ? nard-Marangoni problem.

Defect chaos and bursts: Hexagonal rotating convection and the complex Ginzburg-Landau equation

We employ numerical computations of the full Navier-Stokes equations to investigate non-Boussinesq convection in a rotating system using water as the working fluid. We identify two regimes. For weak non- Boussinesq effects the Hopf bifurcation from steady to oscillating (whirling) hexagons is supercritical and typical states exhibit defect chaos that is systematically described by the cubic complex Ginzburg-Landau equation. For stronger non-Boussinesq effects the Hopf bifurcation becomes subcritical and the oscil- lations exhibit localized chaotic bursting, which is modeled by a quintic complex Ginzburg-Landau equation.

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.

Direct and adjoint global stability analysis of turbulent transonic flows over a NACA0012 profile

In this work, various turbulent solutions of the two-dimensional (2D) and three-dimensional compressible Reynolds averaged Navier?Stokes equations are analyzed using global stability theory. This analysis is motivated by the onset of flow unsteadiness (Hopf bifurcation) for transonic buffet conditions where moderately high Reynolds numbers and compressible effects must be considered. The buffet phenomenon involves a complex interaction between the separated flow and a shock wave. The efficient numerical methodology presented in this paper predicts the critical parameters, namely, the angle of attack and Mach and Reynolds numbers beyond which the onset of flow unsteadiness appears. The geometry, a NACA0012 profile, and flow parameters selected reproduce situations of practical interest for aeronautical applications. The numerical computation is performed in three steps. First, a steady baseflow solution is obtained; second, the Jacobian matrix for the RANS equations based on a finite volume discretization is computed; and finally, the generalized eigenvalue problem is derived when the baseflow is linearly perturbed. The methodology is validated predicting the 2D Hopf bifurcation for a circular cylinder under laminar flow condition. This benchmark shows good agreement with the previous published computations and experimental data. In the transonic buffet case, the baseflow is computed using the Spalart?Allmaras turbulence model and represents a mean flow where the high frequency content and length scales of the order of the shear-layer thickness have been averaged. The lower frequency content is assumed to be decoupled from the high frequencies, thus allowing a stability analysis to be performed on the low frequency range. In addition, results of the corresponding adjoint problem and the sensitivity map are provided for the first time for the buffet problem. Finally, an extruded three-dimensional geometry of the NACA0012 airfoil, where all velocity components are considered, was also analyzed as a Triglobal stability case, and the outcoming results were compared to the previous 2D limited model, confirming that the buffet onset is well detected.