Searcharxiv⌕ Search

arXiv · 2610.06066

Convex Density Design for Regional Phase-Volume Contraction of Nonlinear Systems

Abstract

Regional weighted phase-volume contraction for nonlinear systems is studied using positive densities selected from a finite-dimensional log-affine family. The affine dependence of the density divergence on the design parameters turns density selection into a semi-infinite convex optimization problem that maximizes a certified uniform contraction margin on a compact region. This provides a constructive alternative to testing a preselected density and ensures a well-posed design problem under compact parameter constraints. Finite active-point and minimax characterizations identify the worst-case states governing the optimum, while rigorous sampling bounds allow continuum contraction guarantees to be recovered from finitely many inequalities. For scalar power densities, feasibility is characterized by an exact interval condition. The same structure is preserved in discrete time and admits distance-weighted and conformal-geometric interpretations. Overall, the framework provides computable certificates for detecting regional contraction that may remain hidden from ordinary divergence. A two-parameter limit-cycle example demonstrates this effect when both ordinary phase volume and a natural single-basis density fail.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Igor B. Furtat. 2026-10-05. Convex Density Design for Regional Phase-Volume Contraction of Nonlinear Systems. https://arxiv.org/abs/2610.06066

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

KEEP EXPLORING

Related papers

Multiple Polynomial Recurrence in Weyl Systems

In this work we give a full characterization of sets of multiple polynomial recurrence in Weyl systems, which are ergodic unipotent affine transformations on products of tori and finite abelian groups. In particular, we show that measurable and topological recurrence in Weyl systems coincide. Our analysis also yields a structure theorem for polynomial multicorrelation sequences in Weyl systems. These results stem from an in-depth study of the Weyl complexity of a set of polynomials and the introduction of a new concept: the \textit{Weyl polynomials} generated by a set of polynomials.

math.DS↗

Multipliers and Disjointness from Mixing

In 2005, Parreau proved that if a measure preserving system is not strongly mixing then it contains a non-trivial factor that is disjoint from every strongly mixing system. Taking this construction as the starting point, we develop the complementary notions of $\mathcal U$-generated and $\mathcal U$-mixing systems, for a set $\mathcal U$ of ultrafilters, and use them to recover several classical results in ergodic theory as special cases of a unified framework. We prove that a system is $\mathcal U$-mixing if and only if it is disjoint from all $\mathcal U$-generated systems. In fact, we show that if $\mathcal Y$ is a $\mathcal U$-generated system and $\mathcal Z$ is disjoint from every $\mathcal U$-mixing system, then any joining of $\mathcal Y$ and $\mathcal Z$ remains disjoint from all $\mathcal U$-mixing systems. We also show that every partially rigid system is a finite extension of some $\mathcal{U}$-generated system.

math.DS↗

Rank-two recurrence results for polynomials and questions of dynamical Mordell--Lang type

Let $f,g\in\mathbb{C}[z]\setminus\mathbb{C}$ and $c\in\mathbb{C}[z]$. Suppose that $\mathrm{deg}(c)=1$ if $\mathrm{deg}(f)=\mathrm{deg}(g)=1$. Using the theory of Presburger arithmetic, we prove that the rank-two recurrence set \[ S_{f,g,c}^2:=\left\lbrace(m,n)\in\mathbb{Z}_{\geq0}^2\colon \existsλ\in\mathbb{C}, f^{\circ m}(λ)=g^{\circ n}(λ)=c(λ)\right\rbrace \] is semi-linear. This is a generalization of a theorem of Yang and Zhong for the case $m=n$. We also obtain partial results on recurrence sets for rational maps. These results are related to higher-dimensional questions of dynamical Mordell--Lang type of rank $\leq2$.

math.DS↗