Related papers: Rigorous numerics for critical orbits in the quadr…
In this paper, a new rigorous numerical method to compute fundamental matrix solutions of non-autonomous linear differential equations with periodic coefficients is introduced. Decomposing the fundamental matrix solutions $\Phi(t)$ by their…
A family of periodic orbits is proven to exist in the spatial lunar problem that are continuations of a family of consecutive collision orbits, perpendicular to the primary orbit plane. This family emanates from all but two energy values.…
We prove that transport in the phase space of the "most strongly chaotic" dynamical systems has three different stages. Consider a finite Markov partition (coarse graining) $\xi$ of the phase space of such a system. In the first short times…
The finest state space resolution that can be achieved in a physical dynamical system is limited by the presence of noise. In the weak-noise approximation the neighborhoods of deterministic periodic orbits can be computed as distributions…
We prove the finiteness of the Zsigmondy set associated to the critical orbit of f(z) = z^d+c for rational values of c by finding an effective bound on the size of the set. For non-recurrent critical orbits, the Zsigmondy set is explicitly…
A new deterministic floating-point arithmetic called precision arithmetic is developed to track precision for arithmetic calculations. It uses a novel rounding scheme to avoid excessive rounding error propagation of conventional…
This paper investigates the qualitative behavior of a system of ordinary differential equations (ODEs) defined by a matrix operator derived from the algebraic structure of the Alpha Group. The system depends on a rotational parameter that…
The problem of finding the longest simple cycle in a directed graph is NP-hard, with critical applications in computational biology, scheduling, and network analysis. Existing approaches include exact algorithms with exponential runtimes,…
We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…
This work develops a comprehensive algorithm and a Mathematica program to construct boundary data and compute real and complex critical points in spinfoam amplitudes. Our approach covers both spacelike tetrahedra and triangles in the EPRL…
From a dynamical viewpoint, basic phase transitions of statistical mechanics can be regarded as a breaking of ergodicity. While many random models exhibiting such transitions at the thermodynamics limit exist, finite-dimensional examples…
The geometric phase can act as a signature for critical regions of interacting spin chains in the limit where the corresponding circuit in parameter space is shrunk to a point and the number of spins is extended to infinity; for finite…
This paper generalizes a previously-conceived, continuation-based optimization technique for scalar objective functions on constraint manifolds to cases of periodic and quasiperiodic solutions of delay-differential equations. A Lagrange…
We study the spectra of operators on periodic graphs using methods from combinatorial algebraic geometry. Our main result is a bound on the number of complex critical points of the Bloch variety, together with an effective criterion for…
In this paper we consider a one dimensional liner piecewise-smooth discontinuous map. It is well known that stable periodic orbits exist in this type of map for a specific parameter region. It is also known that the corresponding…
The safety region of operation of a system is the subset of allowed outputs for which no undesirable outcome would occur. Knowing if a system would ever leave its safety regions of operation is important information for the planning and…
This work provides a framework to compute an upper bound on the robust peak-to-peak gain of discrete-time uncertain linear systems using integral quadratic constraints (IQCs). Such bounds are of particular interest in the computation of…
Let $K$ be a global function field of characteristic $p$ and degree $D$ over $\mathbb F_{p}(t)$. We consider dynamical systems over the projective line $\mathbb P^1(K)$ defined by rational maps with at most one prime of bad reduction. The…
Traditionally, Probability theory was dealing with limit theorems where 'limit" means that time tends to infinity. Questions about finite time dynamics (evolution) were always considered as, although important for practical applications,…
Using methods from symplectic geometry, the second and fifth authors have provided theoretical groundwork and tools aimed at analyzing periodic orbits, their stability and their bifurcations in families, for the purpose of space mission…