Periodically Forced Nonlinear Oscillators With Hysteretic Damping

We perform a detailed study of the dynamics of a nonlinear, one-dimensional oscillator driven by a periodic force under hysteretic damping, whose linear version was originally proposed and analyzed by Bishop in [1]. We first add a small quadratic stiffness term in the constitutive equation and construct the periodic solution of the problem by a systematic perturbation method, neglecting transient terms as $t\rightarrow \infty$. We then repeat the analysis replacing the quadratic by a cubic term, which does not allow the solutions to escape to infinity. In both cases, we examine the dependence of the amplitude of the periodic solution on the different parameters of the model and discuss the differences with the linear model. We point out certain undesirable features of the solutions, which have also been alluded to in the literature for the linear Bishop's model, but persist in the nonlinear case as well. Finally, we discuss an alternative hysteretic damping oscillator model first proposed by Reid [2], which appears to be free from these difficulties and exhibits remarkably rich dynamical properties when extended in the nonlinear regime.Comment: Accepted for publication in the Journal of Computational and Nonlinear Dynamic

Experimental String Field Theory

We develop efficient algorithms for level-truncation computations in open bosonic string field theory. We determine the classical action in the universal subspace to level (18,54) and apply this knowledge to numerical evaluations of the tachyon condensate string field. We obtain two main sets of results. First, we directly compute the solutions up to level L=18 by extremizing the level-truncated action. Second, we obtain predictions for the solutions for L > 18 from an extrapolation to higher levels of the functional form of the tachyon effective action. We find that the energy of the stable vacuum overshoots -1 (in units of the brane tension) at L=14, reaches a minimum E_min = -1.00063 at L ~ 28 and approaches with spectacular accuracy the predicted answer of -1 as L -> infinity. Our data are entirely consistent with the recent perturbative analysis of Taylor and strongly support the idea that level-truncation is a convergent approximation scheme. We also check systematically that our numerical solution, which obeys the Siegel gauge condition, actually satisfies the full gauge-invariant equations of motion. Finally we investigate the presence of analytic patterns in the coefficients of the tachyon string field, which we are able to reliably estimate in the L -> infinity limit.Comment: 37 pages, 6 figure

Residual intersection theory with reducible schemes

We develop a formula (Theorem 5.1) which allows to compute top Chern classes of vector bundles on the vanishing locus $V(s)$ of a section of this bundle. This formula particularly applies in the case when $V(s)$ is the union of locally complete intersections giving the individual contribution of each component and their mutual intersections. We conclude with applications to the enumeration of rational curves in complete intersections in projective space.Comment: 9 page

Tethered Monte Carlo: computing the effective potential without critical slowing down

We present Tethered Monte Carlo, a simple, general purpose method of computing the effective potential of the order parameter (Helmholtz free energy). This formalism is based on a new statistical ensemble, closely related to the micromagnetic one, but with an extended configuration space (through Creutz-like demons). Canonical averages for arbitrary values of the external magnetic field are computed without additional simulations. The method is put to work in the two dimensional Ising model, where the existence of exact results enables us to perform high precision checks. A rather peculiar feature of our implementation, which employs a local Metropolis algorithm, is the total absence, within errors, of critical slowing down for magnetic observables. Indeed, high accuracy results are presented for lattices as large as L=1024.Comment: 32 pages, 8 eps figures. Corrected Eq. (36), which is wrong in the published pape

Group law computations on Jacobians of hyperelliptic curves

We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the geometric description of the group law and applies to hyperelliptic curves of arbitrary genus. While Cantor’s general composition involves arithmetic in the polynomial ring F_q[x], the algorithm we propose solves a linear system over the base field which can be written down directly from the Mumford coordinates of the group elements. We apply this method to give more efficient formulas for group operations in both affine and projective coordinates for cryptographic systems based on Jacobians of genus 2 hyperelliptic curves in general form

On the first k moments of the random count of a pattern in a multi-states sequence generated by a Markov source

In this paper, we develop an explicit formula allowing to compute the first k moments of the random count of a pattern in a multi-states sequence generated by a Markov source. We derive efficient algorithms allowing to deal both with low or high complexity patterns and either homogeneous or heterogenous Markov models. We then apply these results to the distribution of DNA patterns in genomic sequences where we show that moment-based developments (namely: Edgeworth's expansion and Gram-Charlier type B series) allow to improve the reliability of common asymptotic approximations like Gaussian or Poisson approximations