This article is a continuation of an article on defining functions on trees (see [6]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme of defining functions inductively with the set as domain. We conclude with defining the scheme of...

The centrepiece of this paper is a normal form for primitive elements which facilitates the use of induction arguments to prove properties of primitive elements. The normal form arises from an elementary algorithm for constructing a primitive element p in F(x, y) with a given exponent sum pair (X, Y ), if such an element p exists. Several results concerning the primitive elements of F(x, y) are...

In this paper we consider tree-level scattering in the minimal N = 4 topological string and show that a large class of N -point functions can be recast in terms of corresponding amplitudes in the (1, k) minimal bosonic string. This suggests a non-trivial relation between the minimal N = 4 topological strings, the (1, k) minimal bosonic strings and their corresponding ADE matrix models. This rel...

We use the well-known framework of concrete categories to show how much of standard universal algebra may be done in an abstract and still rather intuitive way. This is used to recast the unifying view of behavioural semantics of speciications based on behavioural satisfaction and, respectively, on behavioural equivalence of models abstracting away from many particular features of standard alge...

We develop an algorithm for brain connectivity assessment using geodesics in HARDI (high angular resolution diffusion imaging). We propose to recast the problem of finding fibers bundles and connectivity maps to the calculation of shortest paths on a Riemannian manifold defined from fiber ODFs computed from HARDI measurements. Several experiments on real data show that our method is able to seg...

We find a one-parameter family of variables which recast the 3+1 Einstein equations into firstorder symmetric-hyperbolic form for any fixed choice of gauge. Hyperbolicity considerations lead us to a redefinition of the lapse in terms of an arbitrary factor times a power of the determinant of the 3-metric; under certain assumptions, the exponent can be chosen arbitrarily, but positive, with no i...

The Heath-Jarrow-Morton (HJM) formulation of treasury bonds in terms of forward rates is recast as a problem in path integration. The HJM model is generalized to the case where all the forward rates are allowed to fluctuate independently. The resulting theory is shown to be a two-dimensional Gaussian quantum field theory. The no arbitrage condition is obtained and a functional integral derivati...

This short-paper introduces our new process discovery plug-in Eve. Eve is part of the ProM Tool framework and based on event structures. Eve folds an event log to an event structure, before synthesizing a workflow model. The idea to recast process mining operations based on event structures as a behavioral model was suggested by Marlon Dumas and Luciano Garcı́a-Bañuelos two years ago. This short...

We briefly review simulation schemes for the investigation of rare transitions and we resume the recently introduced Transition Interface Sampling, a method in which the computation of rate constants is recast into the computation of fluxes through interfaces dividing the reactant and product state. PACS: 82.20.Db, 82.20.Sb keywords: Rare events; Rate constants; Transition Path Sampling. ∗Corre...