相关论文: The Hamilton-Waterloo problem for Hamilton cycles …

In a recent FTC by Tremblay {\sl et al} (2009 {\sl J. Phys. A: Math. Theor.} {\bf 42} 205206), it has been conjectured that for any integer value of $k$, some novel exactly solvable and integrable quantum Hamiltonian $H_k$ on a plane is…

One of the main open problems in the context of extensions of Hilbert's tenth problem (HTP) is the case of the ring of complex entire functions in one variable. Our main result provides a step towards an answer: For every $\rho\ge 0$, we…

A basic result in graph theory says that any $n$-vertex tournament with in- and out-degrees larger than $\frac{n-2}{4}$ contains a Hamilton cycle, and this is tight. In 1990, Bollob\'{a}s and H\"{a}ggkvist significantly extended this by…

This is the full and extended version of the brief note arXiv:1908.00938. A nontrivially solvable 4-dimensional Hamiltonian system is applied to the problem of wave fronts and to the asymptotic theory of partial differential equations. The…

Quartic eigenvalue problem $(\lambda^4 A + \lambda^3 B + \lambda^2C + \lambda D + E)x = \mathbf{0}$ naturally arises e.g. when solving the Orr-Sommerfeld equation in the analysis of the stability of the {Poiseuille} flow, in theoretical…

Based on a suggestion of Richard Hamilton, we give an alternate proof of his matrix Harnack inequality for solutions of the Ricci flow with positive curvature operator. This Harnack inequality says that a certain endomorphism, consisting of…

An efficient solution of the Dirac Hamiltonian flow equations has been proposed through a novel expandsion with the inverse of the Dirac effective mass. The efficiency and accuracy of this new expansion have been demonstrated by reducing a…

We present a Hamilton cycle in the $k$-sided pancake network and four combinatorial algorithms to traverse the cycle. The network's vertices are coloured permutations $\pi = p_1p_2\cdots p_n$, where each $p_i$ has an associated colour in…

The goal of this paper is to give a simple proof of the convergence to time-periodic states of the solutions of time-periodic Hamilton-Jacobi equations on the circle with convex Hamiltonian. Note that the period of the limiting solutions…

The P\'osa--Seymour conjecture determines the minimum degree threshold for forcing the $k$th power of a Hamilton cycle in a graph. After numerous partial results, Koml\'os, S\'ark\"ozy and Szemer\'edi proved the conjecture for sufficiently…

We consider quantum Hamiltonians of the form $H = H_0 - U \sum_j \cos(C_j)$ where $H_0$ is a quadratic function of position and momentum variables $\{x_1, p_1, x_2, p_2,...\}$ and the $C_j$'s are linear in these variables. We allow $H_0$…

A Hamiltonian path (cycle) in a graph is a path (cycle, respectively) which passes through all of its vertices. The problems of deciding the existence of a Hamiltonian cycle (path) in an input graph are well known to be NP-complete, and…

The problem of reconstruction of an unknown refractive index $k(x)$ of an inhomogeneous solid $P$ is considered. The refractive index is assumed to be a piecewise-H\"{o}lder function The original boundary value problem for the Helmholtz…

As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive research. Recent developments in the area have highlighted the crucial role played by the notions of expansion…

We integrate with hyperelliptic functions a two-particle Hamiltonian with quartic potential and additionnal linear and nonpolynomial terms in the Liouville integrable cases 1:6:1 and 1:6:8.

In this paper, we introduce a so-called Multistage graph Simple Path (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem. To solve the MSP problem, we propose a polynomial algorithm…

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…

In this paper, we study discrepancy questions for spanning subgraphs of $k$-uniform hypergraphs. Our main result is that, for any integers $k \ge 3$ and $r \ge 2$, any $r$-colouring of the edges of a $k$-uniform $n$-vertex hypergraph $G$…

For an even integer t \geq 2, the Matchings Connecivity matrix H_t is a matrix that has rows and columns both labeled by all perfect matchings of the complete graph K_t on t vertices; an entry H_t[M_1,M_2] is 1 if M_1\cup M_2 is a…

The decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying a given Boolean formula $C$, are well-known {\it NP}-complete problems. Here we…