相关论文: The Hamilton-Waterloo problem with C8-factors and …
R. Wang (Discrete Mathematics and Theoretical Computer Science, vol. 19(3), 2017) proposed the following problem. \textbf{Problem.} Let $D$ be a strongly connected balanced bipartite directed graph of order $2a\geq 8$. Suppose that…
We study the Hamiltonian path problem in C-shaped grid graphs, and present the necessary and sufficient conditions for the existence of a Hamiltonian path between two given vertices in these graphs. We also give a linear-time algorithm for…
We present simple examples of finite-dimensional connected homogeneous spaces (they are actually topological manifolds) with nonhomogeneous and nonrigid factors. In particular, we give an elementary solution of an old problem in general…
We derive and solve the Hamiltonian flow equations for a Dirac particle in an external static potential. The method shows a general procedure for the set up of continuous unitary transformations to reduce the Hamiltonian to a quasidiagonal…
In this paper, we investigate the existence of infinitely many solutions for the following fractional Hamiltonian systems: \begin{eqnarray}\label{eq00} _{t}D_{\infty}^{\alpha}(_{-\infty}D_{t}^{\alpha}u(t)) + L(t)u(t) = & \nabla W(t,u(t))\\…
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…
We prove that a complete multipartite graph $K$ with $n>1$ vertices and $m$ edges can be decomposed into edge-disjoint Hamilton paths if and only if $\frac m{n-1}$ is an integer and the maximum degree of $K$ is at most $\frac {2m}{n-1}$.
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix…
The third-order Jeffery-Hamel ODE governing the flow of an incompressible fluid in a two-dimensional wedge is briefly derived, and a C^1 finite element formulation of the equation is developed. This formulation has several advantages,…
In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices $V$, we want to find a subset of vertices $S$, called centers, such that the maximum cluster radius is minimized. Moreover,…
We prove that for every $\varepsilon > 0$ there is $c_0$ such that if $G\sim G(n,c/n)$, $c\ge c_0$, then with high probability $G$ can be covered by at most $(1+\varepsilon)\cdot \frac{1}{2}ce^{-c} \cdot n$ vertex disjoint paths, which is…
Due to its highly oscillating solution, the Helmholtz equation is numerically challenging to solve. To obtain a reasonable solution, a mesh size that is much smaller than the reciprocal of the wavenumber is typically required (known as the…
The general solutions for the factorization equations of the reflection matrices $K^{\pm}(\theta)$ for the eight vertex and six vertex models (XYZ, XXZ and XXX chains) are found. The associated integrable magnetic Hamiltonians are…
The Hamiltonian coupled-mode theory (HCMT), recently derived by Athanassoulis and Papoutsellis [1], provides an efficient new approach for solving fully nonlinear water-wave problems over arbitrary bathymetry. In HCMT, heavy use is made of…
In this paper, we solve the Camassa-Holm equation for a relatively large class of initial data by using a factorization problem on the Hilbert-Schmidt group.
Motivated to find the answers to some of the questions that have occurred in recent papers dealing with Hamiltonian cycles (abbreviated HCs) in some special classes of grid graphs we started the investigation of spanning unions of cycles,…
We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…
Semileptonic B decays are described by the Isgur-Wise form factor to the leading order in 1/m; four new functions appear in the first order [Luke]. Values of these functions are crucial for the applicability of the whole approach to…
In the paper we prove Harbourne-Hirschowitz conjecture for quasi-homogeneous linear systems on $\mathbb P^2$ for $m=7$, 8, 9, 10, i.e. systems of curves of given degree passing through points in general position with multiplicities at least…
In this work, we introduce an iterative linearised finite element method for the solution of Bingham fluid flow problems. The proposed algorithm has the favourable property that a subsequence of the sequence of iterates generated converges…