相关论文: Melnikov theory to all orders and Puiseux series f…
In this paper, the author establishes the existence of positive entire solutions to a general class of semilinear poly-harmonic systems, which includes equations and systems of the weighted Hardy--Littlewood--Sobolev type. The novel method…
We study the existence of real-analytic first integrals and real-analytic integrability for perturbations of integrable systems in the sense of Bogoyavlenskij including non-Hamiltonian ones. We especially assume that there exists a family…
The paper deals with the problem of existence of a convergent "strong" normal form in the neighbourhood of an equilibrium, for a finite dimensional system of differential equations with analytic and time-dependent non-linear term. The…
We consider the ordered field which is the completion of the Puiseux series field over \bR equipped with a ring of analytic functions on [-1,1]^n which contains the standard subanalytic functions as well as functions given by t-adically…
We develop a Melnikov framework for the Kuramoto Sivashinsky (KS) equation under weak deterministic and stochastic forcing. By treating KS as an infinite dimensional dynamical system, we derive a Melnikov functional that measures splitting…
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal are polynomial time solvable in the class of chordal graphs. We consider these problems in a graph that has at most $k$ vertices whose deletion…
By using variational methods, the existence of infinitely many solutions for a nonlinear algebraic system with a parameter is established in presence of a perturbed Lipschitz term. Our goal was achieved requiring an appropriate behavior of…
Using a completely analytic procedure - based on a suitable extension of a classical method - we discuss an approach to the Poincar\'e-Mel'nikov theory, which can be conveniently applied also to the case of non-hyperbolic critical points,…
This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…
In analyses of algorithms, a substantial amount of effort has often to be spent on the discussion of special cases. For example, when the analysis considers the cases X<Y and X>Y separately, one might have to be especially careful about…
We propose to use orthologic as the basis for designing type systems supporting intersection, union, and negation types in the presence of subtyping assumptions. We show how to extend orthologic to support monotonic and antimonotonic…
We have applied the Melnikov criterion to examine a global homoclinic bifurcation and transition to chaos in a case of the Duffing system with nonlinear fractional damping and external excitation. Using perturbation methods we have found a…
We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…
The fully nonlinear notion of resonance$-$\textit{geometrical resonance}$-$in the general context of dissipative systems subjected to spatially periodic \textit{phase-modulated} potentials is discussed. It is demonstrated that there is an…
On a finite graph with a chosen partition of the vertex set into interior and boundary vertices, a $\lambda$-polyharmonic function is a complex function $f$ on the vertex set which satisfies $(\lambda \cdot I - P)^n f(x) = 0$ at each…
Finding a zero of a sum of maximally monotone operators is a fundamental problem in modern optimization and nonsmooth analysis. Assuming that resolvents of the operators are available, this problem can be tackled with the Douglas-Rachford…
There exist several methods for computing exact solutions of algebraic differential equations. Most of the methods, however, do not ensure existence and uniqueness of the solutions and might fail after several steps, or are restricted to…
Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…
In this paper, we study limit cycle bifurcations for a kind of non-smooth polynomial differential systems by perturbing a piecewise linear Hamiltonian system with a center at the origin and a homoclinic loop around the origin. By using the…
We continue a previous paper to show that Mel'nikov's first order formula for part of the separatrix splitting of a pendulum under fast quasi periodic forcing holds, in special examples, as an asymptotic formula in the forcing rapidity.