Related papers: A Linearly-growing Conversion from the Set Splitti…
The problem of construction of a simple one - dimensional Hamiltonian whose spectrum coincides with the set of primes is considered. We note that quasiclassically a Hamiltonian whose spectrum has the same counting function as that of the…
In the paper we deal with linear fractional control problems with constant delays in the state. Single-order systems with fractional derivative in Caputo sense of orders between 0 and 1 are considered. The aim is to introduce a new…
In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs…
Though ubiquitous as first-principles models for conservative phenomena, Hamiltonian systems present numerous challenges for model reduction even in relatively simple, linear cases. Here, we present a method for the projection-based model…
We introduce a new class of quantum models with time-dependent Hamiltonians of a special scaling form. By using a couple of time-dependent unitary transformations, the time evolution of these models is expressed in terms of related systems…
We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation…
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…
In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m+1}\times C_n$, where $n$ is allowed to grow whilst $m$ is fixed. In Part~I, we studied the so-called non-contractible…
We present a polynomial complexity, deterministic, heuristic for solving the Hamiltonian Cycle Problem (HCP) in an undirected graph of order $n$. Although finding a Hamiltonian cycle is not theoretically guaranteed, we have observed that…
The vertex set of the kth cartesian power of a directed cycle of length m can be naturally identified with the set of k-tuples of integers modulo m. For any two vertices v and w of this graph, it is easy to see that if there is a…
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. We consider the second Hamiltonian decomposition problem: for a 4-regular multigraph find 2 edge-disjoint Hamiltonian cycles different…
We present a memetic algorithm (\maa) approach for finding a Hamiltonian cycle in a Hamiltonian graph. The \ma is based on a proven approach to the Asymmetric Travelling Salesman Problem (\atspp) that, in this contribution, is boosted by…
Symplectic integration methods based on operator splitting are well established in many branches of science. For Hamiltonian systems which split in more than two parts, symplectic methods of higher order have been studied in detail only for…
We analyze the preservation properties of a family of reversible splitting methods when they are applied to the numerical time integration of linear differential equations defined in the unitary group. The schemes involve complex…
Finding the number 2H6 of directed Hamiltonian cycles in 6-cube is problem 43 in Section 7.2.1.1 of Knuth's ' The Art of Computer Programming'; various proposed estimates are surveyed below. We computed exact value:…
We consider a stochastic control problem with the assumption that the system is controlled until the state process breaks the fixed barrier. Assuming some general conditions, it is proved that the resulting Hamilton Jacobi Bellman equations…
We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solution of size $k$ can be extended into a partial solution of…
We consider a size-structured model for cell division and address the question of determining the division (birth) rate from the measured stable size distribution of the population. We propose a new regularization technique based on a…
An analytical solution to the Hill problem Hamiltonian expanded about the libration points has been obtained by means of perturbation techniques. In order to compute the higher orders of the perturbation solution that are needed to capture…