Related papers: A Linearly-growing Conversion from the Set Splitti…
We show how to construct an explicit Hamilton cycle in the directed Cayley graph Cay({\sigma_n, sigma_{n-1}} : \mathbb{S}_n), where \sigma_k = (1 2 >... k). The existence of such cycles was shown by Jackson (Discrete Mathematics, 149 (1996)…
This paper provides a set of cycling problems in linear programming. These problems should be useful for researchers to develop and test new simplex algorithms. As matter of the fact, this set of problems is used to test a recently proposed…
Hamiltonian Learning is a process of recovering system Hamiltonian from measurements, which is a fundamental problem in quantum information processing. In this study, we investigate the problem of learning the symmetric Hamiltonian from its…
In this article we discuss the question of presence of Hamiltonian cycle in the un-directed power graph of a group. In the process we develop weighted Hamiltonian cycle concept and prove a few general results regarding the Hamiltonian…
Here is a direct problem for Sidon sets: Given a linear form $\varphi = c_1 x_1 + \cdots + c_h x_h $, construct and describe sets $A$ that are Sidon sets for $\varphi$. This paper considers an inverse problem for Sidon sets: Given a set…
We propose a hierarchical splitting approach to differential equations that provides a design principle for constructing splitting methods for $N$-split systems by iteratively applying splitting methods for two-split systems. We analyze the…
In this paper, factorizations of the complete symmetric digraph $K_v^*$ into uniform factors consisting of directed even cycle factors are studied as a generalization of the undirected Hamilton-Waterloo Problem. It is shown, with a few…
First we give an introduction to the method of diagonalizing or block-diagonalizing continuously a Hamiltonian and explain how this procedure can be used to analyze the two-dimensional Hubbard model. Then we give a short survey on…
We describe a simple method for simulating time-independent Hamiltonian $H$ that could be decomposed as $H = \sum_{i=1}^m H_i$ where each $H_i$ can be efficiently simulated. Approaches relying on product formula generally work by splitting…
A Dynamic Programming based polynomial worst case time and space algorithm is described for computing Hamiltonian Path of a directed graph. Complexity constructive proofs along with a tested C++ implementation are provided as well. The…
The splitting method is a powerful method for solving partial differential equations. Various splitting methods have been designed to separate different physics, nonlinearities, and so on. Recently, a new splitting approach has been…
This paper investigates the behavior of statistical ensembles under iteration map induced by discrete integrable Hamiltonian systems in deterministic case and stochastic case, addressing the problem from two perspectives: the Law of Large…
We address the question of whether it may be worthwhile to convert certain, now classical, NP-complete problems to one of a smaller number of kernel NP-complete problems. In particular, we show that Karp's classical set of 21 NP-complete…
This paper studies a class of partial information linear-quadratic mean-field game problems. A general stochastic large-population system is considered, where the diffusion term of the dynamic of each agent can depend on the state and…
We solve the center-focus problem in a class of piecewise quadratic polynomial differential systems with an invariant straight line. The separation curve is also a straight line which is not invariant. We provide families having at the…
We derive Hamiltonian flow equations giving the evolution of the Lipkin Hamiltonian to a diagonal form using continuous unitary transformations. To close the system of flow equations, we present two different schemes. First we linearize an…
This paper is a generalization of previous work on the use of classical canonical transformations to evaluate Hamiltonian path integrals for quantum mechanical systems. Relevant aspects of the Hamiltonian path integral and its measure are…
We provide a fast and simple method to solve fractional variational problems with dependence on Hadamard fractional derivatives. Using a relation between the Hadamard fractional operator and a sum involving integer-order derivatives, we…
We present an adaptation of the so-called structural method \cite{CMM23} for Hamiltonian systems, and redesign the method for this specific context, which involves two coupled differential systems. Structural schemes decompose the problem…
We show here that the Hamiltonian for an electronic system may be written exactly in terms of fluctuation operators that transition constituent fragments between internally correlated states, accounting rigorously for inter-fragment…