Complexity classification in qualitative temporal constraint reasoning

We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that every other fragment is NP-complete

Reasoning about temporal relations : the maximal tractable subalgebras of Allen's interval algebra

Allen's interval algebra is one of the best established formalisms for temporal reasoning. This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in this algebra. When the constraints are chosen from the full Allen's algebra, this form of satisfiability problem is known to be NP-complete. However, eighteen tractable subalgebras have previously been identified; we show here that these subalgebras include all possible tractable subsets of Allen's algebra. In other words, we show that this algebra contains exactly eighteen maximal tractable subalgebras, and reasoning in any fragment not entirely contained in one of these subalgebras is NP-complete. We obtain this dichotomy result by giving a new uniform description of the known maximal tractable subalgebras, and then systematically using a general algebraic technique for identifying maximal subalgebras with a given property

Inertial forces and the foundations of optical geometry

Assuming a general timelike congruence of worldlines as a reference frame, we derive a covariant general formalism of inertial forces in General Relativity. Inspired by the works of Abramowicz et. al. (see e.g. Abramowicz and Lasota, Class. Quantum Grav. 14 (1997) A23), we also study conformal rescalings of spacetime and investigate how these affect the inertial force formalism. While many ways of describing spatial curvature of a trajectory has been discussed in papers prior to this, one particular prescription (which differs from the standard projected curvature when the reference is shearing) appears novel. For the particular case of a hypersurface-forming congruence, using a suitable rescaling of spacetime, we show that a geodesic photon is always following a line that is spatially straight with respect to the new curvature measure. This fact is intimately connected to Fermat's principle, and allows for a certain generalization of the optical geometry as will be further pursued in a companion paper (Jonsson and Westman, Class. Quantum Grav. 23 (2006) 61). For the particular case when the shear-tensor vanishes, we present the inertial force equation in three-dimensional form (using the bold face vector notation), and note how similar it is to its Newtonian counterpart. From the spatial curvature measures that we introduce, we derive corresponding covariant differentiations of a vector defined along a spacetime trajectory. This allows us to connect the formalism of this paper to that of Jantzen et. al. (see e.g. Bini et. al., Int. J. Mod. Phys. D 6 (1997) 143).Comment: 42 pages, 7 figure

Tropically convex constraint satisfaction

A semilinear relation S is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as determining the winner in Mean Payoff Games, a notorious problem of open computational complexity. Mean Payoff Games are known to be in the intersection of NP and co-NP, which is not known for max-closed semilinear constraints. Semilinear relations that are max-closed and additionally closed under translations have been called tropically convex in the literature. One of our main results is a new duality for open tropically convex relations, which puts the CSP for tropically convex semilinaer constraints in general into NP intersected co-NP. This extends the corresponding complexity result for scheduling under and-or precedence constraints, or equivalently the max-atoms problem. To this end, we present a characterization of max-closed semilinear relations in terms of syntactically restricted first-order logic, and another characterization in terms of a finite set of relations L that allow primitive positive definitions of all other relations in the class. We also present a subclass of max-closed constraints where the CSP is in P; this class generalizes the class of max-closed constraints over finite domains, and the feasibility problem for max-closed linear inequalities. Finally, we show that the class of max-closed semilinear constraints is maximal in the sense that as soon as a single relation that is not max-closed is added to L, the CSP becomes NP-hard.Comment: 29 pages, 2 figure

Magnetic-field dependence of dynamical vortex response in two-dimensional Josephson junction arrays and superconducting films

The dynamical vortex response of a two-dimensional array of the resistively shunted Josephson junctions in a perpendicular magnetic field is inferred from simulations. It is found that, as the magnetic field is increased at a fixed temperature, the response crosses over from normal to anomalous, and that this crossover can be characterized by a single dimensionless parameter. It is described how this crossover should be reflected in measurements of the complex impedance for Josephson junction arrays and superconducting films.Comment: 4 pages including 5 figures in two columns, final versio

Memory and chaos in an Ising spin glass

The non-equilibrium dynamics of the model 3d-Ising spin glass - Fe$_{0.55}$Mn$_{0.45}$TiO$_3$ - has been investigated from the temperature and time dependence of the zero field cooled magnetization recorded under certain thermal protocols. The results manifest chaos, rejuvenation and memory features of the equilibrating spin configuration that are very similar to those observed in corresponding studies of the archetypal RKKY spin glass Ag(Mn). The sample is rapidly cooled in zero magnetic field, and the magnetization recorded on re-heating. When a stop at constant temperature $T_s$ is made during the cooling, the system evolves toward its equilibrium state at this temperature. The equilibrated state established during the stop becomes frozen in on further cooling and is retrieved on re-heating. The memory of the aging at $T_s$ is not affected by a second stop at a lower temperature $T'_s$. Reciprocally, the first equilibration at $T_s$ has no influence on the relaxation at $T'_s$, as expected within the droplet model for domain growth in a chaotic landscape.Comment: REVTeX style; 4 pages, 4 figure

Condensation in nongeneric trees

We study nongeneric planar trees and prove the existence of a Gibbs measure on infinite trees obtained as a weak limit of the finite volume measures. It is shown that in the infinite volume limit there arises exactly one vertex of infinite degree and the rest of the tree is distributed like a subcritical Galton-Watson tree with mean offspring probability $m<1$. We calculate the rate of divergence of the degree of the highest order vertex of finite trees in the thermodynamic limit and show it goes like $(1-m)N$ where $N$ is the size of the tree. These trees have infinite spectral dimension with probability one but the spectral dimension calculated from the ensemble average of the generating function for return probabilities is given by $2\beta -2$ if the weight $w_n$ of a vertex of degree $n$ is asymptotic to $n^{-\beta}$.Comment: 57 pages, 14 figures. Minor change