Related papers: Nekhoroshev theory and discrete averaging
We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…
Based on the well-established theory of discrete conjugate nets in discrete differential geometry, we propose and examine discrete analogues of important objects and notions in the theory of semi-Hamiltonian systems of hydrodynamic type. In…
A space-discretization for the elastic flow of inextensible curves is devised and quasi-optimal convergence of the corresponding semi-discrete problem is proved for a suitable discretization of the nonlinear inextensibility constraint.…
We prove a non Archimedean Darboux's Theorem: any two symplectic forms on a $p$-adic analytic manifold are locally isomorphic. Understanding local problems such as the existence of flows or the normalization of singularities in the theory…
We reveal the symplectic nature of parameter-drift maps by embedding them into extended phase space. Applying the embedding to the parameter-drift standard nontwist map, our construction yields an autonomous symplectic map in extended phase…
This paper continues to carry out a foundational study of Banyaga topologies of a closed symplectic manifold [3]. Our intension in writing this paper is to provide several symplectic analogues of some results found in the study of…
A new geometric procedure to construct symplectic methods for constrained mechanical systems is developed in this paper. The definition of a map coming from the notion of retraction maps allows to adapt the continuous problem to the…
In this paper we prove the existence of an almost invariant symplectic slow manifold for analytic Hamiltonian slow-fast systems with finitely many slow degrees of freedom for which the error field is exponentially small. We allow for…
We consider a class of piecewise smooth one-dimensional maps with critical points and singularities (possibly with infinite derivative). Under mild summability conditions on the growth of the derivative on critical orbits, we prove the…
We prove the existence of infinitely many periodic orbits of symplectomorphisms isotopic to the identity if they admit at least one hyperbolic periodic orbit and satisfy some condition on the flux. Our result is proved for a certain class…
Perturbations due to round-off errors in computer modeling are discontinuous and therefore one cannot use results like KAM theory about smooth perturbations of twist maps. We elaborate a special approximation scheme to construct two smooth…
We propose a new analyzing method, which is called the tautological flow method, to analyze the integrability of partial difference equations (P$\Delta$Es) based on that of partial differential equations (PDEs). By using this method, we…
A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…
Given an orthogonal lattice with mesh length h on a bounded convex domain, we propose to approximate the Aleksandrov solution of the Monge-Ampere equation by regularizing the data and discretizing the equation in a subdomain using the…
The slow drift along a manifold of periodic orbits is a key mathematical structure underlying bursting dynamics in many scientific applications. While classical averaging theory, as formalised by the Pontryagin-Rodygin theorem, provides a…
We develop a computationally tractable method for estimating the optimal map between two distributions over $\mathbb{R}^d$ with rigorous finite-sample guarantees. Leveraging an entropic version of Brenier's theorem, we show that our…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
We propose a finite volume stochastic collocation method for the random Euler system. We rigorously prove the convergence of random finite volume solutions under the assumption that the discrete differential quotients remain bounded in…
Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…
In the first part of the paper the natural scheme for proving noncommutative individual ergodic theorems for multiple sequences is described and applied to obtain results on unrestricted convergence of multiaverages. In the second part…