Search arXiv⌕ Search

arXiv · 2609.33034

Global classification of oscillatory dynamics in symmetric zero-divergence 3D piecewise-linear Filippov systems with a visible--visible two-fold

Abstract

A global classification of the asymptotic oscillatory dynamics is established for a symmetric zero-divergence class of three-dimensional piecewise-linear Filippov systems, up to a set of initial conditions of zero Lebesgue measure. The affine fields are related by an involution, and the switching plane contains a visible--visible two-fold. In canonical coordinates, the eigenvalues are \(μ\pm i\) and \(-2μ\), while \(H\) measures the focal-line inclination. For every \(μ>0\), a simple-period crossing cycle exists if and only if \(H\in\mathcal I_μ\), and is unique, symmetric, hyperbolic, and orbitally asymptotically stable. Its half-period parametrizes \(\mathcal I_μ\) and determines the crossing points, period, and Floquet multipliers. Global dissipation excludes crossing cycles with any higher number of crossings and makes the classified cycle the \(ω\)-limit set of every crossing-only trajectory. If attractive sliding has no interior pseudo-equilibria, sliding is transient unless the trajectory reaches the two-fold. The initial conditions leading to the two-fold lie in a countable union of analytic surfaces and curves. Under sufficiently small perturbations in the Whitney \(C^1\) topology, the cycle persists as the unique simple-period crossing limit cycle and remains hyperbolic and orbitally asymptotically stable.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samuel Carlos S. Ferreira. 2026-09-27. Global classification of oscillatory dynamics in symmetric zero-divergence 3D piecewise-linear Filippov systems with a visible--visible two-fold. https://arxiv.org/abs/2609.33034

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Markov matrix perturbations to optimize dynamical and entropy functionals

An important problem in applied dynamical systems is to compute the external forcing that provokes the largest response of a desired observable quantity. For this, we investigate the perturbation theory of Markov matrices in connection with linear response theory in statistical physics. We use perturbative expansions to derive linear algorithms to optimize physically relevant quantities such as: entropy, Kullback-Liebler-divergence and entropy production of Markov matrices and their related probability vectors. These optimization algorithms are applied to Markov chain representations of discrete and continuous flows in and out of equilibrium. We consider Markov matrix representations originating from Ulam-type approximations of transfer operators and a reduced order model of a turbulent flow based on unstable periodic orbits theory. We also propose a numerical protocol to recast matrix perturbations into vector field perturbations. The results allow to physically interpret the obtained optimizing perturbations without knowledge of the underlying equations, in a data-driven way.

math.DS↗

Synchronization points: growth, asymptotics, congruences, and the synchronization zeta function

In this paper, we introduce the synchronization zeta function associated with a pair of self-maps of a topological space and investigate its properties. We also define the growth rate of synchronization points and derive an explicit formula in the setting of endomorphisms of compact, connected Abelian groups. In addition, we establish Gauss congruences and describe the asymptotic behavior for the sequence of numbers of synchronization points, under the assumption that the synchronization zeta function is rational. Further, we discuss connections with topological entropy.

math.DS↗

Polynomial Interpolation of a Vector Field on a Convex Polyhedral Domain

We develop a method for reconstructing polynomial vector fields from discrete velocity samples on a convex polyhedral domain under an exact no-penetration boundary condition. For a prescribed degree bound, the method computes a polynomial vector field that fits the sampled data in the least-squares sense while satisfying the tangency condition identically on every boundary facet. The central ingredient is an explicit algebraic characterization of the space of polynomial vector fields tangent to the boundary, obtained from the theory of logarithmic derivations of hyperplane arrangements. This characterization reduces the constrained reconstruction problem to finite-dimensional linear algebra. We also discuss extensions incorporating additional linear differential constraints, such as incompressibility, and piecewise polynomial constructions on non-convex polyhedral domains with prescribed smoothness across cell interfaces.

math.DS↗