Related papers: A Linearly-growing Conversion from the Set Splitti…
We propose a non-autoregressive framework for the Travelling Salesman Problem where solutions emerge directly from learned permutations, without requiring explicit search. By applying a similarity transformation to Hamiltonian cycles, the…
By the method of discrete transformation equations of 3-th wave hierarchy are constructed. We present in explicit form two Poisson structures, which allow to construct Hamiltonian operator consequent application of which leads to all…
We consider the problem of finding a Hamiltonian path or a Hamiltonian cycle with precedence constraints in the form of a partial order on the vertex set. We show that the path problem is $\mathsf{NP}$-complete for graphs of pathwidth 4…
Adaptive Molecular Resolution approaches in Molecular Dynamics are becoming relevant tools for the analysis of molecular liquids characterized by the interplay of different physical scales. The essential difference among these methods is in…
We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a…
Let a stick be broken at random at n-1 points to form n pieces. We consider three problems on forming k-gons with k out of these n pieces, and show how a statistical approach, through a linear transformation of variables, yields simple…
We extend some aspects of the Hamilton-Jacobi theory to the category of stochastic Hamiltonian dynamical systems. More specifically, we show that the stochastic action satisfies the Hamilton-Jacobi equation when, as in the classical…
In this paper we consider splitting methods for the time integration of parabolic and certain classes of hyperbolic partial differential equations, where one partial flow can not be computed exactly. Instead, we use a numerical…
We compute the normal forms for the Hamiltonian leading to the epicyclic approximations of the (perturbed) Kepler problem in the plane. The Hamiltonian setting corresponds to the dynamics in the Hill synodic system where, by means of the…
The singularity structure of solutions of a class of Hamiltonian systems of ordinary differential equations in two dependent variables is studied. It is shown that for any solution, all movable singularities, obtained by analytic…
In this paper we address the complexity of solving linear programming problems with a set of differential equations that converge to a fixed point that represents the optimal solution. Assuming a probabilistic model, where the inputs are…
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no known algorithm to solve it in polynomial time. There exists…
A supergrid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional supergrid. The supergrid graphs contain grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle problem for grid and…
Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo…
We consider a many-fermion model which exhibits a transition from a superconducting to a rotational phase with variation of a parameter in its Hamiltonian. The model has analytical solutions in its two limits due to the presence of…
In this paper, we consider a Bayesian inverse problem modeled by elliptic partial differential equations (PDEs). Specifically, we propose a data-driven and model-based approach to accelerate the Hamiltonian Monte Carlo (HMC) method in…
This article considers Hamiltonian mechanical systems with potential functions admitting jump discontinuities. The focus is on accurate and efficient numerical approximations of their solutions, which will be defined via the laws of…
A first-principles statistical theory is constructed for the evolution of two dimensional interfaces in Laplacian fields. The aim is to predict the pattern that the growth evolves into, whether it becomes fractal and if so the…
We study the problem of determining whether a given temporal specification can be implemented by a symmetric system, i.e., a system composed from identical components. Symmetry is an important goal in the design of distributed systems,…
This paper investigates the exact number of limit cycles given by the averaging theory of first order for the piecewise smooth integrable non-Hamiltonian system \begin{eqnarray*} (\dot{x},\ \dot{y})=\begin{cases} (-y(x+a)^2+\varepsilon…