Related papers: Solving the sextic by iteration: A study in comple…
In this paper we elucidate the advantage of examining the connections between Hilbert-Kamke equations and geometric designs, or Chebyshev-type quadrature, for classical orthogonal polynomials. We first establish that if a $5$-design with…
The computation of tunes and matched beam distributions are essential steps in the analysis of circular accelerators. If certain symmetries - like midplane symmetrie - are present, then it is possible to treat the betatron motion in the…
One can formulate the classical Kepler problem on the Heisenberg group, the simplest sub-Riemannian manifold. We take the sub-Riemannian Hamiltonian as our kinetic energy, and our potential is the fundamental solution to the Heisenberg…
The inherent self-consistency properties of the six-point multi-ratio equation allow it to be considered on a domain associated with a T-shaped Coxeter-Dynkin diagram. This extends the KP lattice, which has A_N symmetry, and incorporates…
A discrete conformal map (DCM) maps the square lattice to the Riemann sphere such that the image of every irreducible square has the same cross-ratio. This paper shows that every periodic DCM can be determined from spectral data (a…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
Piecewise smooth maps are known to exhibit a wide range of dynamical features including numerous types of periodic orbits. Predicting regions in parameter space where such periodic orbits might occur and determining their stability is…
We investigate two well known dynamical systems that are designed to find roots of univariate polynomials by iteration: the methods known by Newton and by Ehrlich-Aberth. Both are known to have found all roots of high degree polynomials…
This paper studies multistep methods for the integration of reversible dynamical systems, with particular emphasis on the planar Kepler problem. It has previously been shown by Cano & Sanz-Serna that reversible linear multisteps for…
Some aspects of phase transitions can be more conveniently studied in the orbit space of the action of the symmetry group. After a brief review of the fundamental ideas of this approach, I shall concentrate on the mathematical aspect and…
The goal of this note is to provide a recursive algorithm that allows one to calculate the expansion of the metric tensor up to the desired order in Riemann normal coordinates. We test our expressions up to fourth order and predict results…
We considered the most general form of non-static cylindrically symmetric space-times for studying proper curvature symmetry by using the rank of the 6X6 Riemann matrix and direct integration techniques. Studying proper curvature symmetry…
The kinetic term of the $N$-body Hamiltonian system defined on the surface of the sphere is non-separable. As a result, standard explicit symplectic integrators are inapplicable. We exploit an underlying hierarchy in the structure of the…
Two new approaches to solving first-order quasilinear elliptic systems of PDEs in many dimensions are proposed. The first method is based on an analysis of multimode solutions expressible in terms of Riemann invariants, based on links…
Renormalizations can be considered as building blocks of complex dynamical systems. This phenomenon has been widely studied for iterations of polynomials of one complex variable. Concerning non-polynomial hyperbolic rational maps, a recent…
Convex optimization is a well-established research area with applications in almost all fields. Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a…
In 1956, Bott in his celebrated paper on closed geodesics and Sturm intersection theory, proved an Index Iteration Formula for closed geodesics on Riemannian manifolds. Some years later, Ekeland improved this formula in the case of convex…
We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…
In this note, we review the notion of Painlev\'e scheme of the sixth Painlev\'e equation from the viewpoint of accessible singular point and its local index in the Hirzebruch surface of degree two ${\Sigma_2}$. The key method is Painlev\'e…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…