Hamiltonian constraint analysis of vector field theories with spontaneous Lorentz symmetry breaking

Recent investigations of various quantum-gravity theories have revealed a variety of possible mechanisms that lead to Lorentz violation. One of the more elegant of these mechanisms is known as Spontaneous Lorentz Symmetry Breaking (SLSB), where a vector or tensor field acquires a nonzero vacuum expectation value. As a consequence of this symmetry breaking, massless Nambu-Goldstone modes appear with properties similar to the photon in Electromagnetism. This thesis considers the most general class of vector field theories that exhibit spontaneous Lorentz violation-known as bumblebee models-and examines their candidacy as potential alternative explanations of E&M, offering the possibility that Einstein-Maxwell theory could emerge as a result of SLSB rather than of local U(1) gauge invariance. With this aim we employ Dirac's Hamiltonian Constraint Analysis procedure to examine the constraint structures and degrees of freedom inherent in three candidate bumblebee models, each with a different potential function, and compare these results to those of Electromagnetism. We find that none of these models share similar constraint structures to that of E&M, and that the number of degrees of freedom for each model exceeds that of Electromagnetism by at least two, pointing to the potential existence of massive modes or propagating ghost modes in the bumblebee theories.

Topologically massive Yang-Mills: A Hamilton-Jacobi constraint analysis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Programs as paths: An approach to timing constraint analysis

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.

Electromagnetic field at finite temperature: A first order approach

In this work we study the electromagnetic field at finite temperature via the massless DKP formalism. The constraint analysis is performed and the partition function for the theory is constructed and computed. When it is specialized to the spin 1 sector we obtain the well-known result for the thermodynamic equilibrium of the electromagnetic field. (c) 2006 Elsevier B.V. All rights reserved.

Relativistic particle dynamics in D=2+1

We propose a SUSY variant of the action for a massless spinning particles via the inclusion of twistor variables. The action is constructed to be invariant under SUSY transformations and tau-reparametrizations even when an interaction field is including. The constraint analysis is achieved and the equations of motion are derived. The commutation relations obtained for the commuting spinor variables lambda(alpha) show that the particle states have fractional statistics and spin. At once we introduce a possible massive term for the non-interacting model.

Formalismo de Hamilton-Jacobi à la Carathéodory. Parte 2: sistemas singulares

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relativistic particle dynamics in D = 2+1

We propose a SUSY variant of the action for a massless spinning particles via the inclusion of twistor variables. The action is constructed to be invariant under SUSY transformations and τ-reparametrizations even when an interaction field is including. The constraint analysis is achieved and the equations of motion are derived. The commutation relations obtained for the commuting spinor variables λα show that the particle states have fractional statistics and spin. At once we introduce a possible massive term for the non-interacting model. © SISSA 2006.

Formalismo de Hamilton-Jacobi generalizado: teorias de campos com derivadas de ordem superior

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

S Q E D (4) and Q E D (4) on the Null-Plane

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Applications of differential geometry to high spin field theories

The main aim of this thesis is to investigate the application of methods of differential geometry to the constraint analysis of relativistic high spin field theories. As a starting point the coordinate dependent descriptions of the Lagrangian and Dirac-Bergmann constraint algorithms are reviewed for general second order systems. These two algorithms are then respectively employed to analyse the constraint structure of the massive spin-1 Proca field from the Lagrangian and Hamiltonian viewpoints. As an example of a coupled field theoretic system the constraint analysis of the massive Rarita-Schwinger spin-3/2 field coupled to an external electromagnetic field is then reviewed in terms of the coordinate dependent Dirac-Bergmann algorithm for first order systems. The standard Velo-Zwanziger and Johnson-Sudarshan inconsistencies that this coupled system seemingly suffers from are then discussed in light of this full constraint analysis and it is found that both these pathologies degenerate to a field-induced loss of degrees of freedom. A description of the geometrical version of the Dirac-Bergmann algorithm developed by Gotay, Nester and Hinds begins the geometrical examination of high spin field theories. This geometric constraint algorithm is then applied to the free Proca field and to two Proca field couplings; the first of which is the minimal coupling to an external electromagnetic field whilst the second is the coupling to an external symmetric tensor field. The onset of acausality in this latter coupled case is then considered in relation to the geometric constraint algorithm.

Multilayer perceptron with local constraint as an emerging method in spatial data analysis

The use of Geographic Information Systems has revolutionalized the handling and the visualization of geo-referenced data and has underlined the critic role of spatial analysis. The usual tools for such a purpose are geostatistics which are widely used in Earth science. Geostatistics are based upon several hypothesis which are not always verified in practice. On the other hand, Artificial Neural Network (ANN) a priori can be used without special assumptions and are known to be flexible. This paper proposes to discuss the application of ANN in the case of the interpolation of a geo-referenced variable.

Kinematical analysis of redundant drive wire mechanisms with velocity constraint

In this paper, we propose a new velocity constraint type for Redundant Drive Wire Mechanisms. The purpose of this paper is to demonstrate that the proposed velocity constraint module can fix the orientation of the movable part and to use the kinematical analysis method to obtain the moving direction of the movable part. First, we discuss the necessity of using this velocity constraint type and the possible applications of the proposed mechanism. Second, we derive the basic equations of a wire mechanism with this constraint type. Next, we present a method of motion analysis on active and passive constraint spaces, which is used to find the moving direction of a movable part. Finally, we apply the above analysis method on a wire mechanism with a velocity constraint module and on a wire mechanism with four double actuator modules. By evaluating the results, we prove the validity of the proposed constraint type.

Constraint-based analysis of gene interactions using restricted boolean networks and time-series data

Abstract Background A popular model for gene regulatory networks is the Boolean network model. In this paper, we propose an algorithm to perform an analysis of gene regulatory interactions using the Boolean network model and time-series data. Actually, the Boolean network is restricted in the sense that only a subset of all possible Boolean functions are considered. We explore some mathematical properties of the restricted Boolean networks in order to avoid the full search approach. The problem is modeled as a Constraint Satisfaction Problem (CSP) and CSP techniques are used to solve it. Results We applied the proposed algorithm in two data sets. First, we used an artificial dataset obtained from a model for the budding yeast cell cycle. The second data set is derived from experiments performed using HeLa cells. The results show that some interactions can be fully or, at least, partially determined under the Boolean model considered. Conclusions The algorithm proposed can be used as a first step for detection of gene/protein interactions. It is able to infer gene relationships from time-series data of gene expression, and this inference process can be aided by a priori knowledge available.

Incremental analysis of constraint logic programs

Global analyzers traditionally read and analyze the entire program at once, in a nonincremental way. However, there are many situations which are not well suited to this simple model and which instead require reanalysis of certain parts of a program which has already been analyzed. In these cases, it appears inecient to perform the analysis of the program again from scratch, as needs to be done with current systems. We describe how the xed-point algorithms used in current generic analysis engines for (constraint) logic programming languages can be extended to support incremental analysis. The possible changes to a program are classied into three types: addition, deletion, and arbitrary change. For each one of these, we provide one or more algorithms for identifying the parts of the analysis that must be recomputed and for performing the actual recomputation. The potential benets and drawbacks of these algorithms are discussed. Finally, we present some experimental results obtained with an implementation of the algorithms in the PLAI generic abstract interpretation framework. The results show signicant benets when using the proposed incremental analysis algorithms.

Global analysis of constraint logic programs

This article presents and illustrates a practical approach to the dataow analysis of constraint logic programming languages using abstract interpretation. It is rst argued that from the framework point of view it suces to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and for exist. This is shown by proposing a simple extension of Bruynooghes traditional framework which allows it to analyze constraint logic programs. Then and using this generalized framework two abstract domains and their required abstract functions are presented the rst abstract domain approximates deniteness information and the second one freeness. Finally an approach for cobining those domains is proposed The two domains and their combination have been implemented and used in the analysis of CLP and Prolog III applications. Results from this implementation showing its performance and accuracy are also presented