English
Related papers

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

200 papers

We consider uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a partial solution for the case in which all resolution classes are either…

Combinatorics · Mathematics 2025-04-22 Jehyun Lee , Melissa Keranen

This paper is devoted to study the Cauchy problem for the fractional dissipative BO equations $u_t+\mathcal{H}u_{xx}-(D_x^{\alpha}-D_x^{\beta})u+uu_x=0$, $0< \alpha < \beta$. When $1<\beta <2$, we prove GWP in $H^s(\mathbb{R})$,…

Analysis of PDEs · Mathematics 2019-08-23 Ricardo A. Pastrán , Oscar G. Riaño C

In this paper, we suggest a new heterogeneous multiscale method (HMM) for the time-harmonic Maxwell equations in locally periodic media. The method is constructed by using a divergence-regularization in one of the cell problems. This allows…

Numerical Analysis · Mathematics 2015-09-15 Patrick Henning , Mario Ohlberger , Barbara Verfürth

The matrix code equivalence problem consists, given two matrix spaces $\mathcal{C},\mathcal{D} \subset \mathbb{F}_q^{m\times n}$ of dimension $k$, in finding invertible matrices $P\in\mathrm{GL}_m(\mathbb{F}_q)$ and…

Cryptography and Security · Computer Science 2025-06-09 Alain Couvreur , Christophe Levrat

Simulating quantum many-body systems represents a fundamental challenge where classical machine learning methods are severely bottlenecked by the exponential curse of dimensionality. Variational Quantum Algorithms (VQAs) offer a native…

Quantum Physics · Physics 2026-03-31 Ge Yan , Kaisen Pan , Ruocheng Wang , Mengfei Ran , Hongxu Chen , Junchi Yan

The large deflection of a circular thin plate under uniform external pressure is a classic problem in solid mechanics, dated back to Von K{\'a}rm{\'a}n \cite{Karman}. {This problem is reconsidered in this paper using an analytic…

Analysis of PDEs · Mathematics 2018-01-25 Xiaoxu Zhong , Shijun Liao

The problem of sampling constrained continuous distributions has frequently appeared in many machine/statistical learning models. Many Monte Carlo Markov Chain (MCMC) sampling methods have been adapted to handle different types of…

Computation · Statistics 2023-02-21 Shiwei Lan , Lulu Kang

The generalization of the Oberwolfach Problem, proposed by J. Liu in 2000, asks for a uniform $2$-factorization of the complete multipartite graph $K_{m\times n}$. Here we focus our attention on $2$-factorizations regular under the cyclic…

Combinatorics · Mathematics 2016-03-22 Anita Pasotti , Marco Antonio Pellegrini

The generalised Sudoku problem with $N$ symbols is known to be NP-complete, and hence is equivalent to any other NP-complete problem, even for the standard restricted version where $N$ is a perfect square. In particular, generalised Sudoku…

Data Structures and Algorithms · Computer Science 2016-03-10 Michael Haythorpe

The Hamiltonian Monte Carlo (HMC) method allows sampling from continuous densities. Favorable scaling with dimension has led to wide adoption of HMC by the statistics community. Modern auto-differentiating software should allow more…

Computation · Statistics 2022-08-17 Ian Langmore , Michael Dikovsky , Scott Geraedts , Peter Norgaard , Rob von Behren

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))\\…

Mathematical Physics · Physics 2014-09-03 Amado Méndez , César Torres

In quantitative genetics, viscosity solutions of Hamilton-Jacobi equations appear naturally in the asymptotic limit of selection-mutation models when the population variance vanishes. They have to be solved together with an unknown function…

Analysis of PDEs · Mathematics 2018-09-17 Vincent Calvez , King-Yeung Lam

We use a Hamiltonian normal form approach to study the dynamics of the water wave problem in the small amplitude long wave regime (KdV regime). If $\mu$ is the small parameter corresponding to the inverse of the wave length, we show that…

Mathematical Physics · Physics 2020-03-09 Dario Bambusi

The rarely used Hamilton-Jacobi equation has been utilized as an elegant way to find the trajectories of mechanical systems and to derive symplectic maps. Further, the exact solution in kick approximation of Hamilton's equations of motion…

Accelerator Physics · Physics 2026-01-21 Stephan I. Tzenov

Single individual haplotyping is an NP-hard problem that emerges when attempting to reconstruct an organism's inherited genetic variations using data typically generated by high-throughput DNA sequencing platforms. Genomes of diploid…

Machine Learning · Computer Science 2019-09-04 Somsubhra Barik , Haris Vikalo

The Harrow, Hassidim, Lloyd (HHL) algorithm is a quantum algorithm expected to accelerate solving large-scale linear ordinary differential equations (ODEs). To apply the HHL to non-linear problems such as chemical reactions, the system must…

Numerical Analysis · Mathematics 2022-07-06 Takaki Akiba , Youhi Morii , Kaoru Maruta

A new concept of meromorphic $\Sigma$-factorization, for H\"{o}lder continuous functions defined on a contour $\Gamma$ that is the pullback of $\dot{\mathbb{R}}$ (or the unit circle) in a Riemann surface $\Sigma$ of genus 1, is introduced…

Complex Variables · Mathematics 2011-08-03 M. C. Câmara , M. T. Malheiro

Cima, Ma\~{n}osas and Villadelprat (J. Differ. Equations, 157, 373--413, 1999) proved that a cubic Hamiltonian system possesses an isochronous center at the origin if and only if its Hamiltonian function can be expressed as…

Dynamical Systems · Mathematics 2025-12-23 Jihua Yang

In this paper, we consider the symmetric multi-type non-negative matrix tri-factorization problem (SNMTF), which attempts to factorize several symmetric non-negative matrices simultaneously. This can be considered as a generalization of the…

Data Structures and Algorithms · Computer Science 2020-12-14 Rok Hribar , Timotej Hrga , Gregor Papa , Gašper Petelin , Janez Povh , Nataša Pržulj , Vida Vukašinović

Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The…

Computational Complexity · Computer Science 2018-12-06 R. Ganian , N. S. Narayanaswamy , S. Ordyniak , C. S. Rahul , M. S. Ramanujan