English
Related papers

Related papers: On the Hamilton-Waterloo Problem with a single fac…

200 papers

The high-frequency Helmholtz equation on the entire space is truncated into a bounded domain using the perfectly matched layer (PML) technique and subsequently, discretized by the higher-order finite element method (FEM) and the continuous…

Numerical Analysis · Mathematics 2023-12-06 Yonglin Li , Haijun Wu

The middle levels problem is to find a Hamilton cycle in the middle levels, M_{2k+1}, of the Hasse diagram of B_{2k+1} (the partially ordered set of subsets of a 2k+1-element set ordered by inclusion). Previously, the best result was that…

Combinatorics · Mathematics 2007-05-23 Ian Shields , Brendan J. Shields , Carla D. Savage

We study the global well-posedness and asymptotic behavior of solutions for the Cauchy problem of three-dimensional sixth order Cahn-Hilliard equation arising in oil-water-surfactant mixtures. First, by using the pure energy method and a…

Analysis of PDEs · Mathematics 2020-07-15 Xiaopeng Zhao

There has been significant progress in the development of quantum algorithms for solving linear systems of equations with a growing body of applications to Computational Fluid Dynamics (CFD) and CFD-like problems. This work extends previous…

Quantum Physics · Physics 2022-06-02 Leigh Lapworth

Here, we study quantitative homogenization of first-order convex Hamilton-Jacobi equations with $(u/\varepsilon)$-periodic Hamiltonians which typically appear in dislocation dynamics. Firstly, we establish the optimal convergence rate by…

Analysis of PDEs · Mathematics 2025-07-02 Hiroyoshi Mitake , Panrui Ni , Hung V. Tran

A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…

Analysis of PDEs · Mathematics 2015-12-24 A. V. Shanin

Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…

We propose an improved algorithm for counting the number of Hamiltonian cycles in a directed graph. The basic idea of the method is sequential acceptance/rejection, which is successfully used in approximating the number of perfect matchings…

Data Structures and Algorithms · Computer Science 2009-11-23 Jinshan Zhang

We prove that the directed seven-dimensional equal-side torus D_7(m) = Cay((Z/mZ)^7, {e_0, e_1, ..., e_6}) admits a directed Hamilton decomposition for every odd integer m >= 3. The proof has two main contributions. First, we introduce the…

Combinatorics · Mathematics 2026-05-04 SangHyun Park

Current quantum computers can only solve optimization problems of a very limited size. For larger problems, decomposition methods are required in which the original problem is broken down into several smaller sub-problems. These are then…

Optimization and Control · Mathematics 2025-04-30 Zongji Li , Tobias Seidel , Michael Bortz , Raoul Heese

Symmetric nonnegative matrix factorization has found abundant applications in various domains by providing a symmetric low-rank decomposition of nonnegative matrices. In this paper we propose a Frank-Wolfe (FW) solver to optimize the…

Machine Learning · Computer Science 2018-06-27 Han Zhao , Geoff Gordon

In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a_1,\ldots,a_n} over \Sigma^m, where \Sigma is a finite alphabet, and integers k and B. The task is to partition A into k clusters such that the median…

Data Structures and Algorithms · Computer Science 2021-04-19 Fedor V. Fomin , Petr A. Golovach , Nidhi Purohit

Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes…

Data Structures and Algorithms · Computer Science 2014-11-24 Sigve Hortemo Sæther

Given a continuous Hamiltonian $H : (x,p,u) \mapsto H(x,p,u)$ defined on $ T^*M \times \mathbb R $, where $M$ is a closed connected manifold, we study viscosity solutions, $u_\lambda : M\to \mathbb R$, of discounted equations: $ H(x, d_x…

Analysis of PDEs · Mathematics 2023-01-30 Qinbo Chen , Albert Fathi , Maxime Zavidovique , Jianlu Zhang

Due to higher-order Kaup-Newell (KN) system has more complex and diverse solutions than classical second-order flow KN system, the research on it has attracted more and more attention. In this paper, we consider a higher-order KN equation…

Exactly Solvable and Integrable Systems · Physics 2021-12-15 Jinyan Zhu , Yong Chen

We propose a new approach for proving uniqueness of semi-wavefronts in generally non-monotone monostable reaction-diffusion equations with distributed delay. This allows to solve an open problem concerning the uniqueness of non-monotone…

Classical Analysis and ODEs · Mathematics 2019-02-27 Abraham Solar , Sergei Trofimchuk

We consider homogenization problems for first order Hamilton-Jacobi equations with $u^\epsilon/\epsilon$ periodic dependence, recently introduced by C. Imbert and R. Monneau, and also studied by G. Barles: this unusual dependence leads to a…

Analysis of PDEs · Mathematics 2009-12-11 Stefania Patrizi , Yves Achdou

We study the homogenization of first-order Hamilton-Jacobi equations on an infinite-dimensional Hilbert space, motivated by systems of infinitely many indistinguishable particles on the torus. A central difficulty is that the analysis takes…

Analysis of PDEs · Mathematics 2026-05-22 Seho Park

Nonnegative matrix factorization (NMF) is the problem of approximating an input nonnegative matrix, $V$, as the product of two smaller nonnegative matrices, $W$ and $H$. In this paper, we introduce a general framework to design…

Machine Learning · Computer Science 2022-04-29 Valentin Leplat , Nicolas Gillis , Jérôme Idier

The exponential speedups promised by Hamiltonian simulation on a quantum computer depends crucially on structure in both the Hamiltonian $\hat{H}$, and the quantum circuit $\hat{U}$ that encodes its description. In the quest to better…

Quantum Physics · Physics 2017-07-19 Guang Hao Low , Isaac L. Chuang
‹ Prev 1 3 4 5 6 7 10 Next ›