Dimensional regularization of the third post-Newtonian gravitational wave generation from two point masses

Dimensional regularization is applied to the computation of the gravitational wave field generated by compact binaries at the third post-Newtonian (3PN) approximation. We generalize the wave generation formalism from isolated post-Newtonian matter systems to d spatial dimensions, and apply it to point masses (without spins), modelled by delta-function singularities. We find that the quadrupole moment of point-particle binaries in harmonic coordinates contains a pole when epsilon = d-3 -> 0 at the 3PN order. It is proved that the pole can be renormalized away by means of the same shifts of the particle world-lines as in our recent derivation of the 3PN equations of motion. The resulting renormalized (finite when epsilon -> 0) quadrupole moment leads to unique values for the ambiguity parameters xi, kappa and zeta, which were introduced in previous computations using Hadamard's regularization. Several checks of these values are presented. These results complete the derivation of the gravitational waves emitted by inspiralling compact binaries up to the 3.5PN level of accuracy which is needed for detection and analysis of the signals in the gravitational-wave antennas LIGO/VIRGO and LISA.Comment: 60 pages, LaTeX 2e, REVTeX 4, 10 PostScript files (1 figure and 9 Young tableaux used in the text

Mod-two cohomology of symmetric groups as a Hopf ring

We compute the mod-2 cohomology of the collection of all symmetric groups as a Hopf ring, where the second product is the transfer product of Strickland and Turner. We first give examples of related Hopf rings from invariant theory and representation theory. In addition to a Hopf ring presentation, we give geometric cocycle representatives and explicitly determine the structure as an algebra over the Steenrod algebra. All calculations are explicit, with an additive basis which has a clean graphical representation. We also briefly develop related Hopf ring structures on rings of symmetric invariants and end with a generating set consisting of Stiefel-Whitney classes of regular representations v2. Added new results on varieties which represent the cocycles, a graphical representation of the additive basis, and on the Steenrod algebra action. v3. Included a full treatment of invariant theoretic Hopf rings, refined the definition of representing varieties, and corrected and clarified references.Comment: 31 pages, 6 figure

Termination orders for 3-dimensional rewriting

This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each system are studied. Finally, a convergent 3-polygraph for the (commutative) theory of Z/2Z-vector spaces is given. In order to prove these results, it is explained how to craft a class of termination orders for 3-polygraphs.Comment: 30 pages, 35 figure

Move-minimizing puzzles, diamond-colored modular and distributive lattices, and poset models for Weyl group symmetric functions

The move-minimizing puzzles presented here are certain types of one-player combinatorial games that are shown to have explicit solutions whenever they can be encoded in a certain way as diamond-colored modular and distributive lattices. Such lattices can also arise naturally as models for certain algebraic objects, namely Weyl group symmetric functions and their companion semisimple Lie algebra representations. The motivation for this paper is therefore both diversional and algebraic: To show how some recreational move-minimizing puzzles can be solved explicitly within an order-theoretic context and also to realize some such puzzles as combinatorial models for symmetric functions associated with certain fundamental representations of the symplectic and odd orthogonal Lie algebras

Facets of forecast evaluation

Forecasts are issued as point or probabilistic predictions, and their performance is measured using consistent scoring functions or proper scoring rules. We identify classes of elementary members of these performance measures and develop diagnostic tools to assist in the ranking of forecasters. Rankings are subject to the choice of evaluation criterion and the sampling variability. We also provide guidance in the computation of a particular scoring rule, the continuous ranked probability score

Synthesis and Optimization of Reversible Circuits - A Survey

Reversible logic circuits have been historically motivated by theoretical research in low-power electronics as well as practical improvement of bit-manipulation transforms in cryptography and computer graphics. Recently, reversible circuits have attracted interest as components of quantum algorithms, as well as in photonic and nano-computing technologies where some switching devices offer no signal gain. Research in generating reversible logic distinguishes between circuit synthesis, post-synthesis optimization, and technology mapping. In this survey, we review algorithmic paradigms --- search-based, cycle-based, transformation-based, and BDD-based --- as well as specific algorithms for reversible synthesis, both exact and heuristic. We conclude the survey by outlining key open challenges in synthesis of reversible and quantum logic, as well as most common misconceptions.Comment: 34 pages, 15 figures, 2 table