Related papers: Rigorous enclosures of rotation numbers by interva…
We propose a general framework for computer-assisted verification of the presence of symmetry breaking, period-tupling and touch-and-go bifurcations of symmetric periodic orbits for reversible maps. The framework is then adopted to…
A well-known problem in Algebraic Combinatorics, is the enumeration of circulant graphs. The failure of Adam's Conjecture for such graphs with order containing a repeated prime, led researchers to investigate the problem using two different…
This paper formalize the existence's proof of first-integrals for any second order ODE, allowing to discriminate periodic orbits. Up to the author's knowledge, such a powerful result is not available in the literature providing a tool to…
The aim of this chapter is to make a review of the recent results using the Enclosure Method on inverse obstacle problems governed by the wave equation and the Maxwell system in time domain. We also describe some of unsolved problems…
We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…
We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…
We compare the performance of several discretizations of the simple pendulum equation in a series of numerical experiments. The stress is put on the long-time behaviour. We choose for the comparison numerical schemes which preserve the…
We use the Circle Method to derive asymptotic formulas for functions related to the number of parts of partitions in particular residue classes.
This note presents a method to study center families of periodic orbits of complex holomorphic differential equations near singularities, based on some iteration properties of fixed point indices. As an application of this method, we will…
Due to manufacturing defects or wear and tear, industrial components may have uncertainties. In order to evaluate the performance of machined components, it is crucial to quantify the uncertainty of the scattering surface. This brings up an…
In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
This paper develops an efficient numerical method for the inverse scattering problem of a time-harmonic plane wave incident on a perfectly reflecting random periodic structure. The method is based on a novel combination of the Monte Carlo…
We provide escape rates formulae for piecewise expanding interval maps with `random holes'. Then we obtain rigorous approximations of invariant densities of randomly perturbed metabstable interval maps. We show that our escape rates…
The paper illustrates an application of the Resampling approach [2] for the estimation of the aircraft circulation plan reliability. Resampling is an intensive computer statistical method, which can be used effectively in the case of small…
We establish a set-oriented algorithm for the numerical approximation of the rotation set of homeomorphisms of the two-torus homotopic to the identity. A theoretical background is given by the concept of {\epsilon}-rotation sets. These are…
In this paper, we develop a high order numerical method for the numerical solutions of scattering problems with slightly perturbed periodic surfaces in two dimensional spaces. Based on the regularity property introduced in Part I, the…
We propose an approach to compute inner and outer-approximations of the sets of values satisfying constraints expressed as arbitrarily quantified formulas. Such formulas arise for instance when specifying important problems in control such…
We show that the coding of rotation by $\alpha$ on $m$ intervals with rationally independent lengths can be recoded over $m$ Sturmian words of angle $\alpha.$ More precisely, for a given $m$ an universal automaton is constructed such that…
I present a new and reliable method to test the numerical accuracy of NLO calculations based on modern OPP/Generalized Unitarity techniques. A convenient solution to rescue most of the detected numerically inaccurate points is also…
Given two regular graphs with consistent rotation maps, we produce a constructive method for a consistent rotation map on their Cartesian product. This method will be given as a simple set of rules of addition and table look ups. We assume…