BFFT quantization with nonlinear constraints

We consider the method due to Batalin, Fradkin, Fradkina, and Tyutin (BFFT) that makes the conversion of second-class constraints into first-class ones for the case of nonlinear theories. We first present a general analysis of an attempt to simplify the method, showing the conditions that must be fulfilled in order to have first-class constraints for nonlinear theories but that are linear in the auxiliary variables. There are cases where this simplification cannot be done and the full BFFT method has to be used. However, in the way the method is formulated, we show with details that it is not practicable to be done. Finally, we speculate on a solution for these problems.Comment: 19 pages, Late

Hamiltonian embedding of the massive noncommutative U(1) theory

We show that the massive noncommutative U(1) can be embedded in a gauge theory by using the BFFT Hamiltonian formalism. By virtue of the peculiar non-Abelian algebraic structure of the noncommutative massive U(1) theory, several specific identities involving Moyal commutators had to be used in order to make the embedding possible. This leads to an infinite number of steps in the iterative process of obtaining first-class constraints. We also shown that the involutive Hamiltonian can be constructed.Comment: 8 pages, Revtex (multicol

HERA-B Framework for Online Calibration and Alignment

This paper describes the architecture and implementation of the HERA-B framework for online calibration and alignment. At HERA-B the performance of all trigger levels, including the online reconstruction, strongly depends on using the appropriate calibration and alignment constants, which might change during data taking. A system to monitor, recompute and distribute those constants to online processes has been integrated in the data acquisition and trigger systems.Comment: Submitted to NIM A. 4 figures, 15 page

Almost zero transfer in continuous-time quantum walks on weighted tree graphs

We study the probability flux on the central vertex in continuous-time quantum walks on weighted tree graphs. In a weighted graph, each edge has a weight we call hopping. This hopping sets the jump rate of the particle between the vertices connected by the edge. Here, the edges of the central vertex (root) have a hopping parameter $J$ larger than those of the other edges. For star graphs, this hopping gives only how often the walker visits the central vertex over time. However, for weighted spider graphs $S_{n,2}$ and $S_{n,3}$, the probability on the central vertex drops with $J^2$ for walks starting from a state of any superposition of leaf vertices. We map Cayley trees $C_{3,2}$ and $C_{3,3}$ into these spider graphs and observe the same dependency. Our results suggest this is a general feature of such walks on weighted trees and a way of probing decoherence effects in an open quantum system context.Comment: 17 pages, 8 figures, one colum

Tensor Coordinates in Noncommutative Mechanics

A consistent classical mechanics formulation is presented in such a way that, under quantization, it gives a noncommutative quantum theory with interesting new features. The Dirac formalism for constrained Hamiltonian systems is strongly used, and the object of noncommutativity ${\mathbf \theta}^{ij}$ plays a fundamental rule as an independent quantity. The presented classical theory, as its quantum counterpart, is naturally invariant under the rotation group $SO(D)$.Comment: 12 pages, Late