English
Related papers

Related papers: The Hamilton-Waterloo problem with C8-factors and …

200 papers

In the first part of the paper, we propose and rigorously analyze a mixed finite element method for the approximation of the periodic strong solution to the fully nonlinear second-order Hamilton--Jacobi--Bellman equation with coefficients…

Numerical Analysis · Mathematics 2021-06-18 Dietmar Gallistl , Timo Sprekeler , Endre Süli

Over the last ten years, results from [Melenk-Sauter, 2010], [Melenk-Sauter, 2011], [Esterhazy-Melenk, 2012], and [Melenk-Parsania-Sauter, 2013] decomposing high-frequency Helmholtz solutions into "low"- and "high"-frequency components have…

Analysis of PDEs · Mathematics 2022-08-02 Jeffrey Galkowski , David Lafontaine , Euan A. Spence , Jared Wunsch

The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected $2k$-valent infinite circulant graph has a two-way-infinite…

Combinatorics · Mathematics 2017-01-31 Darryn Bryant , Sarada Herke , Barbara Maenhaut , Bridget Webb

A previously found definition of complexity for spherically symmetric fluid distributions [1], is extended to axially symmetric static sources. In this case there are three different complexity factors, defined in terms of three structure…

General Relativity and Quantum Cosmology · Physics 2019-03-20 L. Herrera , A. Di Prisco , J. Ospino

Two solvable Hamiltonians for describing the dynamic gamma deformation, are proposed. The limiting case of each of them is the X(5) Hamiltonian. Analytical solutions for both energies and wave functions, which are periodic in $\gamma$, are…

Nuclear Theory · Physics 2008-11-26 A. C. Gheorghe , A. A. Raduta , Amand Faessler

For a Hamilton cycle in a rectangular $m \times n$ grid, what is the greatest number of turns that can occur? We give the exact answer in several cases and an answer up to an additive error of $2$ in all other cases. In particular, we give…

Combinatorics · Mathematics 2020-07-21 Ethan Y. Tan , Guowen Zhang

We present the saddle-point approximation for the effective Hamiltonian of the quantum kink in two-dimensional linear sigma models to all orders in the time-derivative expansion. We show how the effective Hamiltonian can be used to obtain…

High Energy Physics - Theory · Physics 2020-12-30 Ilarion V. Melnikov , Constantinos Papageorgakis , Andrew B. Royston

We study the Cauchy problem for the Hamilton-Jacobi equation with a semiconcave initial condition. We prove an inequality between two types of weak solutions emanating from such an initial condition (the variational and the viscosity…

Dynamical Systems · Mathematics 2014-06-04 Patrick Bernard

The Lam\'e function can be used to construct plane wave factors and solutions to the Korteweg-de Vries (KdV) and Kadomtsev-Petviashvili (KP) hierarchy. The solutions are usually called elliptic solitons. In this chapter, first, we review…

Exactly Solvable and Integrable Systems · Physics 2023-08-15 Xing Li , Da-jun 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

We consider a hyperk\"{a}hler $8$-manifold admitting either a $U(1) \times \mathbb{R}$, or a $U(1) \times U(1)$ action, where the first factor preserves $g$ and $I$, and acts on $\omega_2+i\omega_3$ by multiplying it by itself, while the…

Differential Geometry · Mathematics 2014-09-30 Joseph Malkoun

The acoustic scattering problem is modeled by the exterior Helmholtz equation, which is challenging to solve due to both the unboundedness of the domain and the high dispersion error, known as the pollution effect. We develop high-order…

Numerical Analysis · Mathematics 2026-04-14 Bin Han , Jiwoon Sim

When solving the Hamiltonian path problem it seems natural to be given additional precedence constraints for the order in which the vertices are visited. For example one could decide whether a Hamiltonian path exists for a fixed starting…

Discrete Mathematics · Computer Science 2025-02-28 Jesse Beisegel , Fabienne Ratajczak , Robert Scheffler

The K-way vertex cut problem} consists in, given a graph G, finding a subset of vertices of a given size, whose removal partitions G into the maximum number of connected components. This problem has many applications in several areas. It…

Computational Complexity · Computer Science 2021-12-06 Mohammed Lalou

In the Longest Common Factor with $k$ Mismatches (LCF$_k$) problem, we are given two strings $X$ and $Y$ of total length $n$, and we are asked to find a pair of maximal-length factors, one of $X$ and the other of $Y$, such that their…

In this paper, we study the numerical method for the bi-Laplace problems with inhomogeneous coefficients; particularly, we propose finite element schemes on rectangular grids respectively for an inhomogeneous fourth-order elliptic singular…

Numerical Analysis · Mathematics 2024-04-23 Bin Dai , Huilan Zeng , Chensong Zhang , Shuo Zhang

The main result in this paper is the $C^{\infty}$ closing lemma for a large family of Hamiltonian flows on $4$-dimensional symplectic manifolds, which includes classical Hamiltonian systems. First we prove the $C^{\infty}$ closing lemma and…

Dynamical Systems · Mathematics 2019-04-23 Dong Chen

In this paper, using the approximate particular solutions of Helmholtz equations, we solve the boundary value problems of Helmholtz equations by combining the methods of fundamental solutions (MFS) with the methods of particular solutions…

Numerical Analysis · Mathematics 2024-11-27 Adam Johnson

In this paper we study the existence and multiplicity of homoclinic solutions for the second order Hamiltonian system $\ddot{u}-L(t)u(t)+W_u(t,u)=0$, $\forall t\in\mathbb{R}$, by means of the minmax arguments in the critical point theory,…

Dynamical Systems · Mathematics 2011-06-03 Chungen Liu , Qingye Zhang

In this paper we suggest analytical methods and associated algorithms for determining the sum of the subsets $X_m$ of the set $X_n$ (subset sum problem). Our algorithm has time complexity $T=O(C_{n}^{k})$ ($k=[m/2]$, which significantly…

Information Theory · Computer Science 2020-05-05 B. Sinchev , A. B. Sinchev , J. Akzhanova , A. M. Mukhanova , Y. Issekeshev
‹ Prev 1 8 9 10 Next ›