相关论文: On the Hamilton-Waterloo Problem with a single fac…

The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…

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…

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…

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

We construct new resolvable decompositions of complete multigraphs and complete equipartite multigraphs into cycles of variable lengths (and a perfect matching if the vertex degrees are odd). We develop two techniques: {\em layering}, which…

We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…

In this paper, we construct Hamilton-Jacobi equations for a great variety of mechanical systems (nonholonomic systems subjected to linear or affine constraints, dissipative systems subjected to external forces, time-dependent mechanical…

For which values of $k$ does a uniformly chosen $3$-regular graph $G$ on $n$ vertices typically contain $ n/k$ vertex-disjoint $k$-cycles (a $k$-cycle factor)? To date, this has been answered for $k=n$ and for $k \ll \log n$; the former,…

This series of papers is devoted to an open-ended project aimed at the solution of Hilbert's sixth problem (concerning joint axiomatization of physics and probability theory) proposed to be constructed in the framework of an all-embracing…

We study the Hamilton-Jacobi formulation of effective mechanical actions associated with holographic renormalization group flows when the field theory is put on the sphere and mass terms are turned on. Although the system is supersymmetric…

Hilbert-Arnold (HA) problem, motivated by Hilbert 16-th problem, is to prove that for a generic k-parameter family of smooth vector fields {\dot x=v(x,\eps)}_{\eps\in B^k} on the 2-dimensional sphere S^2 has uniformly bounded number of…

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

The inverse one-phase Stefan problem in one dimension, aimed at identifying the unknown time-dependent heat flux P(t) with a known moving boundary position s(t), is investigated. A previous study [16] attempted to reconstruct the unknown…

A pattern $\alpha$ is a string of variables and terminal letters. We say that $\alpha$ matches a word $w$, consisting only of terminal letters, if $w$ can be obtained by replacing the variables of $\alpha$ by terminal words. The matching…

In this paper we consider the Hamilton cycle problem in the rectangular meshes with at most two faulty nodes.We prove that this problem is solvable in polynomial time with a corresponding algorithm. We provided an entirely new approach to…

The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of $K_{2n+1}$ into edge-disjoint copies of a given $2$-factor. We show that this can be achieved for all large $n$. We actually prove a significantly more general…

Given a graph $G$ and two graph homomorphisms $\alpha$ and $\beta$ from $G$ to a fixed graph $H$, the problem $H$-Recoloring asks whether there is a transformation from $\alpha$ to $\beta$ that changes the image of a single vertex at each…

We consider critical points of the geometric obstacle problem on vectorial maps $u: \mathbb{B}^2 \subset \mathbb{R}^2 \to \mathbb{R}^N$ \[ \int_{\mathbb{B}^2} |\nabla u|^2 \quad \mbox{subject to $u \in \mathbb{R}^N \backslash…

We prove optimal regularity for the double obstacle problem when obstacles are given by solutions to Hamilton-Jacobi equations that are not $C^2$. When the Hamilton-Jacobi equation is not $C^2$ then the standard Bernstein technique fails…

These lectures describe in detail the effective Hamiltonians for weak decays of mesons constructed by means of the operator product expansion and the renormalization group method. We calculate Wilson coeffcients of local operators, discuss…