Related papers: Dynamique du probl\`eme $3x+1$ sur la droite r\'ee…
Numerical continuation techniques are powerful tools that have been extensively used to identify particular solutions of nonlinear dynamical systems and enable trajectory design in chaotic astrodynamics problems such as the Circular…
We consider stochastic dynamical systems defined by differential equations with a uniform random time delay. The latter equations are shown to be equivalent to deterministic higher-order differential equations: for an $n$-th order equation…
Numerical relativity is finally approaching a state where the evolution of rather general (3+1)-dimensional data sets can be computed in order to solve the Einstein equations. After a general introduction, three topics of current interest…
The $3+1$ formalism provides a structured approach to analyzing spacetime by separating it into spatial and temporal components. When applied to the Robertson-Walker metric, it simplifies the analysis of cosmological evolution by dividing…
This paper explores the use of the standard approach for proving runtime bounds in discrete domains---often referred to as drift analysis---in the context of optimization on a continuous domain. Using this framework we analyze the (1+1)…
The $3x+k$ function $T_{k}(n)$ sends $n$ to $(3n+k)/2$ resp. $n/2,$ according as $n$ is odd, resp. even, where $k \equiv \pm 1~(\bmod \, 6)$. The map $T_k(\cdot)$ sends integers to integers, and for $m \ge 1$ let $n \rightarrow m$ mean that…
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…
The 0-1 integer linear programming feasibility problem is an important NP-complete problem. This paper proposes a continuous-time dynamical system for solving that problem without getting trapped in non-solution local minima. First, the…
The work [8] established memory loss in the time-dependent (non-random) case of uniformly expanding maps of the interval. Here we find conditions under which we have convergence to the normal distribution of the appropriately scaled…
This paper studies the counting problem in random dynamical systems. We noticed that the nature of counting in the random setting is completely different than that of the deterministic systems in the sense that non-exponential growth is…
We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…
We give a detailed analysis of the cost used by the (1+1)-evolutionary algorithm. The problem has been approached in the evolutionary algorithm literature under various views, formulation and degree of rigor. Our asymptotic approximations…
We consider convex optimization problems with the objective function having Lipshitz-continuous $p$-th order derivative, where $p\geq 1$. We propose a new tensor method, which closes the gap between the lower…
This paper presents an extension of Naor's analysis on the join-or-balk problem in observable M/M/1 queues. While all other Markovian assumptions still hold, we explore this problem assuming uncertain arrival rates under the…
We study single-flip dynamics in sets of three-dimensional rhombus tilings with fixed polyhedral boundaries. This dynamics is likely to be slowed down by so-called ``cycles'': such structures arise when tilings are encoded via the…
We investigate the relaxation problem and the diffusion phenomenon for the compressible Euler system with a time-dependent damping coefficient of the form $\tfrac{\mu}{(1+t)^{\lambda}}$ in $\mathbb{R}^d$ $(d \geq 1)$. We establish uniform…
In the standard formulation of the occupancy problem one considers the distribution of r balls in n cells, with each ball assigned independently to a given cell with probability 1/n. Although closed form expressions can be given for the…
We study nondeterministic and probabilistic versions of a discrete dynamical system (due to T. Antal, P. L. Krapivsky, and S. Redner) inspired by Heider's social balance theory. We investigate the convergence time of this dynamics on…
Primal-dual methods for solving convex optimization problems with functional constraints often exhibit a distinct two-stage behavior. Initially, they converge towards a solution at a sublinear rate. Then, after a certain point, the method…
In the first part of this work the classical and statistical aspects of the dynamics of an inextensible chain in three dimensions are investigated. In the second part the special case of a chain admitting only fixed angles with respect to…