Coordinate Bethe Ansatz for the String S-Matrix

We use the coordinate Bethe ansatz approach to derive the nested Bethe equations corresponding to the recently found S-matrix for strings in AdS5 x S5, compatible with centrally extended su(2|2) symmetry.Comment: 25 Pages, plain LaTeX, 4 Figures. Mostly added references, fixed typo

On the number of fully packed loop configurations with a fixed associated matching

We show that the number of fully packed loop configurations corresponding to a matching with $m$ nested arches is polynomial in $m$ if $m$ is large enough, thus essentially proving two conjectures by Zuber [Electronic J. Combin. 11 (2004), Article #R13].Comment: AnS-LaTeX, 43 pages; Journal versio

String Junctions and the BPS Spectrum of N=2 SU(2) Theory with Massive Matters

We study the BPS spectrum of four dimensional N=2 SU(2) theory with massive fundamental matters using the D3-brane probe. Since the BPS states are realized by string webs subject to the BPS conditions, we determine explicitly the configurations of such webs. It is observed that there appear BPS string webs with multiple of junctions corresponding to the fact that the curves of marginal stability in massive theory are infinitely nested. In terms of the string configurations, various properties of the curves of marginal stability are explained intuitively.Comment: 16 pages, LaTex, 5 figure

Correlation functions in a c=1 boundary conformal field theory

We obtain exact results for correlation functions of primary operators in the two-dimensional conformal field theory of a scalar field interacting with a critical periodic boundary potential. Amplitudes involving arbitrary bulk discrete primary fields are given in terms of SU(2) rotation coefficients while boundary amplitudes involving discrete boundary fields are independent of the boundary interaction. Mixed amplitudes involving both bulk and boundary discrete fields can also be obtained explicitly. Two- and three-point boundary amplitudes involving fields at generic momentum are determined, up to multiplicative constants, by the band spectrum in the open-string sector of the theory.Comment: 33 pages, 6 figure

Exact limiting solutions for certain deterministic traffic rules

We analyze the steady-state flow as a function of the initial density for a class of deterministic cellular automata rules (``traffic rules'') with periodic boundary conditions [H. Fuks and N. Boccara, Int. J. Mod. Phys. C 9, 1 (1998)]. We are able to predict from simple considerations the observed, unexpected cutoff of the average flow at unity. We also present an efficient algorithm for determining the exact final flow from a given finite initial state. We analyze the behavior of this algorithm in the infinite limit to obtain for R_m,k an exact polynomial equation maximally of 2(m+k)th degree in the flow and density.Comment: 25 pages, 8 figure

Answering Regular Path Queries on Workflow Provenance

This paper proposes a novel approach for efficiently evaluating regular path queries over provenance graphs of workflows that may include recursion. The approach assumes that an execution g of a workflow G is labeled with query-agnostic reachability labels using an existing technique. At query time, given g, G and a regular path query R, the approach decomposes R into a set of subqueries R1, ..., Rk that are safe for G. For each safe subquery Ri, G is rewritten so that, using the reachability labels of nodes in g, whether or not there is a path which matches Ri between two nodes can be decided in constant time. The results of each safe subquery are then composed, possibly with some small unsafe remainder, to produce an answer to R. The approach results in an algorithm that significantly reduces the number of subqueries k over existing techniques by increasing their size and complexity, and that evaluates each subquery in time bounded by its input and output size. Experimental results demonstrate the benefit of this approach