Related papers: On the Computational Complexity of Limit Cycles in…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
When the Poincar\'{e} map associated with a periodic orbit of a hybrid dynamical system has constant-rank iterates, we demonstrate the existence of a constant-dimensional invariant subsystem near the orbit which attracts all nearby…
In this paper some qualitative and geometric aspects of nonsmooth vector fields theory are discussed. In the class of nonsmooth systems, that do not present sliding regions, a Poincar\'e-Bendixson Theorem is presented. A minimal set in…
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…
We study the computational complexity of universality and inclusion problems for unambiguous finite automata and context-free grammars. We observe that several such problems can be reduced to the universality problem for unambiguous…
We postulate the existence of a natural Poissonian marking of the double (touching) points of SLE(6) and hence of the related continuum nonsimple loop process that describes macroscopic cluster boundaries in 2D critical percolation. We…
The problem of the effect of two-frequency quasi-periodic perturbations on systems close to arbitrary nonlinear two-dimensional Hamiltonian ones is studied in the case when the corresponding perturbed autonomous systems have a double limit…
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intractable for exact algorithms because of the large number of…
Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is currently no known optimality criterion that localizes classes…
We define a reduction mechanism for LP and SDP formulations that degrades approximation factors in a controlled fashion. Our reduction mechanism is a minor restriction of classical reductions establishing inapproximability in the context of…
We study the computational complexity of the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets, or equivalently the Termination Problem for affine loops with compact semialgebraic guard sets. Consider…
In this work, our primary goal is to study the Poincare map and the existence of limit cycles for Welander's model that describes ocean convection. Welander developed two versions of his model, one with a smooth transition between…
We consider the Chance Constrained Model Predictive Control problem for polynomial systems subject to disturbances. In this problem, we aim at finding optimal control input for given disturbed dynamical system to minimize a given cost…
In this paper, we study the maximum number of limit cycles for the piecewise smooth system of differential equations $\dot{x}=y, \ \dot{y}=-x-\varepsilon \cdot (f(x)\cdot y +{\rm sgn}(y)\cdot g(x))$. Using the averaging method, we were able…
This paper presents new results on the limit cycles of a Li\'enard system with symmetry allowing for discontinuity. Our results generalize and improve the results in [33,34]. The results in [34] are only valid for the smooth system. We…
Although stable solutions of dynamical systems are typically considered more important than unstable ones, unstable solutions have a critical role in the dynamical integrity of stable solutions. In fact, usually, basins of attraction…
This paper concerns two-dimensional Filippov systems --- ordinary differential equations that are discontinuous on one-dimensional switching manifolds. In the situation that a stable focus transitions to an unstable focus by colliding with…
In this paper we present a rigorous derivation of the Boltzmann equation in a compact domain with diffuse reflection boundary conditions. We consider a system of $N$ hard spheres of diameter $\epsilon$ in a box $\Lambda := [0, 1] \times…
In process mining, alignments quantify the degree of deviation between an observed event trace and a business process model and constitute the most important conformance checking technique. We study the algorithmic complexity of computing…
The problem of finding the longest simple cycle in a directed graph is NP-hard, with critical applications in computational biology, scheduling, and network analysis. Existing approaches include exact algorithms with exponential runtimes,…