Related papers: Finding matched rms envelopes in rf linacs: A Hami…
This paper concentrates on optical Hamiltonian systems of $T*\T^n$, i.e. those for which $\Hpp$ is a positive definite matrix, and their relationship with symplectic twist maps. We present theorems of decomposition by symplectic twist maps…
Intrinsic isometric shape matching has become the standard approach for pose invariant correspondence estimation among deformable shapes. Most existing approaches assume global consistency, i.e., the metric structure of the whole manifold…
For a given a normally hyperbolic invariant manifold, whose stable and unstable manifolds intersect transversally, we consider several tools and techniques to detect trajectories with prescribed itineraries: the scattering map, the…
This paper investigated the problem of embedding a simple Hamiltonian Cycle with n vertices on n points inside a simple polygon. This problem seeks to embed a straight-line cycle (without bends), which does not intersect either itself or…
We evaluate the configuration exponents of various ensembles of Hamiltonian paths drawn on random planar bicubic maps. These exponents are estimated from the extrapolations of exact enumeration results for finite sizes and compared with…
We propose a homotopy method for solving mathematical programs with complementarity constraints (CCs). The indicator function of the CCs is relaxed by a Lasry-Lions double envelope, an extension of the Moreau envelope that enjoys an…
This paper proposes a local search algorithm for a specific combinatorial optimisation problem in graph theory: the Hamiltonian Completion Problem (HCP) on undirected graphs. In this problem, the objective is to add as few edges as possible…
In this paper we study a class of Riemannian metrics on the space of unparametrized curves and develop a method to compute geodesics with given boundary conditions. It extends previous works on this topic in several important ways. The…
This paper introduces a novel methodology that leverages the Hamilton-Jacobi solution to enhance non-linear model predictive control (MPC) in scenarios affected by navigational uncertainty. Using Hamilton-Jacobi-Theoretic approach, a…
The paper proposes a Riemannian Manifold Hamiltonian Monte Carlo sampler to resolve the shortcomings of existing Monte Carlo algorithms when sampling from target densities that may be high dimensional and exhibit strong correlations. The…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
We report the discovery of an envelope Hamiltonian describing the charged-particle dynamics in general linear coupled lattices.
We present a Monte Carlo method that allows efficient and unbiased sampling of Hamiltonian walks on a cubic lattice. Such walks are self-avoiding and visit each lattice site exactly once. They are often used as simple models of globular…
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…
Flux calibration of spectra in reverberation mapping (RM) is most often performed by assuming the flux constancy of some specified narrow emission lines, which stem from an extended region that is sometimes partially spatially resolved, in…
The Hamiltonian approach to isomonodromic deformation systems for generic rational covariant derivative operators on the Riemann sphere, having any matrix dimension $r$ and any number of isolated singularities of arbitrary Poincar\'e rank,…
Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…
Aggregation constraints, arising from geographical or sectoral division, frequently emerge in a large set of time series. Coherent forecasts of these constrained series are anticipated to conform to their hierarchical structure organized by…
Within a multi-channel formulation of $\pi\pi$ scattering, we investigate the use of the finite-volume Hamiltonian approach to resolve scattering observables from lattice QCD spectra. The asymptotic matching of the well-known L\"uscher…
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…