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

New spin Calogero-Sutherland models related to B_N-type Dunkl operators

We construct several new families of exactly and quasi-exactly solvable BC_N-type Calogero-Sutherland models with internal degrees of freedom. Our approach is based on the introduction of two new families of Dunkl operators of B_N type which, together with the original B_N-type Dunkl operators, are shown to preserve certain polynomial subspaces of finite dimension. We prove that a wide class of quadratic combinations involving these three sets of Dunkl operators always yields a spin Calogero-Sutherland model, which is (quasi-)exactly solvable by construction. We show that all the spin Calogero-Sutherland models obtainable within this framework can be expressed in a unified way in terms of a Weierstrass P function with suitable half-periods. This provides a natural spin counterpart of the well-known general formula for a scalar completely integrable potential of BC_N type due to Olshanetsky and Perelomov. As an illustration of our method, we exactly compute several energy levels and their corresponding wavefunctions of an elliptic quasi-exactly solvable potential for two and three particles of spin 1/2.Comment: 18 pages, typeset in LaTeX 2e using revtex 4.0b5 and the amslatex package Minor changes in content, one reference adde

Quasi-Exact Solvability and the direct approach to invariant subspaces

We propose a more direct approach to constructing differential operators that preserve polynomial subspaces than the one based on considering elements of the enveloping algebra of sl(2). This approach is used here to construct new exactly solvable and quasi-exactly solvable quantum Hamiltonians on the line which are not Lie-algebraic. It is also applied to generate potentials with multiple algebraic sectors. We discuss two illustrative examples of these two applications: an interesting generalization of the Lam\'e potential which posses four algebraic sectors, and a quasi-exactly solvable deformation of the Morse potential which is not Lie-algebraic.Comment: 17 pages, 3 figure

Phase Transition in a Random Fragmentation Problem with Applications to Computer Science

We study a fragmentation problem where an initial object of size x is broken into m random pieces provided x>x_0 where x_0 is an atomic cut-off. Subsequently the fragmentation process continues for each of those daughter pieces whose sizes are bigger than x_0. The process stops when all the fragments have sizes smaller than x_0. We show that the fluctuation of the total number of splitting events, characterized by the variance, generically undergoes a nontrivial phase transition as one tunes the branching number m through a critical value m=m_c. For m<m_c, the fluctuations are Gaussian where as for m>m_c they are anomalously large and non-Gaussian. We apply this general result to analyze two different search algorithms in computer science.Comment: 5 pages RevTeX, 3 figures (.eps

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

Proving Safety with Trace Automata and Bounded Model Checking

Loop under-approximation is a technique that enriches C programs with additional branches that represent the effect of a (limited) range of loop iterations. While this technique can speed up the detection of bugs significantly, it introduces redundant execution traces which may complicate the verification of the program. This holds particularly true for verification tools based on Bounded Model Checking, which incorporate simplistic heuristics to determine whether all feasible iterations of a loop have been considered. We present a technique that uses \emph{trace automata} to eliminate redundant executions after performing loop acceleration. The method reduces the diameter of the program under analysis, which is in certain cases sufficient to allow a safety proof using Bounded Model Checking. Our transformation is precise---it does not introduce false positives, nor does it mask any errors. We have implemented the analysis as a source-to-source transformation, and present experimental results showing the applicability of the technique