相关论文: Melnikov theory to all orders and Puiseux series f…
The implementation of reliable and efficient geometric algorithms is a challenging task. The reason is the following conflict: On the one hand, computing with rounded arithmetic may question the reliability of programs while, on the other…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
For an arbitrary finite family of semi-algebraic/definable functions, we consider the corresponding inequality constraint set and we study qualification conditions for perturbations of this set. In particular we prove that all positive…
We provide a novel computer-assisted technique for systematically analyzing first-order methods for optimization. In contrast with previous works, the approach is particularly suited for handling sublinear convergence rates and stochastic…
Let F be a set of ordered patterns, i.e., graphs whose vertices are linearly ordered. An F-free ordering of the vertices of a graph H is a linear ordering of V(H) such that none of patterns in F occurs as an induced ordered subgraph. We…
Higher-order perturbations during the ringdown phase are essential for testing gravitational theories. This requires a perturbation framework that extends beyond General Relativity, as well as an appropriate method for reconstructing the…
Using the technique of Poincar\'{e} return maps, we disclose an intricate order of the subsequent homoclinics near the primary homoclinic bifurcation of the Shilnikov saddle-focus in systems with reflection symmetry. We also reveal the…
One of the most ubiquitous problems in optimization is that of finding all the elements of a finite set at which a function $f$ attains its minimum (or maximum). When the codomain of $f$ is equipped with a total order, it is easy to…
The cyclicity of the exterior period annulus of the asymmetrically perturbed Duffing oscillator is a well known problem extensively studied in the literature. In the present paper we provide a complete bifurcation diagram for the number of…
The effect of multiplicative stochastic perturbations on Hamiltonian systems on the plane is investigated. It is assumed that perturbations fade with time and preserve a stable equilibrium of the limiting system. The paper investigates…
Following Part~I, we consider a class of reversible systems and study bifurcations of homoclinic orbits to hyperbolic saddle equilibria. Here we concentrate on the case in which homoclinic orbits are symmetric, so that only one control…
Determining whether a given program terminates is the quintessential undecidable problem. Algorithms for termination analysis are divided into two groups: (1) algorithms with strong behavioral guarantees that work in limited circumstances…
We introduce a hierarchy of degree structures between the Medvedev and Muchnik lattices which allow varying amounts of non-uniformity. We use these structures to introduce the notion of the uniformity of a Muchnik reduction, which expresses…
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…
We consider a large family of problems in which an ordering (or, more precisely, a chain of subsets) of a finite set must be chosen to minimize some weighted sum of costs. This family includes variations of Min Sum Set Cover (MSSC), several…
Analytical perturbations of a family of finite-dimensional Poisson systems are considered. It is shown that the family is analytically orbitally conjugate in $U \subset \mathbb{R}^n$ to a planar harmonic oscillator defined on the symplectic…
Building upon the minimal time function, we propose and study a novel notion of Tykhonov well-posedness with respect to a set of directions for optimization problems. This concept generalizes the classical Tykhonov well-posedness by…
Algorithmic meta-theorems state that problems definable in a fixed logic can be solved efficiently on structures with certain properties. An example is Courcelle's Theorem, which states that all problems expressible in monadic second-order…
This paper deals with the existence, multiplicity, minimal complexity and global structure of the subharmonic solutions to a class of planar Hamiltonian systems with periodic coefficients, being the classical predator-prey model of V.…
It is shown that harmonic functions on some subsets, subharmonic and coinciding everywhere outside of these sets, actually coincide everywhere.