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

We resolve a long-standing open question, about the existence of a constant-factor approximation algorithm for the average-case \textsc{Decision Tree} problem with uniform probability distribution over the hypotheses. We answer the question…

This paper introduces and solves the Generalized Heron-Waist Problem (GHWP), that integrates the classical Heron problem of optimal hub location and the waist problem of minimal-perimeter configuration. The GHWP seeks an optimal closed…

We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring…

Let $n\geq 3$, $0\le m<\frac{n-2}{n}$, $\rho_1>0$, $\beta>\beta_0^{(m)}=\frac{m\rho_1}{n-2-nm}$, $\alpha_m=\frac{2\beta+\rho_1}{1-m}$ and $\alpha=2\beta+\rho_1$. For any $\lambda>0$, we prove the uniqueness of radially symmetric solution…

Deciding if a graph is a Hamilton graph, also named the Hamilton cycle problem, is important for discrete mathematics and computer science. Due to no characterization to identify Hamilton graphs effectively, there are no tractable…

The Hamiltonian constraint remains the major unsolved problem in Loop Quantum Gravity (LQG). Seven years ago a mathematically consistent candidate Hamiltonian constraint has been proposed but there are still several unsettled questions…

We address the inverse Frobenius--Perron problem: given a prescribed target distribution $\rho$, find a deterministic map $M$ such that iterations of $M$ tend to $\rho$ in distribution. We show that all solutions may be written in terms of…

In the present work, we use the homotopy perturbation method (HPM) to solve the Newell- Whitehead-Segel non-linear differential equations. Four case study problems of Newell-Whitehead- Segel are solved by the HPM and the exact solutions are…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

The $k$-Facility Location problem is a generalization of the classical problems $k$-Median and Facility Location. The goal is to select a subset of at most $k$ facilities that minimizes the total cost of opened facilities and established…

In myriad statistical applications, data are collected from related but heterogeneous sources. These sources share some commonalities while containing idiosyncratic characteristics. One of the most fundamental challenges in such scenarios…

In this paper, we prove that for each $d \geq 2$, the union of a $d$-regular graph with a uniformly random $2$-factor on the same vertex set is Hamiltonian with high probability. This resolves a conjecture by Dragani\'c and Keevash for all…

In this paper we consider a generalization of the classical k-center problem with capacities. Our goal is to select k centers in a graph, and assign each node to a nearby center, so that we respect the capacity constraints on centers. The…

This article proposes a formalism which unifies Hamiltonian simulation techniques from different fields. This formalism leads to a competitive method to construct the Hamiltonian simulation with a comprehensible, simple-to-implement circuit…

Optimization problems is one of the most challenging applications of quantum computers, as well as one of the most relevants. As a consequence, it has attracted huge efforts to obtain a speedup over classical algorithms using quantum…

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach…

The Worldvolume Hybrid Monte Carlo method (WV-HMC method) [arXiv:2012.08468] is a reliable and versatile algorithm towards solving the sign problem. Similarly to the tempered Lefschetz thimble method, this method removes the ergodicity…

Motivated by problems of comparative genomics and paleogenomics, in [Chauve et al., 2009], the authors introduced the Gapped Consecutive-Ones Property Problem (k,delta)-C1P: given a binary matrix M and two integers k and delta, can the…

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…

This paper presents a renormalization approach to many-particle systems. By starting from a bare Hamiltonian ${\cal H}= {\cal H}_0 +{\cal H}_1$ with an unperturbed part ${\cal H}_0$ and a perturbation ${\cal H}_1$,we define an effective…