No abstract uploaded!

Data-based detection and quantification of causation in complex, nonlinear dynamical systems is of paramount importance to science, engineering, and beyond. Inspired by the widely used methodology in recent years, the cross-map-based techniques, we develop a general framework to advance towards a comprehensive understanding of dynamical causal mechanisms, which is consistent with the natural interpretation of causality. In particular, instead of measuring the smoothness of the cross-map as conventionally implemented, we define causation through measuring the scaling law for the continuity of the investigated dynamical system directly. The uncovered scaling law enables accurate, reliable, and efficient detection of causation and assessment of its strength in general complex dynamical systems, outperforming those existing representative methods. The continuity scaling-based framework is rigorously established and demonstrated using datasets from model complex systems and the real world.

We extend two results about the ordinary continued fraction expansion to best simultaneous Diophantine approximations of vectors or matrices. The first is Levy-Khintchin Theorem about the almost sure growth rate of the denominators of the convergents. The second is a Theorem of Bosma, Hendrik and Wiedijk about the almost sure limit distribution of the sequence of products q_n d(q_n θ,Z) where the qn's are the denominators of the convergents associated with the real number θ by the ordinary continued fraction algorithm. Beside these two main results, we show that when d≥2, for almost all vectors θ∈R^d, lim inf_{n→∞} q_{n+k} d(q_n θ,Z^d)=0 for all positive integers k, where (q_n)_{n∈N} is the sequence of best approximation denominators of θ.

We study the effective fronts of first order front propagations in two dimensions (n=2) in the periodic setting. Using PDE-based approaches, we show that for every α∈(0,1), the class of centrally symmetric polygons with rational vertices and nonempty interior is admissible as effective fronts for given front speeds in C^{1,α}(T^2,(0,∞)). This result can also be formulated in the language of stable norms corresponding to periodic metrics in T^2. Similar results were known long time ago when n≥3 for front speeds in C^∞(T^n,(0,∞)). Due to topological restrictions, the two dimensional case is much more subtle. In fact, the effective front is C^1, which cannot be a polygon, for given C^{1,1}(T^2,(0,∞)) front speeds. Our regularity requirements on front speeds are hence optimal. To the best of our knowledge, this is the first time that polygonal effective fronts have been constructed in two dimensions.

We study the periodic homogenization of first order front propagations. Based on PDE methods, we provide a simple proof that, for n ≥ 3, the class of centrally symmetric polytopes with rational coordinates and nonempty interior is admissible as effective fronts, which was also established by I. Babenko and F. Balacheff [Sur la forme de la boule unit\'e de la norme stable unidimensionnelle, Manuscripta Math. 119 (2006) 347--358] and M. Jotz [Hedlund metrics and the stable norm, Diff. Geometry Appl. 27 (2009) 543--550] in the form of stable norms as an extension of G. A. Hedlund's classical result [Geodesics on a two-dimensional Riemannian manifold with periodic coefficients, Ann. Math. 33 (1932) 719--739]. Besides, we obtain the optimal convergence rate of the homogenization problem for this class.

We investigate Sarnak's M\"obius Disjointness Conjecture through asymptotically periodic functions. It is shown that Sarnak's conjecture for rigid dynamical systems is equivalent to the disjointness of M\"obius from asymptotically periodic functions. We give sufficient conditions and a partial answer to the later one. As an application, we show that Sarnak's conjecture holds for a class of rigid dynamical systems, which improves an earlier result of Kanigowski-Lema{\'{n}}czyk-Radziwi{\l}{\l}.

A vast class of exponential functions are shown to be deterministic. This class includes functions whose exponents are polynomial-like or ``piece-wise'' close to polynomials after differentiation. Many of these functions are proved to be disjoint from the M\"obius function.

To study arithmetic structures of natural numbers, we introduce a notion of entropy of arithmetic functions, called anqie entropy. This entropy possesses some crucial properties common to both Shannon's and Kolmogorov's entropies. We show that all arithmetic functions with zero anqie entropy form a C*-algebra. Its maximal ideal space defines our arithmetic compactification of natural numbers, which is totally disconnected but not extremely disconnected. We also compute the $K$-groups of the space of all continuous functions on the arithmetic compactification. As an application, we show that any topological dynamical system with topological entropy $\lambda$, can be approximated by symbolic dynamical systems with entropy less than or equal to $\lambda$.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

Consider a perturbed KdV equation: ut +uxxx −6uux = εf(u(·)), x ∈ T = R/Z, where the nonlinear perturbation defines analytic operators u(·) 􏰀→ f(u(·)) in sufficiently smooth Sobolev spaces. Assume that the equation has an ε-quasi- invariant measure μ and satisfies some additional mild assumptions. Let uε(t) be a solution. Then on time intervals of order ε−1, as ε → 0, its actions I(uε(t,·)) can be approximated by solutions of a certain well-posed averaged equation, provided that the initial datum is μ-typical.

No abstract uploaded!

In this paper we discuss properties of the KdV equation under periodic boundary conditions, especially those which are important to study perturbations of the equation. Next we review what is known now about long-time behaviour of solutions for perturbed KdV equations.

We examine the convergence in the Krylov–Bogolyubov averaging for nonlinear stochastic perturbations of linear PDEs with pure imaginary spectrum and show that if the involved effective equation is mixing, then the convergence is uniform in time.

Consider a system of periodic pendulum lattice with analytic weak coupling: i x ̈i +sinxi =−ε 􏰀 ∂xiβα(xj,xj+1,xj+2), xi =xi+N, i∈Z, j =i−2 where N 􏰃 3 is an integer, ε > 0 is a small parameter and the function βα is an analytic function of a certain form. It is shown in this paper that for small enough ε, the system admits motions such that the energy transfers between the pendulums in any predetermined order.

We consider a damped/driven nonlinear Schr\"odinger equation in an $n$-cube $K^{n}\subset\mathbb{R}^n$, $n\in\mathbb{N}$, under Dirichlet boundary conditions \[ u_t-\nu\Delta u+i|u|^2u=\sqrt{\nu}\eta(t,x),\quad x\in K^{n},\quad u|_{\partial K^{n}}=0, \quad \nu>0, \] where $\eta(t,x)$ is a random force that is white in time and smooth in space. It is known that the Sobolev norms of solutions satisfy $ \| u(t)\|_m^2 \le C\nu^{-m}, $ uniformy in $t\ge0$ and $\nu>0$. In this work we prove that for small $\nu>0$ and any initial data, with large probability the Sobolev norms $\|u(t,\cdot)\|_m$ of the solutions with $m>2$ become large at least to the order of $\nu^{-\kappa_{n,m}}$ with $\kappa_{n,m}>0$, on time intervals of order $\mathcal{O}(\frac{1}{\nu})$.

No abstract uploaded!

No abstract uploaded!

To derive the hidden dynamics from observed data is one of the fundamental but also challenging problems in many different fields. In this study, we propose a new type of interpretable network called the ordinary differential equation network (ODENet), in which the numerical integration of explicit ordinary differential equations (ODEs) are embedded into the machine learning scheme to build a general framework for revealing the hidden dynamics buried in massive time-series data efficiently and reliably. ODENet takes full advantage of both machine learning algorithms and ODE modeling. On one hand, the embedding of ODEs makes the framework more interpretable benefiting from the mature theories of ODEs. On the other hand, the schemes of machine learning enable data handling, paralleling, and optimization to be easily and efficiently implemented. From classical Lotka-Volterra equations to chaotic Lorenz equations, the ODENet exhibits its remarkable capability in handling time-series data even in the presence of large noise. We further apply the ODENet to real actin aggregation data, which shows an impressive performance as well. These results demonstrate the superiority of ODENet in dealing with noisy data, data with either non-equal spacing or large sampling time steps over other traditional machine learning algorithms.

For a random walk on a finitely generated group G we obtain a generalization of a classical inequality of Ancona. We deduce as a corollary that the identity map on G extends to a continuous equivariant surjection from the Martin boundary to the Floyd boundary, with preimages of conical points being singletons. This provides new results for Martin compactifications of relatively hyperbolic groups.

Let S be a compact, orientable surface of hyperbolic type and let ψ be a mapping class of S. The present article shows that there exists a finite cover X of S and a lift ψ_X of ψ to X such that the spectral radius of ψ_X, viewed as an automorphism of H_1(X,C), is greater than one if and only if ψ has infinite order and is not a Dehn multitwist. Among the corollaries of this result is the fact that a compact, irreducible 3-manifold with toroidal or empty boundary and positive simplicial volume admits a finite cover for which the multivariable Alexander polynomial is not identically zero and has Mahler measure strictly greater than one; such a manifold also admits a finite cover whose integral first homology has nontrivial torsion. An independent proof of the main result of this paper was given by A. Hadari [Geom. Topol. 24 (2020), no. 4, 1717–1750; MR4173920]. In that paper, the surface was assumed to have at least one boundary component, but stronger control over the required finite covers was obtained.

Let f be a holomorphic automorphism of a compact Kähler manifold. Assume that f admits a unique maximal dynamic degree d_p with only one eigenvalue of maximal modulus. Let μ be its equilibrium measure. In this paper, we prove that μ is exponentially mixing for all d.s.h. test functions.

The classical Morse theory proceeds by considering sublevel sets f^{−1}(−∞,a] of a Morse function f:M→R, where M is a smooth finite-dimensional manifold. In this paper, we study the topology of the level sets f^{−1}(a) and give conditions under which the topology of f^{−1}(a) changes when passing a critical value. We show that for a general class of functions, which includes all exhaustive Morse functions, the topology of a regular level f^{−1}(a) always changes when passing a single critical point, unless the index of the critical point is half the dimension of the manifold M. When f is a natural Hamiltonian on a cotangent bundle, we obtain more precise results in terms of the topology of the base space. (Counter-)examples and applications to celestial mechanics are also discussed.

We give an example of a dominant rational self-map of the projective plane whose dynamical degree is a transcendental number.