This article studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely, those generated by collapsible pushdown automata. The main motivation for studying these comes from the connections automata and higher-order recursion schemes, both models being equi-expressive generating trees. Our result is to establish decidability such provide an effecti...

A bstract We show that the rotation of QCD axion field, aided by B?L violation from supersymmetric R -parity violating couplings, can yield observed baryon abundance. Strong sphaleron processes transfer angular momentum field into a quark chiral asymmetry, which couplings convert to asymmetry Universe. focus on case dimensionless with textures motivated grand unified theories and comment more g...

We calculate in chiral perturbation theory the parity-violating two-pion exchange nucleon-nucleon potentials at leading one-loop order. At a distance of r = m−1 π ≃ 1.4 fm they amount to about ±16% of the parity-violating 1π-exchange potential. We evaluate also the parity-violating effects arising from 2π-exchange with excitation of virtual ∆(1232)-isobars. These come out to be relatively small...

A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G having no parity path (a parity edge-coloring). Let p̂(G) be the least number of colors in an edge-coloring of G having no open parity walk (a strong parity edge-coloring). Always p̂(G) ≥ p(G) ≥ χ′(G). We prove that p̂(Kn) = ...

For deuteron electroweak disintegration, parity violating effects are investigated which arise from the interference of γ and Z exchange as well as from the hadronic sector via a small parity violating component in the deuteron. The general formalism for the differential cross section and polarization observables of electromagnetic deuteron disintegration is extended to incorporate parity viola...

Parity constraints, common in application domains such as circuit verification, bounded model checking, and logical cryptanalysis, are not necessarily most efficiently solved if translated into conjunctive normal form. Thus, specialized parity reasoning techniques have been developed in the past for propagating parity constraints. This paper studies the questions of deciding whether unit propag...