340 research outputs found
A note on the Zassenhaus product formula
We provide a simple method for the calculation of the terms c_n in the
Zassenhaus product for
non-commuting a and b. This method has been implemented in a computer program.
Furthermore, we formulate a conjecture on how to translate these results into
nested commutators. This conjecture was checked up to order n=17 using a
computer
Centralizers of maximal regular subgroups in simple Lie groups and relative congruence classes of representations
In the paper we present a new, uniform and comprehensive description of
centralizers of the maximal regular subgroups in compact simple Lie groups of
all types and ranks. The centralizer is either a direct product of finite
cyclic groups, a continuous group of rank 1, or a product, not necessarily
direct, of a continuous group of rank 1 with a finite cyclic group. Explicit
formulas for the action of such centralizers on irreducible representations of
the simple Lie algebras are given.Comment: 27 page
Quantum simulations under translational symmetry
We investigate the power of quantum systems for the simulation of Hamiltonian
time evolutions on a cubic lattice under the constraint of translational
invariance. Given a set of translationally invariant local Hamiltonians and
short range interactions we determine time evolutions which can and those that
can not be simulated. Whereas for general spin systems no finite universal set
of generating interactions is shown to exist, universality turns out to be
generic for quadratic bosonic and fermionic nearest-neighbor interactions when
supplemented by all translationally invariant on-site Hamiltonians.Comment: 9 pages, 2 figures, references added, minor change
Brownian Motions on Metric Graphs
Brownian motions on a metric graph are defined. Their generators are
characterized as Laplace operators subject to Wentzell boundary at every
vertex. Conversely, given a set of Wentzell boundary conditions at the vertices
of a metric graph, a Brownian motion is constructed pathwise on this graph so
that its generator satisfies the given boundary conditions.Comment: 43 pages, 7 figures. 2nd revision of our article 1102.4937: The
introduction has been modified, several references were added. This article
will appear in the special issue of Journal of Mathematical Physics
celebrating Elliott Lieb's 80th birthda
Breaking of B-L in superstring inspired E6 model
In the framework of the superstring inspired E6 model, low-energy extensions
of the standard model compatible with leptogenesis are considered and masses of
right-handed neutrinos in two scenarios allowed by long-lived protons are
discussed. The presence of two additional generations allows breaking of B-L
without generating nonzero vacuum expectation values of right-handed sneutrinos
of the three known generations. After the symmetry breaking, right-handed
neutrinos acquire Majorana masses of order of 10^11 GeV. Within the framework
of a simple discrete symmetry, assumptions made to provide a large mass of
right-handed neutrinos are shown to be self-consistent. Supersymmetric
structure of the theory ensures that large corrections, associated with the
presence of a (super)heavy gauge field, cancel out.Comment: 18 pages, 6 tables, axodraw use
Group theory factors for Feynman diagrams
We present algorithms for the group independent reduction of group theory
factors of Feynman diagrams. We also give formulas and values for a large
number of group invariants in which the group theory factors are expressed.
This includes formulas for various contractions of symmetric invariant tensors,
formulas and algorithms for the computation of characters and generalized
Dynkin indices and trace identities. Tables of all Dynkin indices for all
exceptional algebras are presented, as well as all trace identities to order
equal to the dual Coxeter number. Further results are available through
efficient computer algorithms (see http://norma.nikhef.nl/~t58/ and
http://norma.nikhef.nl/~t68/ ).Comment: Latex (using axodraw.sty), 47 page
Gauge theory of Faddeev-Skyrme functionals
We study geometric variational problems for a class of nonlinear sigma-models
in quantum field theory. Mathematically, one needs to minimize an energy
functional on homotopy classes of maps from closed 3-manifolds into compact
homogeneous spaces G/H. The minimizers are known as Hopfions and exhibit
localized knot-like structure. Our main results include proving existence of
Hopfions as finite energy Sobolev maps in each (generalized) homotopy class
when the target space is a symmetric space. For more general spaces we obtain a
weaker result on existence of minimizers in each 2-homotopy class.
Our approach is based on representing maps into G/H by equivalence classes of
flat connections. The equivalence is given by gauge symmetry on pullbacks of
G-->G/H bundles. We work out a gauge calculus for connections under this
symmetry, and use it to eliminate non-compactness from the minimization problem
by fixing the gauge.Comment: 34 pages, no figure
Incompleteness of Representation Theory: Hidden symmetries and Quantum Non-Integrability
Representation theory is shown to be incomplete in terms of enumerating all
integrable limits of quantum systems. As a consequence, one can find exactly
solvable Hamiltonians which have apparently strongly broken symmetry. The
number of these hidden symmetries depends upon the realization of the
Hamiltonian.Comment: 4 pages, Revtex, Phys. Rev. Lett. , July 27 (1997), in pres
Prolongations of Geometric Overdetermined Systems
We show that a wide class of geometrically defined overdetermined semilinear
partial differential equations may be explicitly prolonged to obtain closed
systems. As a consequence, in the case of linear equations we extract sharp
bounds on the dimension of the solution space.Comment: 22 pages. In the second version, a comparison with the classical
theory of prolongations was added. In this third version more details were
added concerning our construction and especially the use of Kostant's
computation of Lie algebra cohomolog
An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications
We provide a new algorithm for generating the Baker--Campbell--Hausdorff
(BCH) series Z = \log(\e^X \e^Y) in an arbitrary generalized Hall basis of
the free Lie algebra generated by and . It is based
on the close relationship of with a Lie algebraic structure
of labeled rooted trees. With this algorithm, the computation of the BCH series
up to degree 20 (111013 independent elements in ) takes less
than 15 minutes on a personal computer and requires 1.5 GBytes of memory. We
also address the issue of the convergence of the series, providing an optimal
convergence domain when and are real or complex matrices.Comment: 30 page
- …