相关论文: Change Ringing and Hamiltonian Cycles : The Search…
The Melnikov method is applied to periodically perturbed open systems modeled by an inverse--square--law attraction center plus a quadrupolelike term. A compactification approach that regularizes periodic orbits at infinity is introduced.…
We study Ising chains with arbitrary multispin finite-range couplings, providing an explicit solution of the associated inverse Ising problem, i.e. the problem of inferring the values of the coupling constants from the correlation…
It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of…
Precise knowledge of the Hamiltonian of a system is a key to many of its applications. Tasks such state transfer or quantum computation have been well studied with a linear chain, but hardly with systems, which do not possess a linear…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…
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…
The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a given set of strings. This can be reduced to an integer program (IP). However, to date, there exists no known…
The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly…
In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They…
We present a new technique for efficiently removing almost all short cycles in a graph without unintentionally removing its triangles. Consequently, triangle finding problems do not become easy even in almost $k$-cycle free graphs, for any…
We examine the various linkings in space-time of ``ball-like'' and ``ring-like'' topological solitons in certain nonlinear sigma models in 2+1 and 3+1 dimensions. By going to theories where soliton overlaps are forbidden, these linkings…
This note focuses on recent results in spectral analysis of canonical systems of differential equations obtained via the approach developed in our previous papers \cite{MIF1, MP3, etudes, etudes2, PZ, Direct}. Many of our results are…
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…
The evolution of a large class of biological, physical and engineering systems can be studied through both dynamical systems theory and Hamiltonian mechanics. The former theory, in particular its specialization to study systems with…
In the framework of the semiclassical approach the universal spectral correlations in the Hamiltonian systems with classical chaotic dynamics can be attributed to the systematic correlations between actions of periodic orbits which (up to…
The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…
It has been shown that a global minimizer of a smooth determinant of a matrix function corresponds to the largest cycle of a graph. When it exists, this is a Hamiltonian cycle. Finding global minimizers even of a smooth function is a…
Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic finite automata with practical algorithms. The historical…
Finding a Hamiltonian cycle in a given graph is computationally challenging, and in general remains so even when one is further given one Hamiltonian cycle in the graph and asked to find another. In fact, no significantly faster algorithms…
Hamiltonian Monte Carlo (HMC) algorithms which combine numerical approximation of Hamiltonian dynamics on finite intervals with stochastic refreshment and Metropolis correction are popular sampling schemes, but it is known that they may…