相关论文: Solving the sextic by iteration: A study in comple…

Studying 2 degree-of-freedom (DOF) Hamiltonian dynamical systems often involves the computation of stable & unstable manifolds of periodic orbits, due to the homoclinic & heteroclinic connections they can generate. Such study is generally…

We present a systematic methodology to determine and locate analytically isolated periodic points of discrete and continuous dynamical systems with algebraic nature. We apply this method to a wide range of examples, including a…

We propose a stochastic variance-reduced cubic regularized Newton algorithm to optimize the finite-sum problem over a Riemannian submanifold of the Euclidean space. The proposed algorithm requires a full gradient and Hessian update at the…

We show that a rectangle triangle random tiling with a tenfold symmetric phase is solvable by Bethe Ansatz. After the twelvefold square triangle and the eightfold rectangle triangle random tiling, this is the third example of a rectangle…

In these lectures three different methods of computing the asymptotic expansion of a Hermitian matrix integral is presented. The first one is a combinatorial method using Feynman diagrams. This leads us to the generating function of the…

These notes were written during the 9th and 10th sessions of the subject Dynamical Systems II coursed at DTU (Denmark) during the Winter Semester 2015-2016, and later extended in February 2017. They aim to provide students with a…

We investigate classical and quantum physics-based algorithms for solving the graph isomorphism problem. Our work integrates and extends previous work by Gudkov et al. (cond-mat/0209112) and by Rudolph (quant-ph/0206068). Gudkov et al.…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…

We study real solutions of a class of Painleve VI equations. To each such solution we associate a geometric object, a one-parametric family of circular pentagons. We describe an algorithm which permits to compute the numbers of zeros,…

The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…

We introduce a new family of numerical algorithms for approximating solutions of general high-dimensional semilinear parabolic partial differential equations at single space-time points. The algorithm is obtained through a delicate…

In this paper, we introduce and study a class of resolvent dynamical systems to investigate some inertial proximal methods for solving mixed variational inequalities. These proposed methods along with their discretizations and derived rates…

The techniques and analysis presented in this paper provide new methods to solve optimization problems posed on Riemannian manifolds. A new point of view is offered for the solution of constrained optimization problems. Some classical…

Every regular map on a closed surface gives rise to generally six regular maps, its "Petrie relatives", that are obtained through iteration of the duality and Petrie operations (taking duals and Petrie-duals). It is shown that the skeletal…

We study the cohomology and hence $K$-theory of the aperiodic tilings formed by the so called 'cut and project' method, i.e., patterns in $d$ dimensional Euclidean space which arise as sections of higher dimensional, periodic structures.…

Energy evaluation using fast Fourier transforms enables sampling billions of putative complex structures and hence revolutionized rigid protein-protein docking. However, in current methods efficient acceleration is achieved only in either…

We study moduli spaces of meromorphic connections (with arbitrary order poles) over Riemann surfaces together with the corresponding spaces of monodromy data (involving Stokes matrices). Natural symplectic structures are found and described…

The Sanathanan-Koerner iteration developed in 1963 is classical approach for rational approximation. This approach multiplies both sides of the approximation by the denominator polynomial yielding a linear problem and then introduces a…

We present an algorithm for determining the minimal order differential equations associated to a given Feynman integral in dimensional or analytic regularisation. The algorithm is an extension of the Griffiths-Dwork pole reduction adapted…

In \cite{NZ25}, the authors resolved the rational function analogue of the finiteness results for greatest common divisors of iterates of polynomials established in \cite{HT17}. These results may be viewed as dynamical generalizations of a…