Local time and first return time for periodic semi-flows

We study Z^d-periodic semi-flows, which are versions in continuous time of Z^d-extensions of dynamical systems. These systems are defined by an underlying dynamical system, a step time (the time to wait before the system makes a move), and a step function (the displacement in Z^d at each step). We are interested in two statistics related to these semi-flows: the local time, i.e., the time spent in some subset, and the first return time to the origin. We get some partial results under spectral conditions on the transfer operator of the underlying dynamical system. If the underlying dynamics is Gibbs–Markov, and under additional constraints on the step time and step function, we get distributional asymptotics for the local time, and an equivalent of the tail of the first return time.     

Cardinality of the Ellis semigroup on compact metric countable spaces

Let E(X, f) be the Ellis semigroup of a dynamical system (X, f) where X is a compact metric space. We analyze the cardinality of E(X, f) for a compact countable metric space X. A characterization when E(X, f) and \(E(X,f)^* = E(X,f) \setminus \{ f^n : n \in \mathbb {N}\}\) are both finite is given. We show that if the collection of all periods of the periodic points of (X, f) is infinite, then E(X, f) has size \(2^{\aleph _0}\). It is also proved that if (X, f) has a point with a dense orbit and all elements of E(X, f) are continuous, then \(|E(X,f)| \le |X|\). For dynamical systems of the form \((\omega ^2 +1,f)\), we show that if there is a point with a dense orbit, then all elements of \(E(\omega ^2+1,f)\) are continuous functions. We present several examples of dynamical systems which have a point with a dense orbit. Such systems provide examples where \(E(\omega ^2+1,f)\) and \(\omega ^2+1\) are homeomorphic but not algebraically homeomorphic, where \(\omega ^2+1\) is taken with the usual ordinal addition as semigroup operation.     

Iterative roots of multidimensional operators and applications to dynamical systems

Solutions φ(x) of the functional equation φ(φ(x)) = f (x) are called iterative roots of the given function f (x). They are of interest in dynamical systems, chaos and complexity theory and also in the modeling of certain industrial and financial processes. The problem of computing this “square root” of a function or operator remains a hard task. While the theory of functional equations provides some insight for real and complex valued functions, iterative roots of nonlinear mappings from \({\mathbb{R}^n}\) to \({\mathbb{R}^n}\) are less studied from a theoretical and computational point of view. Here we prove existence of iterative roots of a certain class of monotone mappings in \({\mathbb{R}^n}\) spaces and demonstrate how a method based on neural networks can find solutions to some examples that arise from simple physical dynamical systems.     

Optimal Disturbances of Bistable Time-Delay Systems Modeling Virus Infections

For bistable time-delay dynamical systems modeling the dynamics of viral infections and the virusinduced immune response, an efficient approach is proposed for constructing optimal disturbances of steady states with a high viral load that transfer the system to a state with a low viral load. Functions approximating the behavior of drugs within the framework of well-known pharmacokinetic models are used as basis functions. Optimal disturbances are sought in the W ₂ ¹ norm. It is shown that optimal disturbances found in this norm are superior to those found in the L₂ norm as applied to the development of adequate therapeutic strategies.     

Duality and monodromy reducibility of <Emphasis Type="Italic">A</Emphasis>-hypergeometric systems

We study hypergeometric systems H _A (β) in the sense of Gelfand, Kapranov and Zelevinsky under two aspects: the structure of their holonomically dual system, and reducibility of their rank module. We prove in the first part that rank-jumping parameters always correspond to reducible systems. We show further that the property of being reducible is “invariant modulo the lattice”, and obtain as a special instance a theorem of Alicia Dickenstein and Timur Sadykov on reducibility of Mellin systems. In the second part we study a conjecture of Nobuki Takayama which states that the holonomic dual of H _A (β) is of the form H _A (β′) for suitable β′. We prove the conjecture for all matrices A and generic parameter β, exhibit an example that shows that in general the conjecture cannot hold, and present a refined version of the conjecture. Questions on both duality and reducibility have been quite difficult to answer with classical methods. This paper may be seen as an example of the usefulness, and scope of applications, of the homological tools for A-hypergeometric systems developed in Matusevich et al. (J. Amer. Math. Soc. 18:919–941, 2005)     

On variable step Hermite–Birkhoff solvers combining multistep and 4-stage DIRK methods for stiff ODEs

Variable-step (VS) 4-stage k-step Hermite–Birkhoff (HB) methods of order p = (k + 2), p = 9, 10, denoted by HB (p), are constructed as a combination of linear k-step methods of order (p ? 2) and a diagonally implicit one-step 4-stage Runge–Kutta method of order 3 (DIRK3) for solving stiff ordinary differential equations. Forcing a Taylor expansion of the numerical solution to agree with an expansion of the true solution leads to multistep and Runge–Kutta type order conditions which are reorganized into linear confluent Vandermonde-type systems. This approach allows us to develop L(a)-stable methods of order up to 11 with a > 63°. Fast algorithms are developed for solving these systems in O (p²) operations to obtain HB interpolation polynomials in terms of generalized Lagrange basis functions. The stepsizes of these methods are controlled by a local error estimator. HB(p) of order p = 9 and 10 compare favorably with existing Cash modified extended backward differentiation formulae of order 7 and 8, MEBDF(7-8) and Ebadi et al. hybrid backward differentiation formulae of order 10 and 12, HBDF(10-12) in solving problems often used to test higher order stiff ODE solvers on the basis of CPU time and error at the endpoint of the integration interval.     

Möbius disjointness for models of an ergodic system and beyond

Given a topological dynamical system (X, T) and an arithmetic function u: ? → ?, we study the strong MOMO property (relatively to u) which is a strong version of u-disjointness with all observable sequences in (X, T). It is proved that, given an ergodic measure-preserving system (Z, \(\mathcal{D}\), к, R),the strong MOMO propertly (relately to u) of a uniquely ergodic midel (X, T)of R yields all other uniquely ergodic midel of R to be u-disjiont. It follows that all uniquely ergodic models of: ergodic unipotent diffeomorphisms on nilmanifolds, discrete spectrum automorphisms, systems given by some substitutions of constant length (including the classical Thue—Viorse and Rudin—Shapiro substitutions), systems determined by Kakutani sequences are Möbius (and Liouville) disjoint. The validity of Sarnak5s conjecture implies the strong MOMO property relatively to μ in all zero entropy systems; in particular, it makes μ-disjointness uniform. The absence of the strong MOMO property in positive entropy systems is discussed and it is proved that, under the Chowla conjecture, a topological system has the strong MOMO property relatively to the Liouville function if and only if its topological entropy is zero.     

Operator renewal theory and mixing rates for dynamical systems with infinite measure

We develop a theory of operator renewal sequences in the context of infinite ergodic theory. For large classes of dynamical systems preserving an infinite measure, we determine the asymptotic behaviour of iterates L ⁿ of the transfer operator. This was previously an intractable problem.Examples of systems covered by our results include (i) parabolic rational maps of the complex plane and (ii) (not necessarily Markovian) nonuniformly expanding interval maps with indifferent fixed points.In addition, we give a particularly simple proof of pointwise dual ergodicity (asymptotic behaviour of \(\sum_{j=1}^{n}L^{j}\)) for the class of systems under consideration.In certain situations, including Pomeau-Manneville intermittency maps, we obtain higher order expansions for L ⁿ and rates of mixing. Also, we obtain error estimates in the associated Dynkin-Lamperti arcsine laws.     

Short cycles in repeated exponentiation modulo a prime

Given a prime p, we consider the dynamical system generated by repeated exponentiations modulo p, that is, by the map \({u \mapsto f_g(u)}\), where f _g (u) ≡ g ^u (mod p) and 0 ≤ f _g (u) ≤ p ? 1. This map is in particular used in a number of constructions of cryptographically secure pseudorandom generators. We obtain nontrivial upper bounds on the number of fixed points and short cycles in the above dynamical system.     

Sum-free sets in abelian groups

An IP system is a functionn taking finite subsets ofN to a commutative, additive group Ω satisfyingn(α∪β)=n(α)+n(β) whenever α∩β=ø. In an extension of their Szemerédi theorem for finitely many commuting measure preserving transformations, Furstenberg and Katznelson showed that ifS _i ,1≤i≤k, are IP systems into a commutative (possibly infinitely generated) group Ω of measure preserving transformations of a probability space (X, B, μ, andA∈B with μ(A)>0, then for some ø≠α one has μ(? _i=1 ^k S _i({α})A>0). We extend this to so-called FVIP systems, which are polynomial analogs of IP systems, thereby generalizing as well joint work by the author and V. Bergelson concerning special FVIP systems of the formS(α)=T(p(n(α))), wherep:Z ^t →Z ^d is a polynomial vanishing at zero,T is a measure preservingZ ^d action andn is an IP system intoZ ^t . The primary novelty here is potential infinite generation of the underlying group action, however there are new applications inZ ^d as well, for example multiple recurrence along a wide class ofgeneralized polynomials (very roughly, functions built out of regular polynomials by iterated use of the greatest integer function).     

New class of hybrid BDF methods for the computation of numerical solutions of IVPs

A new class of hybrid BDF-like methods is presented for solving systems of ordinary differential equations (ODEs) by using the second derivative of the solution in the stage equation of class 2 + 1hybrid BDF-like methods to improve the order and stability regions of these methods. An off-step point, together with two step points, has been used in the first derivative of the solution, and the stability domains of the new methods have been obtained by showing that these methods are A-stable for order p, p =?3,4,5,6,7and A(α)-stable for order p, 8 ≤ p ≤?14. The numerical results are also given for four test problems by using variable and fixed step-size implementations.     

Parametric AE-solution sets to the parametric linear systems with multiple right-hand sides and parametric matrix equation A(p)X = B(p)

In this paper, the parametric matrix equation A(p)X = B(p) whose elements are linear functions of uncertain parameters varying within intervals are considered. In this matrix equation A(p) and B(p) are known m-by-m and m-by-n matrices respectively, and X is the m-by-n unknown matrix. We discuss the so-called AE-solution sets for such systems and give some analytical characterizations for the AE-solution sets and a sufficient condition under which these solution sets are bounded. We then propose a modification of Krawczyk operator for parametric systems which causes reduction of the computational complexity of obtaining an outer estimation for the parametric united solution set, considerably. Then we give a generalization of the Bauer-Skeel and the Hansen-Bliek-Rohn bounds for enclosing the parametric united solution set which also enables us to reduce the computational complexity, significantly. Also some numerical approaches based on Gaussian elimination and Gauss-Seidel methods to find outer estimations for the parametric united solution set are given. Finally, some numerical experiments are given to illustrate the performance of the proposed methods.     

The critical boundary RSOS <Emphasis Type="Italic">M</Emphasis>(3,5) model

We consider the critical nonunitary minimal model M(3, 5) with integrable boundaries and analyze the patterns of zeros of the eigenvalues of the transfer matrix and then determine the spectrum of the critical theory using the thermodynamic Bethe ansatz (TBA) equations. Solving the TBA functional equation satisfied by the transfer matrices of the associated A₄restricted solid-on-solid Forrester–Baxter lattice model in regime III in the continuum scaling limit, we derive the integral TBA equations for all excitations in the (r, s) = (1, 1) sector and then determine their corresponding energies. We classify the excitations in terms of (m, n) systems.     

Implicit differential equations with impasse singularities and singular perturbation problems

This paper concerns families of constrained differential systems having the form {fx1-1} where h: ? ⁿ → ? is a C ^r -function, (α ₁, …, α _n ) is a C ^r vector field on ? ⁿ , r ≥ 1, x ∈ ? ⁿ and λ is a real parameter. Using singular perturbation techniques we present some results on the dynamics of the system around a point (x, λ) of the impasse set λ = h(x). In addition, planar constrained systems with non-regular impasse surfaces are considered.     

Trigonometrical fitting conditions for two derivative Runge-Kutta methods

Two derivative Runge-Kutta methods are Runge-Kutta methods for problems of the form y^′ = f(y) that include the second derivative y^″ = g(y) = f^′(y)f(y) and were developed in the work of Chan and Tsai (Numer. Alg. 53, 171–194 2010). Explicit methods were considered and attention was given to the construction of methods that involve one evaluation of f and many evaluations of g per step. In this work, we consider trigonometrically fitted two derivative explicit Runge-Kutta methods of the general case that use several evaluations of f and g per step; trigonometrically fitting conditions for this general case are given. Attention is given to the construction of methods that involve several evaluations of f and one evaluation of g per step. We modify methods with stages up to four, with three f and one g evaluation and with four f and one g, evaluation based on the fourth and fifth order methods presented in Chan and Tsai (Numer. Alg. 53, 171–194 2010). We provide numerical results to demonstrate the efficiency of the new methods using four test problems.     

Error estimates of numerical methods for the nonlinear Dirac equation in the nonrelativistic limit regime

We present several numerical methods and establish their error estimates for the discretization of the nonlinear Dirac equation(NLDE) in the nonrelativistic limit regime, involving a small dimensionless parameter 0 ε≤ 1 which is inversely proportional to the speed of light. In this limit regime, the solution is highly oscillatory in time, i.e., there are propagating waves with wavelength O(ε~2) and O(1) in time and space,respectively. We begin with the conservative Crank-Nicolson finite difference(CNFD) method and establish rigorously its error estimate which depends explicitly on the mesh size h and time step τ as well as the small parameter 0 ε≤ 1. Based on the error bound, in order to obtain ‘correct' numerical solutions in the nonrelativistic limit regime, i.e., 0 ε■ 1, the CNFD method requests the ε-scalability: τ = O(ε~3) and h= O(ε~(1/2)). Then we propose and analyze two numerical methods for the discretization of NLDE by using the Fourier spectral discretization for spatial derivatives combined with the exponential wave integrator and timesplitting technique for temporal derivatives, respectively. Rigorous error bounds for the two numerical methods show that their ε-scalability is improved to τ = O(ε~2) and h = O(1) when 0 ε■1. Extensive numerical results are reported to confirm our error estimates.     

Synthesis of minimum-order robust inverters

In the present paper, we consider the inversion problem for dynamical systems, that is, the problem of reconstruction of the unknown input signal ξ(t) of a given system on the basis of known information (about either the complete phase vector or a measurable output of the system). An auxiliary dynamical system forming the desired estimate of the signal ξ(t) is called an inverter.In earlier papers of the authors, attention was mainly paid to the possibility of inversion of a dynamical system in different cases in principle. In this relation, a model of dynamical systems with some stabilizing control was used as an inverter for the solution of the problem; moreover, this control was often designed with the use of an additional dynamical system, an observer of the phase vector of the original system or the system in deviations. Thus, a dynamical system whose dimension either coincides with the dimension of the original system or exceeds it was considered as an inverter.In the solution of practical problems, it is often required to synthesize inverters of minimal order. (This requirement is related to constraints on the complexity, cost, and operation speed of automated control systems.) In the present paper, we consider the problem on the possible reduction of the order of the inverter in various cases and the problem on the construction of inverters of minimal order.     

Lower Bounds for the Degree of a Branched Covering of a Manifold

The problem of finding new lower bounds for the degree of a branched covering of a manifold in terms of the cohomology rings of this manifold is considered. This problem is close to M. Gromov’s problem on the domination of manifolds, but it is more delicate. Any branched (finite-sheeted) covering of manifolds is a domination, but not vice versa (even up to homotopy). The theory and applications of the classical notion of the group transfer and of the notion of transfer for branched coverings are developed on the basis of the theory of n-homomorphisms of graded algebras.The main result is a lemma imposing conditions on a relationship between the multiplicative cohomology structures of the total space and the base of n-sheeted branched coverings of manifolds and, more generally, of Smith–Dold n-fold branched coverings. As a corollary, it is shown that the least degree n of a branched covering of the N-torus T ^N over the product of k 2-spheres and one (N ? 2k)-sphere for N ≥ 4k + 2 satisfies the inequality n ≥ N ? 2k, while the Berstein–Edmonds well-known 1978 estimate gives only n ≥ N/(k + 1).