Related papers: A Linearly-growing Conversion from the Set Splitti…
We study a certain polytope arising from embedding the Hamiltonian cycle problem in a discounted Markov decision process. The Hamiltonian cycle problem can be reduced to finding particular extreme points of a certain polytope associated…
A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$. A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. In the late $60$s Kelly conjectured that every…
We study the singular locus of solutions to Hamilton-Jacobi equations with a Hamiltonian independent of $u$. In a previous paper, we proved that the singular locus is what we call a balanced split locus. In this paper, we find and classify…
Based on a simple observation that a classical second order differential equation may be decomposed into a set of two first order equations, we introduce a Hamiltonian framework to quantize the damped systems. In particular, we analyze the…
A method of exactly solving the master equation is presented in this letter. The explicit form of the solution is determined by the time evolution of a composite system including an auxiliary system and the open system in question. The…
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation…
Hamiltonian systems with linearly dependent constraints (irregular systems), are classified according to their behavior in the vicinity of the constraint surface. For these systems, the standard Dirac procedure is not directly applicable.…
Correlated many-body problems ubiquitously appear in various fields of physics such as condensed matter physics, nuclear physics, and statistical physics. However, due to the interplay of the large number of degrees of freedom, it is…
We study classical particles on the sites of an open chain which diffuse, coagulate and decoagulate preferentially in one direction. The master equation is expressed in terms of a spin one-half Hamiltonian $H$ and the model is shown to be…
In this paper we consider a generalized classical mechanics with fractional derivatives. The generalization is based on the time-clock randomization of momenta and coordinates taken from the conventional phase space. The fractional…
We reelaborate on a general method for obtaining effective Hamiltonians that describe different nonlinear optical processes. The method exploits the existence of a nonlinear deformation of the su(2) algebra that arises as the dynamical…
Harmonic model predictive control (HMPC) is a model predictive control (MPC) formulation which displays several benefits over other MPC formulations, especially when using a small prediction horizon. These benefits, however, come at the…
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this…
We introduce a combinatorial enumeration problem that is solved using generalized Catalan numbers. We also study generalizations of the Cycle Lemma beyond the computation of the generalized Catalan numbers.
In this paper, we consider some cubic near-Hamiltonian systems obtained from perturbing the symmetric cubic Hamiltonian system with two symmetric singular points by cubic polynomials. First, following Han [2012] we develop a method to study…
Investigating a problem of B. Mohar, we show that every one-ended Hamiltonian cubic graph with end degree 3 contains a second Hamilton cycle. We also construct two examples showing that this result does not extend to give a third Hamilton…
We present a recursive formula for the computation of the static effective Hamiltonian of a system under a fast-oscillating drive. Our analytical result is well-suited to symbolic calculations performed by a computer and can be implemented…
Constraint problems can be trivially solved in parallel by exploring different branches of the search tree concurrently. Previous approaches have focused on implementing this functionality in the solver, more or less transparently to the…
We investigate the inverse problem concerning the evolution of a qubit system, specifically we consider how one can establish the Hamiltonians that account for the evolution of a qubit along a prescribed path in the projected Hilbert space.…
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…