10,267 research outputs found
The Next-to-Simplest Quantum Field Theories
We describe new on-shell recursion relations for tree-amplitudes in N=1 and
N=2 gauge theories and use these to show that the structure of the S-matrix in
pure N=1 and N=2 gauge theories resembles that of pure Yang-Mills. We proceed
to study gluon scattering in gauge theories coupled to matter in arbitrary
representations. The contribution of matter to individual bubble and triangle
coefficients can depend on the fourth and sixth order Indices of the matter
representation respectively. So, the condition that one-loop amplitudes be free
of bubbles and triangles can be written as a set of linear Diophantine
equations involving these higher-order Indices. These equations simplify for
supersymmetric theories. We present new examples of supersymmetric theories
that have only boxes (and no triangles or bubbles at one-loop) and
non-supersymmetric theories that are free of bubbles. In particular, our
results indicate that one-loop scattering amplitudes in the N=2, SU(K) theory
with a symmetric tensor hypermultiplet and an anti-symmetric tensor
hypermultiplet are simple like those in the N=4 theory.Comment: 53 pages; (v2) reference to gravity dual and subsection on large N
adde
Copper(I)-Phosphinite Complexes in Click Cycloadditions: Three-Component Reactions and Preparation of 5-Iodotriazoles
© 2016 The Authors. Published by Wiley-VCH Verlag GmbH & Co. KGaA.The remarkable activity displayed by copper(I)–phosphinite complexes of general formula [CuBr(L)] in two challenging cycloadditions is reported: a) the one-pot azidonation/cycloaddition of boronic acids, NaN3, and terminal alkynes; b) the cycloaddition of azides and iodoalkynes. These air-stable catalysts led to very good results in both cases and the expected triazoles could be isolated in pure form under ‘Click-suitable’ conditions
Faster Algorithms for Weighted Recursive State Machines
Pushdown systems (PDSs) and recursive state machines (RSMs), which are
linearly equivalent, are standard models for interprocedural analysis. Yet RSMs
are more convenient as they (a) explicitly model function calls and returns,
and (b) specify many natural parameters for algorithmic analysis, e.g., the
number of entries and exits. We consider a general framework where RSM
transitions are labeled from a semiring and path properties are algebraic with
semiring operations, which can model, e.g., interprocedural reachability and
dataflow analysis problems.
Our main contributions are new algorithms for several fundamental problems.
As compared to a direct translation of RSMs to PDSs and the best-known existing
bounds of PDSs, our analysis algorithm improves the complexity for
finite-height semirings (that subsumes reachability and standard dataflow
properties). We further consider the problem of extracting distance values from
the representation structures computed by our algorithm, and give efficient
algorithms that distinguish the complexity of a one-time preprocessing from the
complexity of each individual query. Another advantage of our algorithm is that
our improvements carry over to the concurrent setting, where we improve the
best-known complexity for the context-bounded analysis of concurrent RSMs.
Finally, we provide a prototype implementation that gives a significant
speed-up on several benchmarks from the SLAM/SDV project
The use of orbitals and full spectra to identify misalignment
In this paper, a SpectraQuest demonstrator is used to introduce misalignment in a rotating set-up. The vibrations caused by misalignment is measured with both accelerometers on the bearings and eddy current probes on the shaft itself. A comparison is made between the classical spectral analysis, orbitals and full spectra. Orbitals are used to explain the physical interpretation of the vibration caused by misalignment. Full spectra allow to distinguish unbalance from misalignment by looking at the forward and reversed phenomena. This analysis is done for different kinds of misalignment, couplings, excitation forces and combined machinery faults
Time-asymmetry of probabilities versus relativistic causal structure: an arrow of time
There is an incompatibility between the symmetries of causal structure in
relativity theory and the signaling abilities of probabilistic devices with
inputs and outputs: while time-reversal in relativity will not introduce the
ability to signal between spacelike separated regions, this is not the case for
probabilistic devices with space-like separated input-output pairs. We
explicitly describe a non-signaling device which becomes a perfect signaling
device under time-reversal, where time-reversal can be conceptualized as
playing backwards a videotape of an agent manipulating the device. This leads
to an arrow of time that is identifiable when studying the correlations of
events for spacelike separated regions. Somewhat surprisingly, although
time-reversal of Popuscu-Roerlich boxes also allows agents to signal, it does
not yield a perfect signaling device. Finally, we realize time-reversal using
post-selection, which could lead experimental implementation.Comment: 4 pages, some figures; replaces arXiv:1010.4572 [quant-ph
- …