The Berry-Tabor conjecture for spin chains of Haldane-Shastry type

According to a long-standing conjecture of Berry and Tabor, the distribution of the spacings between consecutive levels of a "generic'' integrable model should follow Poisson's law. In contrast, the spacings distribution of chaotic systems typically follows Wigner's law. An important exception to the Berry-Tabor conjecture is the integrable spin chain with long-range interactions introduced by Haldane and Shastry in 1988, whose spacings distribution is neither Poissonian nor of Wigner's type. In this letter we argue that the cumulative spacings distribution of this chain should follow the "square root of a logarithm'' law recently proposed by us as a characteristic feature of all spin chains of Haldane-Shastry type. We also show in detail that the latter law is valid for the rational counterpart of the Haldane-Shastry chain introduced by Polychronakos.Comment: LaTeX with revtex4, 6 pages, 6 figure

A plan for the characterization, calibration, and evaluation of LAPR-2

A new airborne Linear Array Pushbroom Radiometer (LAPR-II) was built. LAPR-II will use linear arrays of silicon detectors to acquire four channels of digital image data for spectral bands within the visible and near infrared portions of the spectrum (0.4 - 1.0 micrometers). The data will be quantized to 10 bits, and spectral filters for each channel will be changeable in flight. The instrument will initially be flown aboard a NASA/Wallops' aircraft, and off nadir pointing of LAPR-II will be possible. Together, the instrument and its platform will provide a flexible readily available source of digital image data for scientific experiments. If LAPR-II is to serve as a precise scientific instrument, the instrument's characteristics must be quantitatively described and the data must be calibrated with respect to absolute radiometric units. The LAPR-II is described and the work required to characterize the instrument's spectral response, radiometric response, and spatial resolution and to calibrate the response from the many detectors per array is outlined

1/fα1/f^\alpha noise and integrable systems

An innovative test for detecting quantum chaos based on the analysis of the spectral fluctuations regarded as a time series has been recently proposed. According to this test, the fluctuations of a fully chaotic system should exhibit 1/f noise, whereas for an integrable system this noise should obey the 1/f^2 power law. In this letter, we show that there is a family of well-known integrable systems, namely spin chains of Haldane-Shastry type, whose spectral fluctuations decay instead as 1/f^4. We present a simple theoretical justification of this fact, and propose an alternative characterization of quantum chaos versus integrability formulated directly in terms of the power spectrum of the spacings of the unfolded spectrum.Comment: 5 pages, 3 figures, RevTe

Exchange operator formalism for N-body spin models with near-neighbors interactions

We present a detailed analysis of the spin models with near-neighbors interactions constructed in our previous paper [Phys. Lett. B 605 (2005) 214] by a suitable generalization of the exchange operator formalism. We provide a complete description of a certain flag of finite-dimensional spaces of spin functions preserved by the Hamiltonian of each model. By explicitly diagonalizing the Hamiltonian in the latter spaces, we compute several infinite families of eigenfunctions of the above models in closed form in terms of generalized Laguerre and Jacobi polynomials.Comment: RevTeX, 31 pages, no figures; important additional conten

Parikh Image of Pushdown Automata

We compare pushdown automata (PDAs for short) against other representations. First, we show that there is a family of PDAs over a unary alphabet with $n$ states and $p \geq 2n + 4$ stack symbols that accepts one single long word for which every equivalent context-free grammar needs $\Omega(n^2(p-2n-4))$ variables. This family shows that the classical algorithm for converting a PDA to an equivalent context-free grammar is optimal even when the alphabet is unary. Moreover, we observe that language equivalence and Parikh equivalence, which ignores the ordering between symbols, coincide for this family. We conclude that, when assuming this weaker equivalence, the conversion algorithm is also optimal. Second, Parikh's theorem motivates the comparison of PDAs against finite state automata. In particular, the same family of unary PDAs gives a lower bound on the number of states of every Parikh-equivalent finite state automaton. Finally, we look into the case of unary deterministic PDAs. We show a new construction converting a unary deterministic PDA into an equivalent context-free grammar that achieves best known bounds.Comment: 17 pages, 2 figure

Forward Analysis and Model Checking for Trace Bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all $\omega$-regular properties on the set of infinite traces of the system

Automatic Verification of Erlang-Style Concurrency

This paper presents an approach to verify safety properties of Erlang-style, higher-order concurrent programs automatically. Inspired by Core Erlang, we introduce Lambda-Actor, a prototypical functional language with pattern-matching algebraic data types, augmented with process creation and asynchronous message-passing primitives. We formalise an abstract model of Lambda-Actor programs called Actor Communicating System (ACS) which has a natural interpretation as a vector addition system, for which some verification problems are decidable. We give a parametric abstract interpretation framework for Lambda-Actor and use it to build a polytime computable, flow-based, abstract semantics of Lambda-Actor programs, which we then use to bootstrap the ACS construction, thus deriving a more accurate abstract model of the input program. We have constructed Soter, a tool implementation of the verification method, thereby obtaining the first fully-automatic, infinite-state model checker for a core fragment of Erlang. We find that in practice our abstraction technique is accurate enough to verify an interesting range of safety properties. Though the ACS coverability problem is Expspace-complete, Soter can analyse these verification problems surprisingly efficiently.Comment: 12 pages plus appendix, 4 figures, 1 table. The tool is available at http://mjolnir.cs.ox.ac.uk/soter

Convex Hull of Arithmetic Automata

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm computing the linear constraints defining these convex set is provided. Such an algorithm is useful for effectively extracting geometrical properties of the whole set of solutions of complex constraints symbolically represented by arithmetic automata