21,363 research outputs found
Classical String in Curved Backgrounds
The Mathisson-Papapetrou method is originally used for derivation of the
particle world line equation from the covariant conservation of its
stress-energy tensor. We generalize this method to extended objects, such as a
string. Without specifying the type of matter the string is made of, we obtain
both the equations of motion and boundary conditions of the string. The world
sheet equations turn out to be more general than the familiar minimal surface
equations. In particular, they depend on the internal structure of the string.
The relevant cases are classified by examining canonical forms of the effective
2-dimensional stress-energy tensor. The case of homogeneously distributed
matter with the tension that equals its mass density is shown to define the
familiar Nambu-Goto dynamics. The other three cases include physically relevant
massive and massless strings, and unphysical tahyonic strings.Comment: 12 pages, REVTeX 4. Added a note and one referenc
BRS Cohomology of the Supertranslations in D=4
Supersymmetry transformations are a kind of square root of spacetime
translations. The corresponding Lie superalgebra always contains the
supertranslation operator . We find that the
cohomology of this operator depends on a spin-orbit coupling in an SU(2) group
and has a quite complicated structure. This spin-orbit type coupling will turn
out to be basic in the cohomology of supersymmetric field theories in general.Comment: 14 pages, CTP-TAMU-13/9
A Color Dual Form for Gauge-Theory Amplitudes
Recently a duality between color and kinematics has been proposed, exposing a
new unexpected structure in gauge theory and gravity scattering amplitudes.
Here we propose that the relation goes deeper, allowing us to reorganize
amplitudes into a form reminiscent of the standard color decomposition in terms
of traces over generators, but with the role of color and kinematics swapped.
By imposing additional conditions similar to Kleiss-Kuijf relations between
partial amplitudes, the relationship between the earlier form satisfying the
duality and the current one is invertible. We comment on extensions to loop
level.Comment: 5 pages, 4 figure
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work
This is the first of three planned papers describing ZAP, a satisfiability
engine that substantially generalizes existing tools while retaining the
performance characteristics of modern high-performance solvers. The fundamental
idea underlying ZAP is that many problems passed to such engines contain rich
internal structure that is obscured by the Boolean representation used; our
goal is to define a representation in which this structure is apparent and can
easily be exploited to improve computational performance. This paper is a
survey of the work underlying ZAP, and discusses previous attempts to improve
the performance of the Davis-Putnam-Logemann-Loveland algorithm by exploiting
the structure of the problem being solved. We examine existing ideas including
extensions of the Boolean language to allow cardinality constraints,
pseudo-Boolean representations, symmetry, and a limited form of quantification.
While this paper is intended as a survey, our research results are contained in
the two subsequent articles, with the theoretical structure of ZAP described in
the second paper in this series, and ZAP's implementation described in the
third
The Theory Behind TheoryMine
Abstract. We describe the technology behind the TheoryMine novelty gift company, which sells the rights to name novel mathematical theorems. A tower of four computer systems is used to generate recursive theories, then to speculate conjectures in those theories and then to prove these conjectures. All stages of the process are entirely automatic. The process guarantees large numbers of sound, novel theorems of some intrinsic merit.
Generalizing Boolean Satisfiability II: Theory
This is the second of three planned papers describing ZAP, a satisfiability
engine that substantially generalizes existing tools while retaining the
performance characteristics of modern high performance solvers. The fundamental
idea underlying ZAP is that many problems passed to such engines contain rich
internal structure that is obscured by the Boolean representation used; our
goal is to define a representation in which this structure is apparent and can
easily be exploited to improve computational performance. This paper presents
the theoretical basis for the ideas underlying ZAP, arguing that existing ideas
in this area exploit a single, recurring structure in that multiple database
axioms can be obtained by operating on a single axiom using a subgroup of the
group of permutations on the literals in the problem. We argue that the group
structure precisely captures the general structure at which earlier approaches
hinted, and give numerous examples of its use. We go on to extend the
Davis-Putnam-Logemann-Loveland inference procedure to this broader setting, and
show that earlier computational improvements are either subsumed or left intact
by the new method. The third paper in this series discusses ZAPs implementation
and presents experimental performance results
The vaginal examination during labour. Is it of benefit or harm?
Giving birth is an important life event and care practices that occur during labour and birth can have a lasting influence on the mother and the family (Beech & Phipps, 2004). The use of regular, routine vaginal examination to assess the progress of labour is one such care practice. There are two ways of viewing the vaginal examination during labour. The first regards the vaginal examination as a physically invasive intervention which can have adverse psychological consequences (Kitzinger, 2005). The second sees vaginal examination as an essential clinical assessment tool that provides the most exact measure of labour progress (Enkin et al., 2000). This paper explores thes two viewpoints in more detail and discusses the benefits versus the harms of undertaking a vaginal examination during labour. Midwives use a variety of skills and observations to assess labour progress
Generalizing Boolean Satisfiability III: Implementation
This is the third of three papers describing ZAP, a satisfiability engine
that substantially generalizes existing tools while retaining the performance
characteristics of modern high-performance solvers. The fundamental idea
underlying ZAP is that many problems passed to such engines contain rich
internal structure that is obscured by the Boolean representation used; our
goal has been to define a representation in which this structure is apparent
and can be exploited to improve computational performance. The first paper
surveyed existing work that (knowingly or not) exploited problem structure to
improve the performance of satisfiability engines, and the second paper showed
that this structure could be understood in terms of groups of permutations
acting on individual clauses in any particular Boolean theory. We conclude the
series by discussing the techniques needed to implement our ideas, and by
reporting on their performance on a variety of problem instances
- …