Infinite families of superintegrable systems separable in subgroup coordinates

A method is presented that makes it possible to embed a subgroup separable superintegrable system into an infinite family of systems that are integrable and exactly-solvable. It is shown that in two dimensional Euclidean or pseudo-Euclidean spaces the method also preserves superintegrability. Two infinite families of classical and quantum superintegrable systems are obtained in two-dimensional pseudo-Euclidean space whose classical trajectories and quantum eigenfunctions are investigated. In particular, the wave-functions are expressed in terms of Laguerre and generalized Bessel polynomials.Comment: 19 pages, 6 figure

An infinite family of superintegrable Hamiltonians with reflection in the plane

We introduce a new infinite class of superintegrable quantum systems in the plane. Their Hamiltonians involve reflection operators. The associated Schr\"odinger equations admit separation of variables in polar coordinates and are exactly solvable. The angular part of the wave function is expressed in terms of little -1 Jacobi polynomials. The spectra exhibit "accidental" degeneracies. The superintegrability of the model is proved using the recurrence relation approach. The (higher-order) constants of motion are constructed and the structure equations of the symmetry algebra obtained.Comment: 19 page

Energy-momentum conservation in pre-metric electrodynamics with magnetic charges

A necessary and sufficient condition for energy-momentum conservation is proved within a topological, pre-metric approach to classical electrodynamics including magnetic as well as electric charges. The extended Lorentz force, consisting of mutual actions by F=(E, B) on the electric current and G=(H, D) on the magnetic current, can be derived from an energy-momentum "potential" if and only if the constitutive relation G=G(F) satisfies a certain vanishing condition. The electric-magnetic reciprocity introduced by Hehl and Obukhov is seen to define a complex structure on the tensor product of 2-form pairs (F,G) which is independent of but consistent with the Hodge star operator defined by any Lorentzian metric. Contrary to a recent claim in the literature, it does not define a complex structure on the space of 2-forms itself.Comment: 8 pages, 1 fugur

A generalized photon propagator

A covariant gauge independent derivation of the generalized dispersion relation of electromagnetic waves in a medium with local and linear constitutive law is presented. A generalized photon propagator is derived. For Maxwell constitutive tensor, the standard light cone structure and the standard Feynman propagator are reinstated

Families of superintegrable Hamiltonians constructed from exceptional polynomials

We introduce a family of exactly-solvable two-dimensional Hamiltonians whose wave functions are given in terms of Laguerre and exceptional Jacobi polynomials. The Hamiltonians contain purely quantum terms which vanish in the classical limit leaving only a previously known family of superintegrable systems. Additional, higher-order integrals of motion are constructed from ladder operators for the considered orthogonal polynomials proving the quantum system to be superintegrable

Corrections to Sirlin's Theorem in O(p6)O(p^6) Chiral Perturbation Theory

We present the results of the first two-loop calculation of a form factor in full $SU(3) \times SU(3)$ Chiral Perturbation Theory. We choose a specific linear combination of $\pi^+, K^+, K^0$ and $K\pi$ form factors (the one appearing in Sirlin's theorem) which does not get contributions from order $p^6$ operators with unknown constants. For the charge radii, the correction to the previous one-loop result turns out to be significant, but still there is no agreement with the present data due to large experimental uncertainties in the kaon charge radii.Comment: 6 pages, Latex, 2 LaTeX figure

The Complexity of Reasoning for Fragments of Default Logic

Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as \SigmaPtwo-complete, and the complexity of the credulous and skeptical reasoning problem as SigmaP2-complete, resp. PiP2-complete. Additionally, he investigated restrictions on the default rules, i.e., semi-normal default rules. Selman made in 1992 a similar approach with disjunction-free and unary default rules. In this paper we systematically restrict the set of allowed propositional connectives. We give a complete complexity classification for all sets of Boolean functions in the meaning of Post's lattice for all three common decision problems for propositional default logic. We show that the complexity is a hexachotomy (SigmaP2-, DeltaP2-, NP-, P-, NL-complete, trivial) for the extension existence problem, while for the credulous and skeptical reasoning problem we obtain similar classifications without trivial cases.Comment: Corrected versio