pith. sign in

math.DS

Dynamical Systems

Dynamics of differential equations and flows, mechanics, classical few-body problems, iterations, complex dynamics, delayed differential equations

Top Pith
3
math.PR 2026-05-18 2 theorems

ASL(Z)-invariant subsets come from polynomials and independent sampling

by Miko{l}aj Frączyk, Simon Machado

{ASL_n}(mathbb Z) invariant random subsets of mathbb Z^n

This higher-order cut-and-project yields Bernoulli mixtures under weak mixing and details Howe-Moore failure for the groups.

Figure from the paper full image
abstract click to expand
We classify measures on $\{0,1\}^{\mathbb{Z}^d}$, $d \geq 3$, the space of subsets of $\mathbb{Z}^d$, which are invariant under all affine special linear transformations. In other words, we classify simple point processes on $\mathbb{Z}^d$ whose law is invariant under affine special linear transformations. We show that every such process is built from a random equivariant polynomial together with independent random sampling, a higher-order generalisation of the cut-and-project method: a random polynomial map is drawn from a distribution invariant under a natural action of $\mathrm{SL}_d(\mathbb{Z})$, each site is then retained independently with a probability determined by a measurable function of the polynomial's value, and the classical cut-and-project construction is recovered in the degree-one case. As a corollary, when the underlying $\mathbb{Z}^d$-action is weakly mixing the measure must be a convex combination of Bernoulli shifts, in the spirit of de Finetti's theorem on exchangeable processes. Our theorem also makes precise how the Howe--Moore theorem fails for the pair $(\mathrm{ASL}_d(\mathbb{Z}), \mathrm{SL}_d(\mathbb{Z}))$. Motivated by this classification, we formulate a conjecture for $\mathrm{ASL}_d(\mathbb{R})$-invariant point processes on $\mathbb{R}^d$, predicting that any such set decomposes into a Poisson part and a quasicrystal part. The proofs rely on the interaction between the Host--Kra theory of characteristic factors, Zimmer's theory of dynamical cocycles of simple Lie groups, and the dynamics of $\mathrm{SL}_d(\mathbb{Z})$-actions on homogeneous spaces.
0
Top Pith
2
math.CO 2026-05-14 2 theorems

Affine invariance threshold in prime fields is o(log p)

by Jie Ma, Quanyu Tang +1 more

Almost Affine Invariance Over Prime Fields: Green Problem 90

Density-1/2 sets satisfy |A Δ (ax+b)| = o(p) for all |a|,|b| = o(log p), solving Green's open problem 90.

abstract click to expand
Let $A\subset \mathbb{F}_p$ with density 1/2. We call a set $A$ almost affine invariant under an affine transformation $\phi(x)=ax+b$ if \[|A \triangle \phi(A)| =o(p).\] We determine that, the threshold value of $K$ such that $A$ is almost affine invariant simultaneously under all $\phi(x)$ with $|a|, |b|\le K$ and $a\neq 0$, is $K=o(\log p)$. This solves Ben Green's Open Problem 90.
0
Top Pith
2
math.GR 2026-05-14 2 theorems

Finitely generated G outside C ties amenability to Thompson F

by Joaquín Brum, Martín Gilabert Vio +1 more

Groups with classifiable actions on the line

The group is amenable exactly when F is, yet its minimal line actions lack a Borel transversal for conjugacy.

Figure from the paper full image
abstract click to expand
We motivate and study the class $\mathcal{C}$ of countable groups $G$ such that the conjugacy relation between minimal actions of $G$ on $\mathbb{R}$ by orientation-preserving homeomorphisms is smooth -- that is, admits a Borel transversal. No example of amenable group outside of $\mathcal{C}$ is known. We show a number of stability properties of $\mathcal{C}$ under group-theoretic operations and that $\mathcal{C}$ contains all finitely generated groups of piecewise affine homeomorphisms of the interval. We exhibit a finitely generated group $G$ that is not in $\mathcal{C}$, such that $G$ is amenable if and only if Thompson's group $F$ is amenable. We also prove that the semiconjugacy relation among cocompact actions of a countable group $G$ is smooth if and only if $G \in \mathcal{C}$, and that it is essentially countable even when $G$ is not finitely generated. In the Appendix, we show that there is no good analogue of the space of harmonic actions for a countable non-finitely generated group.
0
0
math.OA 2026-07-03

All invariant subalgebras in lattice Poisson boundaries are crossed products

by Shuoxing Zhou

On invariant subalgebras of noncommutative Poisson boundaries for higher rank lattices

They arise exactly from larger parabolic quotients and normal subgroups of the lattice.

abstract click to expand
Let $G$ be a real connected semisimple Lie group with trivial center, no non-trivial compact factors, and all simple factors of real rank at least two. Let $\Gamma<G$ be an irreducible lattice, let $P<G$ be a minimal parabolic subgroup, and consider the crossed product $L^\infty(G/P,\nu_P)\rtimes \Gamma$. We prove that every $\Gamma$-invariant von Neumann subalgebra of $L^\infty(G/P,\nu_P)\rtimes \Gamma$ is of the form $L^\infty(G/Q,\nu_Q)\rtimes \Lambda$, where $P\leq Q\leq G$ and $\Lambda\lhd\Gamma$. This confirms a conjecture of Amrutam--Hartman.
0
0
math.DS 2026-07-03

Memory breaks consensus into periodic multiconsensus via global Hopf bifurcation

by Casey Maikalani Crane

Consensus-Breaking Global Hopf Bifurcation in Memory-Based Multi-Agent Systems

Equivariant degree classifies the transition in three delay-equation classes, with UAV and market examples.

Figure from the paper full image
abstract click to expand
This dissertation provides the first systematic study of symmetric consensus-breaking bifurcation to periodic multiconsensus in multi-agent systems. It analyzes this for three classes of multi-agent systems based on three different types of memory, whose closed-loop dynamics equations form delay differential equations of retarded type, neutral type, and pseudoneutral type - a subclassification of retarded type equations introduced in this dissertation which bridges retarded and neutral type delay equations. Equivariant twisted degree is used to analyze the symmetric global Hopf bifurcation problem in these systems, i.e. bifurcation from a stable consensus to periodic multiconsensus. This shows how the effects of memory allow self-organizing agents to move beyond mere stationary consensus. Theoretical results for the global Hopf bifurcation and symmetric classification of periodic multiconsensus solutions across all three systems are provided, and numerical results are conducted to both validate and enhance the theoretical predictions by providing stability information on the branches which is not obtainable by the degree alone. These principles are demonstrated in three real-world applications: one involving the control of formations of UAVs, allowing them to maintain their overall spatial relationships while dancing in complex selectable oscillations; and two more in networked asset markets featuring different traders with different memory-based strategies, showing how similar mechanisms can be responsible for economic cycles of bubbles and crashes. Finally, we also numerically investigate resonant double Hopf bifurcations in the neutral delay system, showing strong evidence of a breakdown to chaos via the Ruelle-Takens-Newhouse scenario and the existence of riddled basins.
0
0
math.OC 2026-07-03

Control system separates strict from ordinary invariance entropy

by Senhan Yao

Invariance Entropy in the Dust

Cantor coordinate and contracting dynamics yield finite strict entropy but infinite ordinary entropy while breaking lower semicontinuity.

abstract click to expand
We answer negatively two natural general forms of Kawan's questions on invariance entropy for control systems, open for more than fifteen years, by a single construction. We show that finite strict invariance entropy need not coincide with ordinary invariance entropy, and that strict invariance entropy need not be lower semicontinuous under Hausdorff perturbations of the initial set. The construction is a continuous-time control system in which a Cantor coordinate stores an infinite symbolic instruction, an exponentially contracting coordinate makes late mismatches geometrically invisible, and a compact matching graph forces exact symbolic agreement. It identifies a source of information complexity not generated by dynamical expansion, but by the persistence of exact viability constraints under thin invariant geometry and by the order of limits in invariance entropy.
0
0
math.DS 2026-07-03

Homeomorphism groups of pseudo-solenoids have non-metrizable minimal flows

by Jan Boronski, Aleksandra Kwiatkowska

Universal minimal flows of the homeomorphism groups of pseudo-solenoids are non-metrizable

The result covers the pseudo-circle and shows these groups act on spaces that cannot be metrized.

abstract click to expand
We note that homeomorphism groups of all pseudo-solenoids, including the pseudo-circle, have non-metrizable universal minimal flows.
0
0
math.DS 2026-07-03

Free group minimal actions on Cantor sets can lack dynamical comparison

by Paolo Boldrini, Akshara Prasad

Topologically free minimal actions without dynamical comparison

Such actions exist with or without invariant measures, and crossed product comparison does not imply the dynamical version.

abstract click to expand
We show the existence of a topologically free minimal action of $\mathbb F_\infty$ on the Cantor space that does not have dynamical comparison. Moreover, we show that this phenomenon can happen both in the presence and in the absence of invariant measures. We also show that strict comparison of the reduced crossed product C*-algebra does not imply dynamical comparison for minimal actions. Our technique involves constructing a monoid which is not almost unperforated, embedding it into a countable refinement monoid and then realising it as the type semigroup associated to a dynamical system.
0
0
math.AP 2026-07-03

Local linking theorem gives two solutions for relativistic equations

by Manuel Garzón, Salvador López-Martínez

A Local Linking Theorem for Relativistic Action Functionals

An analogue of the Brezis-Nirenberg result for Szulkin functionals from action principles proves multiplicity for the Lorentz force and mean

Figure from the paper full image
abstract click to expand
We establish an analogue of the Brezis-Nirenberg local linking theorem for a class of Szulkin-type functionals arising from relativistic action principles. In this framework, compactness of Palais-Smale sequences is formulated with respect to a topology induced by the effective domain of the functional, replacing the classical strong Palais-Smale condition. The proof combines the original construction of the min-max geometry, based on a negative gradient flow, with the Ekeland-Lasry regularization. The main difficulty is that the regularized functional is naturally associated with the strong topology of the underlying functional space, whereas compactness for the original functional is formulated in the topology induced by the effective domain. We overcome this obstacle through a new perturbative construction that recovers the required min-max structure. We apply our abstract multiplicity result to two representative relativistic models: the Lorentz force equation, describing the dynamics of a charged particle in an electromagnetic field, and the Dirichlet problem for the prescribed mean curvature operator in Minkowski space. As a consequence, under natural assumptions, each problem admits at least two non-constant solutions.
0
0
math.AG 2026-07-03

Tangential arcs yield codimension formula for foliated discrepancies

by Maurício Corrêa

Foliated and Mather-Jacobian discrepancies via tangential arcs

The formula equates cylinder codimensions with discrepancies and supplies a criterion for log canonicity on threefolds.

abstract click to expand
This article develops a tangential arc-space approach to foliated discrepancies for logarithmic simple co-rank one foliations on threefolds, relative to a fixed invariant normal-crossing separatrix divisor. In the non-resonant logarithmic case, reduced tangential arcs centred on the prescribed tangential locus are shown to be confined to this divisor. The tangential sector is therefore represented, at the reduced arc level, by the normalised separatrix-conductor system. Foliated adjunction transfers the discrepancy calculus to ordinary adjunction pairs on the normalised branches and conductors. Applying the arc-space theorem of Ein-Musta\c{t}\u{a}--Yasuda on these strata, this yields a tangential codimension formula identifying logarithmic codimensions of toroidal tangential divisorial cylinders with the corresponding tangential discrepancies. The resulting theory gives a toroidal tangential inversion of adjunction, a branch--conductor description of the tangential non-lc and non-klt loci, a cylinder criterion for tangential log canonicity, lower semicontinuity of the toroidal tangential minimal log discrepancy, and a relative Mather--Jacobian refinement for the canonical image separatrix system.
0
0
math.DS 2026-07-03

Consensus protocol on graphs models origami folding dynamics

by Yuto Tanaka, Ran Dai +1 more

Dynamic Modeling and Parameter Estimation for Origami Structure Reconfiguration Process

Effective parameters fitted from trajectory data reproduce two-panel and Kresling pattern motion.

Figure from the paper full image
abstract click to expand
The reconfiguration of origami during the folding and unfolding process is governed through a sequence of panel deformations and hinge orientations. To develop an effective model for representing the reconfiguration process, this paper introduces planar straight-line graphs and a novel consensus protocol for reaching the target origami configuration. The convergence and stability properties of the proposed consensus protocol are subsequently analyzed. Furthermore, to account for aggregate material and structural effects in the proposed consensus-based reconfiguration model, effective parameters embedded in the consensus protocol are identified from trajectory data using a fitting algorithm. Lastly, the effectiveness of the proposed modeling approach is shown using simulations of the two-panel structure and the Kresling origami pattern reconfiguration process.
0
0
math.DS 2026-07-03

Diophantine skew-shifts yield semicircle law at rate 1/N

by Cong Chen, Yong Li

Linking effective Ratner equidistribution to the semicircle law for skew-shift matrices

Effective mixing from Ratner theorem controls moments to give optimal convergence for eigenvalue distributions

Figure from the paper full image
abstract click to expand
We consider large Hermitian matrices whose entries are defined by evaluating the exponential function along orbits of the skew-shift \(\frac{j(j-1)}{2}\omega + jy + x \mod 1\) for irrational \(\omega\). We establish a rigorous connection between the effective Ratner equidistribution theorem for unipotent orbits in \(\SL(3,\R)/\SL(3,\Z)\) and the global semicircle law for such deterministic matrices. For frequency sequences satisfying a Diophantine condition, we prove that the empirical spectral distribution of these matrices converges to the Wigner semicircle law with optimal polynomial rate \(O(N^{-1})\); for rectangular matrices the corresponding Marchenko--Pastur law is obtained. The proof uses a multi-parameter effective mixing property derived from the effective Ratner equidistribution theorem, combined with a graph-theoretic expansion of the moments. Our results evidence the quasirandom nature of the skew-shift dynamics observed in other contexts by Bourgain, Goldstein and Schlag, and Rudnick, Sarnak and Zaharescu, and provide a dynamical systems proof of the semicircle law with an improved convergence rate.
0
0
math.DS 2026-07-02

Spoke construction transfers uniform entropy to uniform mean dimension

by Tal Barak, Elon Lindenstrauss

Uniformly Positive Mean Dimension

Symbolic systems with full-support measures produce completely positive mean dimension; examples separate this from uniform versions using i

abstract click to expand
We study the relation between uniformly positive entropy and uniformly positive mean dimension at the level of fixed open covers. To a symbolic system X, we associate a hub-and-spoke system Spoke(X), obtained by replacing each symbol by a one-dimensional spoke attached to a common hub. We prove that if X admits a shift-invariant measure of full support, then Spoke(X) has completely positive mean dimension. We also prove that if X has uniformly positive entropy, then Spoke(X) has uniformly positive mean dimension. Finally, using symbolic codings of irrational rotations on tori, we construct hub-and-spoke systems with completely positive mean dimension but without uniformly positive mean dimension or uniformly positive entropy. The examples are nondegenerate: the relevant covers have zero mean dimension and zero entropy, but when refined by iterating under the dynamics the corresponding covering numbers are unbounded.
0
0
math-ph 2026-07-02

Near-resonant terms accumulate to power-law growth in dispersive waves

by P.Yu. Astafieva, O.M. Kiselev

Small Denominators and Subresonant Accumulation in Weakly Nonlinear Dispersive Dynamics

Detunings shrinking as n to a power let infinite families contribute t to a fractional power instead of remaining bounded.

Figure from the paper full image
abstract click to expand
We study a small-denominator mechanism in weakly nonlinear dispersive dynamics. After Fourier decomposition, a nonlinear dispersive equation becomes an infinite system of weakly coupled oscillators. Higher-order correction terms may then contain infinite families of nonresonant Fourier interactions whose detunings tend to zero. Such families do not produce exact secular terms, but their accumulated contribution may grow as a power of time. We call this effect subresonant accumulation. The rigorous part of the paper is the analysis of a model forced oscillator and of an abstract subresonant Duhamel sum. If the detuning and coefficients have the form $\Delta_n\sim c n^{-p}$ and $B_n\sim b n^{-\kappa}$, then the accumulated contribution grows as $t^{1-\alpha}$, where $\alpha=(\kappa-1)/p$. We then show how this mechanism appears in a quartic Fourier family for the Klein--Gordon dispersion law. For the full nonlinear partial differential equation we formulate a conditional approximation result: provided that all remaining resonant and almost resonant interactions are controlled, the subresonant term gives the leading long-time correction.
0
0
math.DS 2026-07-02

Delay enlarges basin and speeds convergence for nonholonomic integrator

by William Clark, Anthony Bloch

Delay effects on the discontinuous stabilization of the nonholonomic integrator and its generalizations

Small lag splits sliding mode into two hysteresis regions that expand the set of converging states and shorten settling time.

Figure from the paper full image
abstract click to expand
The nonholonomic integrator is a famous example in feedback design - although it is small-time locally controllable to the origin, no continuous feedback law exists. Therefore, any stabilizing feedback laws must be either time-varying or discontinuous. A previously studied discontinuous feedback law stabilizes initial conditions lying between two paraboloids and has a sliding mode on the $xy$-plane. We investigate the effect of introducing delays into this discontinuous feedback law. To a first-order analysis, the lag causes the sliding mode of the $xy$-plane to bifurcate into two switching regions where the resulting dynamics can be interpreted as a hybrid dynamical system with hysteresis. Counterintuitively, the presence of a delay can actually have a positive effect on both the size of the basin of attraction and the convergence rate of the controller. We also consider the natural generalization of the nonholonomic integrator to higher dimensions.
0
0
math.DS 2026-07-02

Algebraic conditions locate stochastic delay stability boundaries

by Zsolt Iklodi, Harry Dankowicz

Algebraic conditions for second-moment stability boundaries of linear, time-invariant stochastic delay-differential equations

Equality conditions derived from reduced correlation equations find second-moment boundaries without discretization and scale with dimension

Figure from the paper full image
abstract click to expand
For linear, time-invariant stochastic delay-differential equations with a single constant delay and both multiplicative and additive noise, this paper derives optimal semi-analytic algebraic equality conditions that can be used to identify second-moment stability boundaries without the use of problem discretization. Successful validation against Monte Carlo simulations and published results for several low-dimensional models clarifies limitations of stability conditions proposed in the literature and demonstrates considerable savings in computational effort relative to discretization-based approaches. In particular, using the theory derived in this paper, second-moment stability boundaries are shown to be computable using parameter continuation techniques applied to discretization-free equality conditions that scale only with the square of the problem dimension. For the case of one-dimensional stochastic delay-differential equations, in particular, the analysis is entirely closed form with a stability condition expressed entirely in terms of elementary functions. These results are enabled by the derivation of an advection-type boundary-value problem with non-local boundary conditions for a three-variable correlation function followed by a reduction to a delay-differential boundary-value problem for a two-variable correlation function. For the former problem, observations regarding the spectral abscissa of the discretization of the corresponding infinitesimal generator, particularly that second-moment stability is lost when a real eigenvalue passes through the origin, motivate identification of second-moment stability boundaries with a loss of uniqueness of stationary solutions to the latter problem.
0
0
math.SG 2026-07-02

Homology gives sharp lower bound on closed Reeb orbits

by Miguel Abreu, Leonardo Macarini

Multiplicity of closed Reeb orbits on contact manifolds with periodic equivariant symplectic homology

On manifolds with periodic positive equivariant symplectic homology, the minimal count r_M is reached exactly when the form is lacunary.

abstract click to expand
We consider closed contact manifolds $(M,\xi)$ with periodic positive equivariant symplectic homology. This is a very large class of contact manifolds and, to the best of our knowledge, includes all currently known examples admitting Reeb flows with finitely many closed orbits for which equivariant symplectic homology is a well-defined invariant. Under weak and homologically natural index assumptions on a non-degenerate contact form $\alpha$ on $M$, we establish a sharp lower bound $r_M$ for the number of simple closed Reeb orbits of $\alpha$. Moreover, we show that this bound is attained if and only if $\alpha$ is lacunary, i.e., the Conley-Zehnder indices of all closed orbits have the same parity. The bound $r_M$ admits a clean dynamical characterization: whenever a non-degenerate lacunary contact form exists on $M$, $r_M$ equals the number of its simple closed Reeb orbits and is therefore independent of the choice of such a form. In particular, in the lacunary case $r_M$ is a contact invariant completely determined by the positive equivariant symplectic homology. We compute $r_M$ for a broad class of examples, including several prequantizations of symplectic orbifolds, and show that in this case $r_M = \dim H_*(M/S^1;\mathbb{Q})$, thereby giving a topological characterization of this invariant. Motivated by these results, we conjecture that any contact form with finitely many closed Reeb orbits is necessarily non-degenerate and lacunary, and that the underlying contact manifold is a prequantization of this type.
0
0
q-bio.PE 2026-07-02

Factor-two peak approximation holds under Erlang scaling in multistage SIR

by Denis Tverskoi, Andrew Gothard +1 more

Approximating Peak Prevalence in Multistage SIR Epidemics

The delay limit expresses prevalence and weighted stages as moving averages of incidence, showing when the approximation is accurate and how

abstract click to expand
Estimating peak prevalence is a central problem in epidemic modeling because it determines the period of greatest infectious burden and is closely linked to health-care demand. In multistage SIR models, however, peak prevalence is generally less tractable than in the classical model with exponentially distributed infectious periods. Motivated by the use of weighted infectious-stage aggregates as surrogates for prevalence, we investigate the relationship between the prevalence peak and the maximum of a weighted stage functional in deterministic SI$(k)$R epidemic models. We show that this relationship depends critically on how the stage-progression rate is scaled as the number of infectious stages increases. Under naive scaling, in which the progression rate remains fixed, the weighted peak is asymptotically equivalent to the prevalence peak and the commonly used factor-two approximation fails. Under Erlang scaling, which preserves the mean infectious period, the multistage model converges to a delay formulation in which prevalence and the weighted stage functional become unweighted and triangularly weighted moving averages of incidence. This limiting representation provides a theoretical basis for the factor-two approximation and identifies the regimes in which it is accurate. It also explains why this approximation deteriorates as epidemic waves become more sharply peaked. We derive analytical error bounds and develop curvature-based and parameter-based corrections that substantially improve accuracy. Numerical studies confirm these improvements across a broad range of epidemiological parameters. Overall, the results show when weighted-stage peaks can be used reliably as proxies for peak prevalence and how the resulting estimates can be refined when the standard approximation loses accuracy.
0
0
math.DS 2026-07-02

Riemann-type graphs have box dimension 7/4

by Yurong Wu, Guoping Zhan

On box dimension of the graphs of the generalized Riemann-type functions

Matching lower and upper bounds hold when the Fourier coefficients of g satisfy an arithmetic non-vanishing condition on quadratic residues.

Figure from the paper full image
abstract click to expand
We investigate the box dimension of the graphs of a class of continuous periodic functions $G_\delta(x)=\sum_{n=1}^{\infty}g(n^{2}x)n^{-1-\delta}$ with 1-periodic Lipschitz functions $g$ and $0<\delta\le 1$, which generalizes the result of the classical Riemann function corresponding to $g(x)=\sin(2\pi x)$ and $\delta=1$. More precisely, we first prove that the lower box dimension of the graph of $G_{\delta}$ is no less than $\frac74-\frac{\delta}{2}$ when the Fourier coefficients of $g$ satisfy an arithmetic non-vanishing condition related to the distribution of quadratic residues. This result is new and non-trivial even when $g$ has a finite Fourier expansion, highlighting the intrinsic arithmetic complexity of the series. Secondly, if $g'$ is Lipschitz continuous on $\mathbb{R}$, we show that the upper box dimension does not exceed \(\frac74-\frac{\delta}{2}\), which extends earlier work of Chamizo and C\'ordoba and reveals deep connection between the regularity of $g$ and the fractal dimension of the associated Riemann-type series. In the end, we give some illustrative examples and propose some further problems.
0
0
math.DS 2026-07-02

Rational maps realize new branch data families with three points

by Zhiqiang Wei

Realizability of Certain Rational Maps with Three Branch Points

Extends the known realizable configurations in the Hurwitz existence problem for maps with exactly three branch points.

Figure from the paper full image
abstract click to expand
This paper investigates the Hurwitz existence problem for rational maps with three branch points. We establish several new families of realizable branch data and identify previously undocumented exceptional data. This work constitutes the second part of our systematic investigation of the Hurwitz problem, extending our earlier results obtained through the football decomposition method.
0
0
math.GR 2026-07-02

Nilpotent groups have cyclic escape property

by Michael Björklund, Alexander Fish

Directional expansion in ergodic actions of countable groups

This forces directional expansivity in all their totally ergodic actions, while free groups of rank two or more lack the property.

abstract click to expand
We study directional expansion for probability-measure-preserving actions of countable groups through a representation-theoretic group property, the cyclic escape property. An infinite countable group has the cyclic escape property if every totally ergodic unitary representation has arbitrarily small fixed-vector projections along infinite cyclic subgroups. This property implies directional expansivity for all totally ergodic actions. We prove that all infinite finitely generated nilpotent groups have the cyclic escape property, and conjecture the same for all infinite finitely generated polycyclic groups. We also prove the cyclic escape property for higher-rank simple lattices whose finite-dimensional unitary representations all have finite image; in particular, for $SL_n(\mathbb Z)$, $PSL_n(\mathbb Z)$, and $PGL_n(\mathbb Z)$, $n\geq 3$. By contrast, free groups of rank at least two do not have the cyclic escape property. The proofs exhibit two independent mechanisms: central spectral structure in nilpotent groups and stationary character rigidity in higher-rank lattices.
0
0
math.DS 2026-07-02

Lattices in p-adic groups act finitely below rank dimension

by Segev Gonen Cohen

Actions of lattices in S-arithmetic groups on manifolds

Any C1 action on a compact manifold must be finite if dimension is less than the group's rank, extending to S-arithmetic cases.

abstract click to expand
We prove that an action by $C^1$ diffeomorphisms of a lattice in a simple $p$-adic group on a compact manifold is finite, provided the dimension is less than the rank. We extend this statement to lattices in totally disconnected $S$-arithmetic groups, where the critical dimension is the maximal rank of the simple factors. This uses the machinery developed by Brown, Fisher, and Hurtado.
0
0
math.OC 2026-07-02

Quadratic-output LTI systems have explicit L2-gain bounds via anti-diagonal

by Birgit Hillebrecht

L2-L2-gain bounds for quadratic output systems

The bound equals the L2 norm of the bivariate transfer function on the anti-diagonal and is obtained by solving linear matrix equations.

abstract click to expand
We derive an explicit bound for the L2-L2-gain of linear time-invariant systems whose output is a quadratic function of the state and the input. Such systems appear naturally in many areas, for example for port-Hamiltonian systems, optimal-control, and stochastic problems. In case the output is purely quadratic in the state, the bound equals the L2-norm of the bivariate transfer function evaluated along the anti-diagonal $\{(s,\,-s)\mid s\in i\mathbb R\}$ of the $i \mathbb R\times i \mathbb R$ frequency domain. Further, we show how the bound can be computed by solving linear matrix equations. This result provides a practical tool for assessing and reducing quadratic-output models.
0
0
math.DS 2026-07-02

Minimax locates periodic solutions on every energy surface of reduced Hamiltonian systems

by Shu Sakaguchi, Mitsuru Shibayama

A Minimax Approach to Relative Periodic Orbits in Symmetric Three-Degree-of-Freedom Hamiltonian Systems

Topological assumptions on compact Hill regions let the Maupertuis functional produce saddle-point orbits that are nontrivial under a Morse-

abstract click to expand
We study three-degree-of-freedom Hamiltonian systems that are invariant under rotations about the $z$-axis and under reflection across the $xy$-plane. Fixing the angular momentum, such systems reduce to Hamiltonian systems with two degrees of freedom. We focus on the range of energy values for which the corresponding Hill regions are compact. First, under suitable assumptions on the topology of these compact Hill regions, we prove the existence of periodic solutions on each prescribed energy surface of the reduced system by means of a variational minimax method. These periodic solutions are obtained as saddle points of the Maupertuis functional. The resulting solutions are either nontrivial spatial periodic solutions or trivial planar brake solutions in the reduced system. Next, by computing the Morse index, we provide a sufficient condition ensuring that the periodic solutions obtained are nontrivial. Finally, we apply our results to the isosceles three-body problem and to the spatial anisotropic Kepler problem. In both cases, we verify the sufficient condition for nontriviality and thereby establish the existence of nontrivial periodic solutions.
0
0
math.GM 2026-07-02

Exponential-sigmoid equation fits confined cell growth better than logistic

by Kavinda Jayawardana, Brad Turner

Exponential Sigmoid Equation for Modelling Cell Growth in a Confined Space, Log-Normal Distribution for Modelling Cell Area Distribution of Dense Colonies and Other Methods

Growth capacity, time and rate extracted from the model correlate with titer and viability, allowing prediction of productivity and health.

Figure from the paper full image
abstract click to expand
Based on the growth patterns of 166 CHO monoclones observed over a 15 day period, we show that the standard population growth in a confined space equation, i.e. the sigmoid/logistic function, is alone does not capture the complex behaviour of the cell growth in a confined space. Thus, combining the sigmoid function and the exponential of the sigmoid function, we present a more accurate model for modelling cell growth in a confined space. We also present a working algorithm to obtain population growth variables (growth capacity, growth time and growth rate), model the growth patterns of the CHO monoclones, and we include subset of the dataset, along with a sample python script for the reader to replicate the results. Furthermore, we derive a model for cell confluence growth in a confined space, numerically model the confluence and present the reader with a working algorithm. With Kolmogorov-Smirnov analysis conducted on the area of the CHO monoclones, we show that the cell area of the incipient population is normally distributed, the sparse cell population is gamma distributed and the dense colony population is log-normally distributed. Thus, we further derive models for the mean, the standard deviation, the coefficient of variation and the inverse coefficient of variation for the log cell area growth in a confined space, numerically model them and present the reader with working algorithms. Finally, based on the growth patterns of another 48 CHO monoclones observed over a 16 day period, and their titer and viability measurements, we find the correlation coefficients with our calculated growth variables, and titer and viability measurements, and show that our derived growth variables can be used to predict the productivity and the health of a cell. Thus, we conclude our study by demonstrating that the productivity and the health of a cell (also the overall population) are interdependent.
0
0
math.DS 2026-07-02

Relativistic Kepler problem has periodic orbits at every negative energy

by Alberto Boscaggin, Guglielmo Feltrin +1 more

Periodic orbits with prescribed negative energy for relativistic Keplerian problems

Penalization plus blow-up analysis restores compactness for the critical singularity in all dimensions N≥2

abstract click to expand
Using a variational approach, we study the existence of periodic solutions with prescribed energy for the relativistic equation \begin{equation*} \dfrac{\mathrm{d}}{\mathrm{d}t}\left(\dfrac{m\dot x}{\sqrt{1-|\dot{x}|^{2}/c^{2}}}\right) = -\alpha \frac{x}{|x|^{3}} + \nabla W(x), \qquad x\in\mathbb{R}^{N}\setminus\{0\}, \end{equation*} where $W$ is a lower-order perturbation of the Kepler potential. The main difficulty stems from the fact that the Kepler singularity is critical for the associated Maupertuis functional, lying exactly at the boundary between the weak force and strong force regimes. To overcome the resulting lack of compactness, we use a penalization procedure and develop a suitable min-max scheme combined with a blow-up analysis of near-collision critical sequences. As a consequence, we establish the existence of periodic solutions on prescribed negative energy levels, obtaining non-perturbative results in every dimension $N\geq 2$.
0
0
math.DS 2026-07-02

Self-protection backfires by expanding addiction endemic region

by Fabio Sanchez

When Self-Protection Backfires: Adaptive Contact Behavior Expands the Endemic Basin in an Addiction Model with Nonlinear Relapse

Rational contact adjustment shifts the fold to lower R0, increasing chance of addiction establishment from smaller outbreaks.

Figure from the paper full image
abstract click to expand
We extend the Susceptible--Addicted--Reformed (SAR) model of \cite{sanchez2023}, which exhibits a forward--backward bifurcation driven by nonlinear relapse, by embedding an epi-economic behavioral layer in the spirit of \cite{fenichel2011}. At-risk individuals choose contact levels by solving a finite-horizon dynamic program that balances the utility of social activity against the expected cost of addiction. We prove that the basic reproduction number \( R_0 \) and the local stability of the addiction-free equilibrium remain unchanged by the behavioral layer. However, the endemic structure is fundamentally altered: the behavioral response collapses exactly to a scalar mixing factor \( M \), and the bifurcation curve factorizes as \( R_0(a) = R_{\rm cl}(a)/M(a) \). This yields an exact comparison principle: the saddle-node fold shifts to lower \( R_0 \) (enlarging the endemic basin) if and only if \( M \ge 1 \) along the branch. For rational self-protective behavior under conditional proportional mixing, we prove \( M \ge 1 \), so the basin enlarges; the opposite holds under frequency-dependent mixing. Numerical continuation shows that, at baseline parameters, the fold moves left by \( \Delta R_0 \approx -0.035 \) and the critical initial addiction level drops by 2--6 percentage points. Gillespie simulations confirm that the enlarged basin increases the stochastic probability of addiction establishment by up to threefold near threshold. This counterintuitive result that rational self-protection can make addiction easier to establish has direct implications for prevention policy.
0
0
math.NA 2026-07-02

Operator matching yields reliable long-time dynamics

by Yinong Huang, Jonah Botvinick-Greenhouse +1 more

Data-Adaptive Learning of Dynamical Systems by Matching Transfer Operators and Invariant Measures

Transition-statistics learning on adaptive meshes outperforms pointwise fitting under noise and sparse sampling in chaotic system identifica

Figure from the paper full image
abstract click to expand
Trajectory-based learning of dynamical systems is often fragile in the presence of noise, chaos, or sparse observations, as small pointwise errors can rapidly amplify. We introduce a transition-statistics approach to system identification that learns dynamics by matching the induced motion of probability mass across a data-adaptive mesh. Given trajectory data, we build an unstructured partition of state space and approximate the Perron--Frobenius operator with a regularized Ulam transition matrix. We replace hard cell indicators with continuous, piecewise-smooth partition-of-unity weights, yielding a Markov matrix supporting gradient-based optimization with respect to the parameters of a learned vector field. This enables two related training objectives: matching invariant measures through the stationary eigenvectors of the transition matrices, and matching the full transition matrices to capture transport between regions of state space. Numerical experiments on Lorenz-63, Lorenz-96, and a reduced-order NOAA sea surface temperature forecasting problem show that transition-statistics matching gives more reliable long-time dynamics than pointwise trajectory matching, particularly under measurement noise and sparse sampling. The approach provides a robust operator-theoretic alternative to trajectory-level losses for learning chaotic and partially observed dynamical systems.
0
0
math.DS 2026-07-02

Resonance structure repeats for large delays in forced ENSO model

by Samuel Bolduc-St-Aubin, Priya Subramanian +1 more

Resonance structure of a periodically forced delay differential equation model for the El Ni\~no--Southern Oscillation

Rotation number critical points organize resonance tongues at bifurcations and inside tori, with bistability via non-classical sequences.

Figure from the paper full image
abstract click to expand
We study resonance phenomena in the periodically forced Suarez--Schopf delay differential equation, which is a conceptual climate model for the El Ni\~no--Southern Oscillation (ENSO). The system serves as a prototypical forced delayed-action oscillator whose self-sustained oscillations, when subjected to periodic forcing, give rise to attracting invariant tori. We provide a comprehensive bifurcation analysis of both the unforced and the forced model; for the latter, we propose a method to compute the rotation number of normally hyperbolic attracting invariant tori. With it we show that resonance tongues in parameter space are organized by critical points of the graph of the rotation number, both along torus bifurcation curves and within the region of invariant tori. We also show that the resonance structure repeats for large delays, which constitutes a reappearance mechanism not previously reported in the literature. Furthermore, depending on the feedback strength, we find bistability between period-one orbits and invariant tori. This regime involves non-classical bifurcation sequences, including `saddle-node' and `gluing' bifurcations of tori.
0
0
cs.LG 2026-07-01

Weak integrals let kernel regression recover dynamics from noisy data

by Max Kreider, John Harlim +1 more

Learning dynamical systems from noisy data with Weak-form Kernel Ridge Regression

The method integrates equation residuals against test functions to damp noise before ridge regression, working on 64-dimensional chaos and 1

Figure from the paper full image
abstract click to expand
Accurate prediction of complex dynamical systems from noisy measurements remains a significant challenge in scientific computing. Kernel ridge regression learning strategies are often effective when applied to clean data, but have limited success with noisy data. Recent work has observed that a weak formulation can act to filter noisy data, and different learning strategies have achieved increased noise robustness with a weak-form framework. In this manuscript, we give an overview of the filtering mechanism behind the weak formulation and provide a bias-variance error decomposition. Using these insights, we combine a weak formulation with a kernel learning strategy to propose Weak-form Kernel Ridge Regression (WKRR) for learning dynamical systems. The proposed framework is simple to implement, effective for both clean and noisy data, and outperforms several baseline methods. We demonstrate the performance of WKRR on chaotic benchmark systems in up to 64 dimensions, as well as 15,000-dimensional real-world fluid data.
0
0
math.DS 2026-07-01

Linear hypergraph dynamics depends only on first-tail moments

by Moise R. Mouyebe, Anthony M. Bloch

Structural Visibility in Dynamical Systems on Hypergraphs: A Pattern Formation Perspective

Exposure-equivalent hypergraphs share dispersion relations and instability thresholds; nonlinear terms access additional structure.

Figure from the paper full image
abstract click to expand
Hypergraphs encode rich multiway interactions, but not all structural information is equally accessible through the dynamics. By analyzing pattern-forming instabilities in reaction-diffusion systems on directed hypergraphs, this work develops a theory of structural visibility that characterizes which features of higher-order structure survive successive levels of dynamical reduction. It is established that higher-order structure is not automatically dynamically relevant. Linearization destroys most higher-order information. Meanwhile, nonlinear reduction recovers only specific higher-order marginals of the adjacency tensor, and projection along critical directions further filters what is dynamically visible. First, we show that the linearized dynamics depends on the hypergraph only through its first-tail-moment statistics, termed exposure. Consequently, exposure-equivalent hypergraphs are linearly indistinguishable in the sense that they exhibit identical dispersion relations and instability thresholds. Next, we define a hierarchy of hyperedge tail-moments that captures progressively detailed co-occurence, and we prove a structural decomposition theorem describing how contractions of these tensors, termed packing effects, influence the reduced amplitude dynamics. This leads to a visibility hierarchy in which successive asymptotic orders reveal increasingly richer structural information. More specifically, exposure governs linear onset while packing effects control post-onset dynamics. Finally, we establish results on nonlinear distinguishability, characterizing when linearly indistinguishable higher-order systems may exhibit different post-onset behaviors. In addition, we formalize when higher-order systems become dynamically indistinguishable from pairwise systems, leading to the notion of dynamical graph surrogacy. Numerical simulations support the theoretical predictions.
0
0
math.DS 2026-07-01

Filters split antagonistic dynamics into three delay-stability regimes

by Alexander Omelchenko

Implementation Filters and Delay-Budget Instability in Coupled Replicator--Mutator Dynamics

Hard lags sum while implementation rates set separate margins, so only certain reductions restore stability in the intermediate window.

Figure from the paper full image
abstract click to expand
We model an adaptive contest in which two antagonistically coupled populations continually reallocate effort among competing methods, but decisions are not fielded instantly. Each side has an intended portfolio and a deployed portfolio: intended reallocations follow delayed observations of the opponent, while deployment follows intent through a first-order implementation filter. Under barycentric balance and uniform exploration, the linearized scalar branches have a characteristic factor in which hard observation and deployment lags enter only through their total sum, whereas implementation rates enter through real filter factors that cannot be absorbed into selection or exploration. In the strictly antagonistic class, negative spectral branches split into three regimes: weak branches have no positive-frequency crossing, intermediate branches lose stability through a delay-induced Hopf bifurcation, and strong branches are at or beyond the implementation-filter instability margin already at zero hard delay. This gives an operational delay-budget rule: in the delay-induced window, reducing any hard lag has the same first-order stabilizing leverage at onset; in the filter-induced regime, hard-lag reduction alone cannot restore stability. Balanced scalar performance observables generically show a mean shift and a second harmonic at twice the compositional frequency, and under strict antagonism the two performance signals are locked in antiphase with fixed amplitude ratio. For a baseline branch, a finite-dimensional Hopf normal-form calculation gives a negative cubic coefficient, and direct simulations reproduce the predicted threshold, amplitude scaling, and observable signatures. Motivating applications include cybersecurity and rapid technological countermeasure adaptation.
0
0
physics.soc-ph 2026-07-01

Matching feedback splits groups into selective and non-selective even with identical targe

by Alexandros Gelastopoulos

Feedback dynamics in matching networks drive behavioral differentiation despite overlapping objectives

When encounters are frequent, one side rejects most offers and the other accepts almost any, despite overlapping target rates.

Figure from the paper full image
abstract click to expand
Many bipartite social networks exhibit pronounced asymmetries in selectivity and matching opportunities: members of one side can afford to be highly selective, while members of the opposite side are forced to accept less desirable matches. While it is natural to try to explain this asymmetry in terms of the intrinsic characteristics of the two sides or other exogenous factors, here we show that such asymmetries can also emerge endogenously through a feedback process generated by the matching process itself: as one side becomes more selective, the other side is pushed to be less selective due to reduced matching opportunities, and vice versa. We develop a model in which individuals repeatedly form one-to-one matches across two groups and adapt their selectivity to achieve a target matching rate. Using both analytic and numerical methods, we show that when encounters are sufficiently frequent, the unique equilibrium is for one group to be highly selective and the other non-selective. This qualitative outcome holds even for heterogeneous groups with overlapping, almost indistinguishable distributions of target matching rates. The model makes several testable predictions, and it provides a mechanism for behavioral differentiation in repeated matching environments, with applications ranging from online dating to hiring and housing markets.
0
0
math.DS 2026-07-01

Block sub-additive potentials equate pseudo-orbit pressures to standard ones

by Fangzhou Cai, Jie Li

Pressure for the space of average pseudo-orbits with block sub-additive potentials

Local variational principle shows they match pressures of induced sub-additive potentials in the ergodic case.

abstract click to expand
In this paper, we introduce the concept of block sub-additive potential. The topological and measure-theoretic pressures are then defined for the space of average pseudo-orbits relative to any block sub-additive potential and any open cover of a given compact metric space. A local variational principle connecting these pressures is established, and it is further proven that they are equivalent to the corresponding topological and measure-theoretic pressure (in the ergodic case), respectively, defined for the induced sub-additive potential and the specified open cover. Additionally, the global versions of these concepts are also investigated, and a result that bridges the global and local perspectives is presented.
0
0
q-bio.PE 2026-07-01

Full ITN use by one host can raise disease in another

by Shravani Shetgaonkar, Anupama Sharma

Nonlinear Feedbacks Between Host Behavior and Vector Adaptation in a Multi-Host Vector-Borne Disease Model

Vectors redirect bites when nets protect the primary host, increasing transmission to the secondary host in the model.

abstract click to expand
Insecticide-treated nets (ITN) are an effective and low-cost intervention for controlling vector-borne disease (VBD), however, their use depends on individual decisions based on perceived cost and risk of infection. This study investigates a nonlinear multi-host model for the transmission of VBD with endogenous strategic control. We assume that hosts' adoption of ITN emerges from the payoff-based decision-making, creating a nonlinear coupling with disease prevalence. We model vector preference as a function of ITN coverage to probe the complex interplay among individual choices, disease prevalence, and its control in a multi-host setting. The qualitative behavior of the system is characterized by the thresholds $R_0$ and $R_c$, which determine the existence and local stability of the disease-free and endemic equilibria. The system exhibits rich dynamical behavior; hence, we provide a bifurcation analysis identifying the conditions for saddle-node and Hopf bifurcations. Our results demonstrate that the interaction between the perceived cost of ITN and the infection risk can induce critical transitions, including regime shift from stable endemic states to sustained periodic oscillations. Furthermore, we identify a counterintuitive effect whereby complete ITN adoption by the primary host can increase the overall prevalence in the secondary host due to adaptive shifts of vector feeding behavior.
0
0
cs.CR 2026-07-01

TDA-LSTM hybrid reaches AUC 1.000 on CIC-IDS2017

by Amar Jeet, Bhaskar Ranjan Karn +1 more

Hybrid Topological Data Analysis and LSTM Networks for Enhanced Network Intrusion Detection Using CIC-IDS2017 Dataset

Model combines persistence diagrams with LSTM layers to separate normal traffic from 14 attack types in 2.8 million flows.

Figure from the paper full image
abstract click to expand
Network intrusion detection systems (NIDS) are crucial in cybersecurity infrastructure, needing advanced techniques to detect hostile activity in network traffic. This research introduces a hybrid approach that combines Topological Data Analysis (TDA) with Long Short-Term Memory (LSTM) networks to improve anomaly detection in network security. Our multi-layered design combines TDA's persistent homology with LSTM networks to capture topological characteristics of network traffic patterns and simulate temporal sequences. We assessed our methodology using the CIC-IDS2017 dataset, which includes over 2.8 million labelled flows, 77 network variables, and 14 attack categories that reflect modern threat landscapes such as DDoS, brute force, web attacks, penetration, and botnet activities. Integrating Betti curves and persistence diagrams with deep learning architectures enhances feature extraction performance. Our hybrid TDA+LSTM model has an AUC of 1.000 and F1-score of 1.000, with 5-fold cross-validation producing a mean AUC of 1.000 $\pm$ 0.000 and mean F1 of 0.999 $\pm$ 0.001. An ablation research demonstrates the complimentary contributions of topological (F1=0.990) and temporal characteristics (F1=1.000). Comparative research shows that the suggested strategy beats TDA+Random Forest (F1=0.994) and Isolation Forest (F1=0.835) baselines in several attack categories.
0
0
math.DS 2026-07-01

Log potentials admit one to five symmetric Dziobek configurations

by Thiago Dias, Ya-Lun Tsai

Generalized Laura-Andoyer equations and the enumeration of some symmetrical classes of Dziobek configurations

Algebraic sampling shows generic totals of one through five for any dimension when two extra masses lie on the simplex axis

abstract click to expand
We study the symmetrical Dziobek configurations where, in $\mathbb{R}^{d}$, there are $d$ bodies with unit masses at the vertices of a regular $(d-1)$-dimensional simplex of unit edge length and two more bodies with nonzero masses $s,k$ are on the line passing through the center of the simplex and being orthogonal to it. In the case of logarithmic potential, the finiteness is proved for all $s,k\neq 0, d>1$, and we obtain the bifurcation surface in the $(s,k,d)$-space through Gr\"obner basis computation. Using cylindrical algebraic decompositions, we find $197232$ sample points in the complement of the bifurcation surface. We propose a method to reduce the number to only $202$. By Hermite's root counting theorem, we find that, generically, there can be $0,1,2,3$ or $4$ concave, $1,2,3, $ or $4$ convex, and in totality, $1,2,3,4$ or $5$ such configurations for all dimensions $d>1$. For positive $s$ and $k$, generically, there is a unique convex configuration, while the number of concave ones can be $0,2$ or $4$. All possible combinations for the numbers described above are realized when $d=2$. We obtain a set of generalized Laura-Andoyer equations equivalent to the central configurations equations for all fixed number of bodies $n=d+h$ and configuration dimension $d$. For homogeneous force law with exponent $a\in \mathbb{R}$, we use the action of permutation group $S_d$ in the Laura-Andoyer equations to reduce the equivalent $\binom{d+2}{2}\binom{d}{2}$ Laura-Andoyer equations to only two generalized polynomial algebraic equations for the studied class of symmetric configurations with two variables representing the positions of the two bodies not at the vertices of the simplex in four parameters $a,d,s,k$.
0
0
math.NT 2026-07-01

Exactly seven real quadratic fields meet Hammarhjelm condition

by Zeev Rudnick

The classification of real quadratic fields which satisfy Hammarhjelm's condition

Discriminants 8, 5, 13, 29, 53, 173 and 293 are the only ones where the ring of integers has unique factorization and the lattice avoids the

abstract click to expand
A real quadratic field satisfies Hammarhjelm's condition if its ring of integers has unique factorization, and the Minkowski lattice of its ring of integers contains no point in a certain rectangle determined by the fundamental unit. Such fields have recently appeared in the study of visible points in algebraic cut-and-project sets. We prove that there are exactly seven real quadratic fields satisfying Hammarhjelm's condition, namely those with discriminant 8, 5, 13, 29, 53, 173, 293. The proof is based on showing that for such fields, the fundamental unit is small relative to the discriminant, together with genus theory and Biro's classification of class number one fields in Yokoi's family.
0
0
math.PR 2026-07-01

Free SDEs gain global well-posedness under local Lipschitz conditions

by Jiaxin Wei, Zhi Yin

Well-posedness and stationary distribution of free stochastic differential equations

Local operator Lipschitz and Lyapunov conditions ensure unique solutions and stationary distributions in noncommutative probability spaces.

abstract click to expand
This paper studies free stochastic differential equations driven by free Brownian motion. Under local operator Lipschitz and Lyapunov-type conditions on the coefficients, we prove the global well-posedness of solutions in the noncommutative probability setting using free It\^o calculus. We further establish the existence and uniqueness of stationary solutions under appropriate dissipativity conditions. Our results extend classical theory to the free probability framework.
0
0
math.GR 2026-07-01

PSL_2(R) action on discrete subgroups is concretely classifiable

by George Peterzil

Classification of Fuchsian groups with torsion

Extends surface classification to orbifolds with torsion and yields homogeneity for certain ergodic actions.

abstract click to expand
In their recent paper, Bergfalk and Smythe prove that the isometry equivalence relation on hyperbolic surfaces with finitely-generated fundamental group is concretely classifiable, and ask whether the same result holds true for 2-dimensional hyperbolic orbifolds, or equivalently, whether the action of $\text{PSL}_2(\mathbb{R})$ on its space of finitely-generated discrete subgroups is concretely classifiable. In this note we answer this question in the affirmative. We then use the result to prove that a nonsingular ergodic $\text{PSL}_2(\mathbb{R})$-space with nonelementary finitely-generated stabilizers is homogeneous, in similarity with a result of Stuck-Zimmer for lattices in semisimple lie groups. The main ingredients of our proof are Selberg's lemma and a result of Greenberg on commensurators.
0
0
nlin.CD 2026-07-01

Stochastic van der Pol model unifies bifurcations

by Shenglan Yuan, Xiang Zhou

Dynamics of Coupled Stochastic van der Pol Oscillators: Bifurcations, Synchronization and Chaos

One framework links these behaviors in coupled oscillators with noise and extends to large networks and collective patterns.

Figure from the paper full image
abstract click to expand
This work presents a comprehensive analysis of coupled stochastic van der Pol oscillators, a paradigm for understanding synchronization, bifurcations, and chaos in nonlinear systems subject to random fluctuations. The system comprises two or more oscillators with nonlinear damping, linear diffusive coupling, and additive Gaussian white noise. We develop a unified framework that systematically connects global bifurcations, synchronization phenomena, and chaotic dynamics within a single coherent stochastic model. We explore the stochastic dynamics of coupled van der Pol oscillators by seamlessly blending theoretical principles with in-depth numerical simulations. This integrated approach forms a robust framework for analysis, with essential phenomena clearly depicted in the accompanying figures. We then extend this framework to a comprehensive investigation of large networks, focusing on their continuum limit, emergent pattern formation, the role of noise, and the onset of collective chaos.
0
0
math.DS 2026-07-01

Infinite spin ruled out at total collisions in R^d N-body problems

by Xiang Yu, Lei Zhao

Exclusion of Infinite Spin for N-body problem in mathbb{R}^d

When the limiting central configuration is isolated and spans dimension d or d-1, angular velocity stays finite as bodies collide.

abstract click to expand
We show that there is no infinite spin at total collisions for $-\kappa$-homogeneous N-body problem in higher dimensional Euclidean space $\mathbb{R}^d$, in which $0 < \kappa < 2$ ($\kappa = 1$ the Newtonian case), provided the limiting normalized central configuration is isolated and is of dimension d or d - 1. In the Newtonian case $\kappa = 1$, this extends the work of Moeckel-Montgomery to $d \ge 3$ and in the d = 3 case offers a different approach as compared to the current preprint of Pinzari-Zgliczynski.
0
0
math.SP 2026-07-01

Zero LE yields capacity convergence along rational frequency sequences

by Burak Hatinoğlu, Svetlana Jitomirskaya

Capacity and measure approximations for Schr\"{o}dinger operators

For continuous potentials the logarithmic capacity of phase-union spectra at rationals approaches that of the irrational quasiperiodic spect

abstract click to expand
We prove that logarithmic capacity convergence for phase-union spectra of quasi-periodic Schr\"{o}dinger operators in the zero Lyapunov exponent regime is robust, requiring only continuity of the potential. Let $S^+(p/q)$ denote the union, over the phase, of the spectra at rational frequency $p/q$. We show that if the Lyapunov exponent vanishes on the spectrum $\Sigma(\alpha)$ at an irrational frequency $\alpha$, then for every sequence $p_n/q_n\to\alpha$, the logarithmic capacities $Cap(S^+(p_n/q_n))\longrightarrow Cap(\Sigma(\alpha)).$ We also prove convergence of the corresponding harmonic measures. As a consequence, the equilibrium measures of $S^+(p_n/q_n)$ converge in the weak$^*$ topology to the density of states measure of the quasi-periodic Schr\"odinger operator. We extend these results to multi-frequency Schr\"odinger operators and prove analogous convergence theorems, for logarithmic capacity, harmonic measure, and equilibrium measure, for ergodic Schr\"odinger operators in a general setting where the almost sure spectrum is approximated in the Hausdorff metric by union spectra of periodic operators. This abstract formulation applies, in particular, to uniformly almost periodic potentials along sequences of almost periods. We also provide counterexamples when the limiting frequency is rational.
0
0
math.DS 2026-07-01

Shortest encounters between map trajectories follow extreme value laws

by Romain Aimino, Théophile Caby +2 more

Distributional results for the shortest distance between trajectories of different dynamics

The limit distribution is set by trajectory lengths, measure co-dimensions, and an extremal index for strongly mixing maps.

abstract click to expand
We establish Extreme Value Distributions for the closest encounter between trajectories generated by different maps defined in the same reference phase space. For a class of strongly mixing maps, we show that the limit distribution depends on the length of the different trajectories and the co-dimension of the associated invariant measures. It is also modulated by an Extremal Index, that informs on the tendency of nearby points to diverge along with the evolution of their respective dynamics, serving as an indicator of their compatibility. We give a formula for this quantity for a class of chaotic maps of the interval and for the co-dimension in the case when the respective measures admit densities with isolated zeros and singularities. We present diverse examples of systems satisfying these assumptions and compute the different parameters modulating the limit distribution.
0
0
math.DS 2026-06-30

Entropy controls Lyapunov continuity near max entropy

by Jérôme Buzzi

Discontinuity of Lyapunov exponents vs Entropy for smooth surface diffeomorphisms

Simplified argument shows exponents vary continuously for nearby measures in smooth surface diffeomorphisms.

abstract click to expand
Lyapunov exponents are fundamental invariants in smooth ergodic theory describing the asymptotic infinitesimal behavior along typical orbits. This text aims to explain how and why to control Lyapunov exponents using entropy for smooth surface diffeomorphisms. It fits into the framework of our recent joint works with Sylvain CROVISIER and Omri SARIG. We will focus especially on the continuity property of exponents for measures near the maximal entropy measure, by presenting a simplified version of the original argument. Our exposition is geared towards advanced students and researchers in dynamics that are not necessarily familiar with smooth ergodic theory.
0
0
math.DS 2026-06-30

Strong positive recurrence holds for all positive-entropy surface maps

by Jérôme Buzzi

Chaos on surfaces and beyond: a new notion of dynamical hyperbolicity

The property generalizes hyperbolicity yet yields exponential mixing and statistical limit laws.

Figure from the paper full image
abstract click to expand
We present some developments in the study of chaotic dynamics following the solution of a conjecture of Newhouse on the measures maximizing the entropy of smooth surface diffeomorphisms. We focus on \emph{strong positive recurrence}, a generalization of the classical Anosov-Smale theory of uniform hyperbolicity introduced in a joint work with Sylvain Crovisier and Omri Sarig. This new property is general enough to be satisfied by all smooth surface diffeomorphisms with positive entropy, yet it still ensures many quantitative properties such as exponential mixing or limit theorems for regular functions. We also present some open problems, including its abundance (or not) in higher dimensions.
0
0
math.DS 2026-06-30

Product flow attractor lattice equals coproduct of components

by William D. Kalies, Tony Wehbe

Compositionality of Global Dynamics in Product and Skew-Product Systems

Algebraic isomorphism under Conley theory lets global dynamics of combined systems be built directly from the factors.

Figure from the paper full image
abstract click to expand
We study the compositionality of global dynamics through attractor lattices and order structures of recurrent dynamics in product and skew-product systems using Conley theory. For product systems, these structures can be characterized algebraically in terms of the structure of component systems, where we prove that the attractor lattice of the direct product of two flows is isomorphic to the coproduct of the attractor lattices of the component flows. We also consider fast-slow, skew-product systems that arise from singular perturbation of a parameterized dynamical system. These results provide a framework for decomposing global dynamics into lower-dimensional subsystems and suggest computational approaches for constructing Conley-Morse representations through composition.
0
0
math.DS 2026-06-30

Actions stay nearly constant for exponential times in perturbed P-Steep systems

by Dario Bambusi, Santiago Barbieri +2 more

Nekhoroshev Theorem for time quasiperiodic perturbations of P-Steep systems

Extends Nekhoroshev stability to small time-quasiperiodic forcing with Diophantine frequency.

Figure from the paper full image
abstract click to expand
We prove a Nekhoroshev type result for a time quasiperiodic perturbation of an integrable Hamiltonian system. More precisely, we assume that the integrable part is analytic and fulfills a generic nondegeneracy condition introduced by Nekhoroshev and called P-Steepness. We add a small perturbation which depends in a quasiperiodic way on time (with Diophantine frequency) and prove that -- for times exponentially long with the inverse of the size $\varepsilon$ of the perturbation -- the actions of the unperturbed system remain approximately constant. The proof is based on an extension to the time dependent case of the proof {of classical Nekhoroshev's theorem} given by Guzzo, Chierchia and Benettin, which however requires new ideas in order to deal with the more complex geometry of resonances of the time dependent case.
0
0
math.DS 2026-06-30

Unique ergodicity is generic for tail-reversing infinite IETs

by Charles Fougeron, Sophie Schmidhuber

Rauzy-Veech Induction for Infinite-Type IETs

Any tail-reversing permutation yields a dense Gδ set of lengths producing uniquely ergodic maps under the ℓ¹ topology on the simplex.

Figure from the paper full image
abstract click to expand
We consider infinite-type IETs arising from elementary examples of finite-area translation surfaces of infinite genus such as the Baker's surface. We call such IETs tail-reversing and we show that for any tail-reversing permutation the subset of the simplex of lengths $\Delta$ for which the corresponding infinite-type IET is uniquely ergodic contains a dense $G_{\delta}$ set with respect to the $\ell^1$-topology. To this end, we generalize Rauzy-Veech induction to a large class of infinite-type IETs, where we prove a minimality criterion as a generalization of Keane's criterion in the finite setting. We then restrict ourselves to tail-reversing IETs and obtain our genericity result through a combinatorial analysis of their infinite-type Rauzy diagrams. Moreover, we derive an explicit condition for a tail-reversing IET to be uniquely ergodic by studying the diameter of its induction matrices.
0
0
math.DS 2026-06-30

Unimodular Pisot numerations yield torus groups

by Olivier Carton, Jake Sudbery +1 more

From some Pisot numerations to topological groups

Z_U, the p-adic-style group for zero-preserving systems, is continuously isomorphic to a torus precisely when the system is unimodular.

Figure from the paper full image
abstract click to expand
A Pisot numeration system $U$ for $\mathbb N$ is a sequence of natural numbers generated by an integral homogeneous linear recurrence whose characteristic polynomial is the minimal polynomial of a Pisot number. The purpose of this paper is to introduce the analogue of the group of $p$-adic integers for such numerations when they \emph{preserve zeros}, which is equivalent to the `Condition F' introduced by Frougny and Solomyak for $\beta$-numerations. We show that these topological groups $\mathbb Z_U$ project homomorphically onto a torus. Equipping $\mathbb Z_U$ with the appropriate topology, we also show that if $U$ is unimodular, then $\mathbb Z_U$ is continuously isomorphic to a torus.
0
0
math.OC 2026-06-30

Koopman eigenfunctions reduce nonlinear filtering to Riccati form

by Umesh Vaidya

Discovering the Kalman-Bucy-Koopman Filter

Parameterizing the Hamilton-Jacobi value function yields a linear-operator analogue of the Kalman-Bucy filter while keeping nonlinear dynami

Figure from the paper full image
abstract click to expand
This paper introduces the Kalman-Bucy-Koopman (KBK) filter, a novel framework for nonlinear state estimation grounded in Koopman operator spectral theory. The nonlinear estimation problem is formulated as a maximum-likelihood (Mortensen) estimator whose solution is characterized by a Hamilton-Jacobi (HJ) partial differential equation. The proposed KBK filter provides a spectral, operator-theoretic realization of this nonlinear filtering problem by parameterizing the HJ value function in terms of principal Koopman eigenfunctions. This transformation converts the nonlinear estimation problem into a Riccati-type evolution in Koopman coordinates, yielding a linear-operator analogue of the classical Kalman-Bucy filter while preserving nonlinear structure in the original state variables. We develop a path-integral formulation for computing principal Koopman eigenfunctions and introduce a dynamics-informed, characteristics-inspired basis construction for their approximation. Theoretical error bounds are derived for value-function and state-estimation approximations. Simulation results demonstrate improved performance over the extended Kalman filter and illustrate the ability of the KBK framework to operate in data-driven settings without explicit model linearization.
0
0
math.DS 2026-06-30

Stable invariant measures exist via stochastic integrals

by Valentin Gillet

Stable invariant measures in linear dynamics

For operators and semigroups on Banach spaces with dense bilateral backward orbits or rich eigenvectors.

abstract click to expand
We study the existence of stable invariant measures for operators and strongly continuous semigroups of operators on Banach spaces admitting either a dense bilateral backward orbit or a sufficiently rich family of eigenvectors. These invariant measures are realized as the distributions of stochastic integrals with respect to stable random measures. We also discuss invariant measures with other classes of distributions for such operators and semigroups.
0
0
math.DS 2026-06-30

Generalized ethanol metabolism model has stable equilibrium

by Manh Tuan Hoang, Thi Kim Quy Ngo +1 more

On a Generalized Compartment Model for Ethanol Metabolism in the Human Body

Broader nonlinear liver rate functions still lead to global asymptotic stability via quadratic Lyapunov analysis.

Figure from the paper full image
abstract click to expand
We introduce a generalized continuous-time compartment model of ethanol metabolism in the human body that extends a recently developed framework. In the proposed model, we replace the Michaelis-Menten mechanism of the liver's ethanol metabolism rate with a general class of nonlinear rate functions. This modification provides greater modeling flexibility and enables the model to capture a wider range of hepatic ethanol metabolism dynamics. The qualitative behavior of the proposed ethanol metabolism model is analyzed rigorously. More specifically, we investigate the positivity and boundedness of solutions, as well as the global asymptotic stability (GAS) of the unique equilibrium point using an appropriate quadratic Lyapunov function. Second, we formulate a discrete-time counterpart of the proposed continuous-time model and investigate its dynamical properties. We show that, under an appropriate condition on the time step size, the discrete-time model faithfully reproduces the qualitative dynamical behavior of the corresponding continuous-time system. Lastly, we conduct a series of numerical experiments employing several ethanol metabolism rate functions to support the theoretical results.
0
0
math.ST 2026-06-30

Differential algebra checks unique recovery of functions in DE models

by Torkel E Loman, Alexander P Browning +1 more

Structural functional identifiability and model discovery in differential equation models

Generalizing parameter identifiability shows when unknown components can be recovered uniquely from ideal observations.

Figure from the paper full image
abstract click to expand
Differential equation models are widely used to describe, interpret, and predict dynamical phenomena across science and engineering. In practice, however, the governing dynamics are rarely fully known and must be inferred from observational data. Traditionally, inverse problems in differential equation modelling have focused on estimating unknown parameter values. In this setting, structural identifiability determines whether parameter values can, in principle, be uniquely recovered from ideal observations and is, therefore, a prerequisite for meaningful inference. More recently, the integration of machine learning with mechanistic modelling has enabled the discovery of unknown equations, functions, and constitutive relationships, substantially expanding the space of admissible models. This raises a fundamental question: under what conditions can unknown functional components be uniquely recovered from data? In this paper, we generalise the classical notion of structural parameter identifiability to functional identifiability. We first identify broad classes of models for which unique functional recovery is impossible. We then show how functional identifiability can be assessed for differential equation models using differential algebra-based techniques which are well-established as a means of assessing structural identifiability for ordinary differential equation-based models. Our framework reveals new phenomena that arise in the transition from parametric to functional inference and have no analogue in the classical setting. Finally, we characterise functional identifiability in several common model classes. Taken together, our results demonstrate that functional identifiability provides a theoretical foundation for modern inverse problems in differential equation modelling, particularly those that use machine learning representations of unknown system components.
0
0
cs.CC 2026-06-30

Rule class decides if finding period-k attractors is easy or hard

by Alexander Drobyshev, Grigoriy Bokov

Cyclic Attractor Detection in Boolean Network Dynamics under Local Logical Constraints

Post lattice gives full dichotomy for fixed k: majority-like self-dual rules yield NP-completeness, affine rules stay polynomial.

Figure from the paper full image
abstract click to expand
Boolean networks are finite discrete nonlinear systems whose long-term behaviour is organised by fixed-point and cyclic attractors. Detecting such recurrent states is important in applications ranging from gene regulation and neural computation to complex-network models, but the computational boundary between tractable and intractable attractor analysis is still not fully understood. We study that boundary from the perspective of local logical rules. We consider Boolean networks under parallel update whose coordinate functions are given by circuits over a fixed finite basis of a closed Boolean-function class, and ask whether the network has a cyclic attractor of prescribed exact period $k$. For every fixed $k\ge 2$, we obtain a complete complexity dichotomy over Post's lattice. The problem is $\mathrm{NP}$-complete whenever the local rule class contains majority-like self-dual rules or one of the two mixed conjunctive-disjunctive monotone families. In all remaining Post classes it is polynomial-time solvable, with affine rules and pure conjunctive or pure disjunctive rules with constants providing the boundary tractable cases. The results show that exact attractor detection is governed not only by the network architecture but also by the logical mechanism of local update: affine and one-sided rules preserve algebraic or order structure, whereas majority-like and mixed monotone rules can encode global Boolean consistency constraints.
0
0
math.OA 2026-06-30

Noncommutative Wiener-Wintner theorem for amenable groups

by Panchugopal Bikram, Sudipta Kundu +1 more

Non-Commutative Wiener-Wintner theorem for amenable group actions

Decomposition into almost periodic and weakly mixing parts yields the result on finite von Neumann algebras.

abstract click to expand
Let $G$ be a locally compact second countable amenable group acting on a finite von Neumann algebra $(\mathcal{M},\tau)$ by trace-preserving automorphisms. In this article, we establish a Jacobs-de Leeuw-Glicksberg decomposition for this action, obtaining a decomposition of $\mathcal{M}$ into its almost periodic and weakly mixing components. As an application, we prove a noncommutative Wiener--Wintner theorem for amenable group actions on finite von Neumann algebras.
0
0
nlin.CD 2026-06-30

Risk sensitivity induces Arnold tongues in population game dynamics

by Konstantinos Metaxas, Themistoklis P. Sapsis

Risk-Sensitive Learning in Population Games under Extreme Events: Bifurcations and Chaotic Dynamics

Perceived risk from extreme events in congestion games leads to invariant curves, phase-locking, and chaos whose time averages reach equilib

Figure from the paper full image
abstract click to expand
Inspired by nonequilibrium phenomena in game dynamics and behavioral evidence on the impact of extreme events on decision making, we investigate the nonlinear dynamics of a discrete-time multiagent learning rule in population congestion games under extreme events affecting one of the actions. The population state, following a risk-sensitive variant of the Multiplicative Weights Update (MWU), is coupled with a belief variable capturing the agents perceived risk and updated through an adaptive expectation rule. We perform a two-parameter bifurcation analysis with respect to the agents controlled parameters, identifying regions of qualitatively distinct behavior. Equilibria are studied first from both game-theoretic and dynamical perspectives. The resulting two-dimensional system exhibits complex behavior, including multi-stability among fixed points, invariant curves, periodic and chaotic attractors. Despite this complexity, the attractors can be grouped into distinct families, while the Ces\`aro averages of the trajectories are shown to converge to the stationary equilibrium. The incorporation of risk associated with the extreme event leads to new dynamical phenomena: attracting invariant curves arise and give rise to phase-locking Arnold tongues, within which the dynamics is qualitatively similar. In this setting, codimension-two resonances are identified as organizing centers, both within individual tongues and along the bifurcation curves associated with the fixed-point family. Chaotic attractors emerge and are destroyed through Feigenbaum cascades and forward or reverse boundary crises, with interior and merging crises also observed, along with transient chaos and narrow periodic windows. For each qualitatively distinct region, representative phase portraits and the associated basins of attraction are examined.
0
0
quant-ph 2026-06-30

Drive timing, not strength, sets bit loss in Kerr-cat qubits

by Stephen Wiggins

Preparation-Space Diagnostics and Logical Information Loss in a Driven Kerr-Cat Qubit

Sudden quenches erase the encoded bit while smooth ramps of equal amplitude largely preserve it

Figure from the paper full image
abstract click to expand
A Kerr-cat qubit encodes a logical bit in the two wells of a parametrically driven nonlinear oscillator, and a logic gate is a transient change of the drive. In the phase plane the gate deforms the double well and can split its separatrix into a turnstile that carries trajectories across the dividing surface between the wells; the same pulse, acting on the quantum oscillator, can corrupt the encoded bit. We study this process over a disk of coherent-state preparations, comparing classical phase-space transport diagnostics with the open-system quantum outcome on a common domain so that the two can be compared point by point. The central finding is that the corruption depends on the full temporal protocol, not on pulse strength alone: a sudden quench erases the bit, whereas a smooth ramp of the same peak amplitude largely preserves it. A finite-time sensitivity field locates the classical transport boundary, and a Loschmidt echo evaluated near the end of the gate predicts the much later quantum outcome. Sweeps of pulse amplitude and width, of cat size, and of engineered two-photon dissipation map where the classical transport picture predicts the quantum loss of the bit and where it does not.
0
0
math.DS 2026-06-29

Melnikov method shows heteroclinic paths persist under small forcing

by Hanru Zou, Hongjun Gao +2 more

Metastable Transitions in Dynamical Systems with both Time-varying Perturbations and Degenerate Noise

The first-order shift in metastable transition rate is given explicitly for periodic perturbations in degenerate stochastic systems.

Figure from the paper full image
abstract click to expand
This paper investigates the persistence of maximum likelihood paths in degenerate stochastic differential systems and quantifies how small periodic perturbations modulate the metastable transition rate. Within the Freidlin--Wentzell large deviation framework, we reformulate the variational problem for MLPs as a Hamiltonian system via a partial Legendre transform. Under hyperbolicity and transversality conditions, we prove, using a geometric Melnikov method adapted to general time-dependent perturbations, that the corresponding heteroclinic connections persist for sufficiently small perturbations. For the periodic case, we derive a closed-form explicit expression for the rate change to first order in the forcing amplitude. Two illustrative examples are presented.
0
0
math.DS 2026-06-29

Periodic conjugacy data force C^{1+Holder} regularity for irreducible toral maps

by Zhenqi Jenny Wang

Global periodic-data rigidity for irreducible toral automorphisms

When the linearization is irreducible over the rationals, matching derivatives at periodic points imply the topological conjugacy is C^{1+Ho

abstract click to expand
We prove a global \(C^{1+\text{H\"older}}\)-rigidity theorem for Anosov diffeomorphisms of tori with irreducible linearization. Let \(f:\mathbb T^N\to\mathbb T^N\) be a \(C^2\) Anosov diffeomorphism with linearization \(A\in GL(N,\mathbb Z)\), and assume that \(A\) is irreducible. If, for every periodic point \(p=f^n p\), the linear maps \(Df_p^n\) and \(A^n\) are conjugate, then the Franks--Manning conjugacy between \(f\) and \(A\) is \(C^{1+\text{H\"older}}\). Thus, in the irreducible case, periodic data completely characterize global \(C^{1+\text{H\"older}}\)-rigidity. The proof does not assume conformality, uniform quasiconformality, simplicity of the spectrum, or any restriction on Lyapunov multiplicities. The main ingredient is a new partial-to-global rigidity mechanism combining geometric and analytic arguments. We first obtain partial cocycle rigidity on canonical conformal layers inside the Lyapunov blocks by geometric methods, and then promote this partial rigidity to full regularity of the conjugacy along the Lyapunov blocks by analytic methods. The same method yields a local rigidity theorem for \(C^1\)-small \(C^{1+\text{H\"older}}\) perturbations of \(A\).
0
0
cs.IT 2026-06-29

Ergodicity equates time averages to ensemble averages in LEO satellite networks

by Chang-Sik Choi, Francois Baccelli

Dynamical System Characterization of Heterogeneous Walker Satellite Networks: An Orbit-Aware Stochastic Geometry Perspective

Rational independence of rotation speeds allows computing downlink SINR coverage and throughput from the invariant measure for typical recei

Figure from the paper full image
abstract click to expand
Heterogeneous and in particular multi-altitude low Earth orbit (LEO) satellite constellations exhibit complex spatial and temporal structures, which require new modeling tools for their performance analysis. In this paper, we develop an orbit-aware stochastic geometry framework modeling today's LEO satellites on various orbits and various altitudes. In particular, we characterize such a system as the superposition of multiple Walker point processes and formulate it as a dynamical system determined by an initial condition and the rotation speeds of satellites and Earth. We show that when the speeds are rationally commensurable, the proposed satellite system is periodic. Then, we show that the system is ergodic when the speeds are rationally independent, establishing a theoretical link between time averages of the system and the expectation of it under the invariant measure. We derive the nearest-satellite distance distribution of a typical receiver at a given latitude and analyze the signal to interference-plus-noise ratio (SINR) coverage probability of the typical receiver. We then derive the ergodic throughput of the downlink communication to the typical receiver. Overall, the proposed framework offers a rigorous and tractable tool for analyzing downlink performance in Walker-type heterogeneous LEO satellite networks.
0
0
math.DS 2026-06-29

Hermitian form from unstable cocycle induces distance on Hénon components

by Fabrizio Bianchi, Yan Mary He

A thermodynamic path metric for complex H\'enon maps

The form tracks variations in the marked complex unstable multiplier spectrum and yields a distance via rigidity, as a higher-dimensional pr

abstract click to expand
We construct a Hermitian covariance form on hyperbolic components in parameter spaces of complex H\'enon maps, associated to the full complex unstable derivative cocycle. The form measures infinitesimal variations in the marked complex unstable multiplier spectrum. Using a recent multiplier rigidity theorem by Cantat--Dujardin, we prove that it induces a distance on every hyperbolic component. Motivated by Sullivan's dictionary and by the thermodynamic interpretation of the Weil--Petersson metric, our result gives a first higher-dimensional holomorphic-dynamical counterpart of pressure-type metric structures. On the other hand, the construction differs from the one-dimensional theory in an essential way: it replaces the real geometric potential measuring unstable expansion by the full complex unstable derivative cocycle. This also suggests a complex derivative cocycle counterpart to pressure-type metric structures in Teichm\"uller theory and Anosov representation theory.
0
0
math.DS 2026-06-29

Nudged system recovers ODE parameters from noisy partial observations

by Muhammad Jalil Ahmad, Animikh Biswas +1 more

A Data-Assimilation-Augmented Optimization Framework for Parameter Estimation in Dynamical Systems

Optimization of mismatch cost eliminates initial-condition dependence and lowers cost versus MCMC.

Figure from the paper full image
abstract click to expand
Parameter estimation in nonlinear dynamical systems from observational data is a fundamental inverse problem with applications in many disciplines. In practice, this is further complicated by the fact that observations are often noisy, sparse, and available only for a subset of the state variables. Furthermore, the initial condition (IC) may be unknown or inaccurate, causing further complications for chaotic systems with sensitive dependence on initial conditions. In this work, we develop a data-assimilation-augmented optimization framework for parameter estimation in ordinary differential equations using partial state observations. The method introduces a nudged system driven by the available observed component and estimates the unknown parameters by minimizing a cost functional, defined as a time-delayed mismatch between the observations and the corresponding observed component of the nudged solution over the admissible parameter space. Since the nudged system can be arbitrarily initialized, this approach eliminates the dependence on accurate IC. Using the Lorenz-63 system as a test case, we establish theoretical results showing synchronization of the nudged solution under parameter agreement, stability under parameter mismatch, and well-posedness of the data-to-parameter inverse map under suitable nondegeneracy conditions. Structural & practical identifiability, and Sobol sensitivity analyses are incorporated to assess which parameters can be reliably estimated from the observations. Numerical experiments in both chaotic and non-chaotic regimes show that this framework accurately recovers parameters from noisy partial observations. Comparisons with an on-the-fly parameter learning method and with Bayesian MCMC estimation demonstrate that the proposed method remains accurate under partial observations and higher noise levels while requiring substantially lower computational cost.
0
0
math.DS 2026-06-29

Orbit graphs and pullback drops close degree equations

by Tomoyuki Takenawa

Degree growth, orbit graphs, and functoriality for birational dynamical systems

Two families of relations from singularity patterns and non-functorial pullbacks produce closed linear recurrences for birational degree seq

Figure from the paper full image
abstract click to expand
The purpose of this paper is to give a natural divisor-theoretic formulation of the counting method introduced by Halburd for computing degree growth, in a form applicable to birational dynamical systems on varieties of arbitrary dimension. Instead of counting only preimages of special values, we follow time-indexed divisorial conditions through singularity patterns. These conditions are recorded on normalized finite-window orbit graphs, where the relevant multiplicities are realized as divisorial valuations of pullbacks of time-indexed divisors. This construction explains how the elementary computations appearing in singularity patterns can be interpreted as degree relations on a single normal variety. We then show that further relations arise from the failure of functoriality of pullbacks: when the center of a divisor enters the relevant indeterminacy locus, a degree-drop divisor appears. Under suitable finite-type assumptions, the two kinds of relations lead to closed linear difference systems governing degree sequences. Several examples, including higher-dimensional ones, demonstrate that the two mechanisms are complementary and that their combination determines the degree growth in cases where either mechanism alone is insufficient.
0
0
math.DS 2026-06-29

Alzheimer's model reaches one equilibrium when new plaque formation stops

by Ruoyun Lang, Hui Zhou

Global stability analysis of a mathematical model from Alzheimer's disease

System of differential equations converges globally to a unique positive steady state from any starting concentrations.

abstract click to expand
This study focuses on a mathematical model of Alzheimer's disease involving $\beta$-amyloid, cellular prion protein and their complex. The global asymptotic stability of the model indicates that the complex continues to induce neuronal damage regardless of the initial states. To investigate the dynamics of this system, we have rigorously proved that when the formation rate of new plaques is zero, the system is unconditional globally asymptotically stable without any limitation proposed in previous work. Numerical simulations further validate the theoretical analysis, regardless of the random initial state, demonstrating that the system consistently converges to a unique positive equilibrium. From a therapeutic perspective, we propose targeted therapeutic strategies and verify their effectiveness through numerical simulations. These results provide a universal theoretical basis for understanding dynamic mechanisms of Alzheimer's disease and offer critical guidance for developing targeted therapeutics.
0
0
math.SP 2026-06-29

Transfer operator framework yields absolute continuity of IDS

by Xianzhe Li, Zhenfu Wang +2 more

Transfer Operators, Canonical Center Dynamics, and Spectral Applications for Long-Range Operators

For quasi-periodic Schrödinger operators the center bundle reduces the spectral problem and implies Anderson localization.

Figure from the paper full image
abstract click to expand
We introduce an operator-theoretic framework for long-range operators over general dynamical systems with analytic hopping and small potential. By establishing a partially hyperbolic splitting on the fibered solution bundle, we define the Canonical Center Bundle (CCB) as the center subbundle of this splitting, which is shown to be globally trivial. The center bundle admits a representation via Riesz spectral projections of the transfer operator. Furthermore, we show that, in the local regime, the center bundle arising in this framework essentially coincides, in the sense of gap convergence, with the Intrinsic Center Bundles (ICB) obtained from finite-range approximations in \cite{GJ}. The partially hyperbolic structure thereby reduces the spectral problem to the center bundle, leading to a Johnson-type characterization of the spectrum in terms of the associated center cocycle. We then apply this framework to quasi-periodic Schr\"odinger operators with analytic hopping, large analytic potentials and Diophantine frequency. In this setting, the center cocycle is analytic and satisfies a Center Thouless formula. As consequences, we establish the absolute continuity of the integrated density of states (IDS), resolving a problem of Eliasson; prove quantitative H\"older continuity of the IDS, partially answering a question of You; and obtain Anderson localization for the original Schr\"odinger operators.
0
0
math.NA 2026-06-29

Residuals train neural dictionaries for reliable Koopman spectra

by George Coote, Matthew J. Colbrook

Residual-Guided Dictionary Learning for Spectrally Accurate Koopman Approximation

Minimizing a-posteriori DMD residuals plus a condition penalty yields cleaner eigenvalues and lower forecast error than fixed dictionaries.

abstract click to expand
Koopman theory promises linear structure in nonlinear dynamics, but numerical Koopman spectra are easy to compute and hard to trust. A finite EDMD matrix always has eigenvalues; the problem is that many of them may have nothing to do with the infinite-dimensional operator. In this paper we make spectral reliability the objective of dictionary learning. We train neural-network dictionaries not merely to predict the next snapshot, but to minimize Residual Dynamic Mode Decomposition residuals: operator-level a posteriori errors that test whether computed eigenvalues and modes are genuine Koopman spectral objects. To keep the learned observables from collapsing into an unstable coordinate system, the loss also penalizes the condition number of the lifted data matrix. Thus the method couples two requirements that should not be separated: small Koopman residuals and a well-conditioned representation. The result is a learned dictionary that is expressive, numerically stable, and spectrally disciplined. Across conservative and dissipative benchmark systems, the method sharply reduces spectral pollution, improves residual pseudospectral inclusion, and lowers forecast error relative to standard fixed dictionaries. On sea-surface temperature data, it gives cleaner Koopman diagnostics and substantially better one-step forecasts from noisy observations with no governing equations. The message is simple: neural Koopman learning should be judged not by prediction alone, but by whether its spectral claims can be certified. Residuals provide the certificate; conditioning makes it computable.
0
0
math.NT 2026-06-29

Grand orbit representatives dense on every abelian variety

by Kaiwen Lu

On Dense Orbit Transversality for Endomorphisms of Abelian Varieties

The density holds for arbitrary abelian varieties, removing the geometric simplicity requirement from earlier results.

abstract click to expand
Let $X/K$ be a smooth projective variety defined over a number field and $f:X\to X$ be a morphism defined over $K$. Assuming there exists a point in $X(K)$ whose $f$-orbit is Zariski dense in $X$ and up to replacing $K$ by a finite extension, Pasten and Silverman studied the distribution of grand $(f,K)$-orbits and proved that many sets of representatives of grand $(f,K)$-orbits on various classes of varieties are Zariski dense. In particular, they showed that if $X$ is a geometrically simple abelian variety, then all such sets of representatives are Zariski dense. We demonstrate the existence of a dense set of representatives for maps on all abelian varieties.
0
0
math.DS 2026-06-29

Generic parameters restrict exact lumping to obvious reductions

by Justin Eilertsen, Valery G. Romanovski +2 more

Lumping of reaction networks: Generic and critical parameters

Only elimination of non-reactants or projections along integrals survive for open sets of parameters; algorithms locate the special critical

Figure from the paper full image
abstract click to expand
We investigate linear lumping for parameter-dependent mass action reaction networks, distinguishing between generic and critical parameter regimes. For generic parameters -- those ranging in some non-empty open subset of parameter space -- we prove that exact linear lumping yields only "obvious" reductions: elimination of non-reactant species or projections along stoichiometric first integrals. This characterization extends to reaction networks with product-form kinetics, including Michaelis-Menten and Hill-type rate laws. For mass action systems we proceed to develop an algorithmic approach to identify critical parameter sets -- algebraic subvarieties in parameter space where non-trivial lumpings become available. This procedure reduces the determination of lumping maps to a system of finitely many polynomial equations. It also applies to constrained lumping scenarios (which are frequently motivated by chemical considerations). We then review and extend results about proper lumpings. Finally, we discuss lumpings of a self-replicator system, and of a two-pathway enzyme mechanism, to document the viability of our methods in relevant scenarios. Our results clarify the relationship between structural (parameter-independent) and fine-tuned (parameter-dependent) reductions, with implications for approximate lumping when system parameters lie near critical values
0
0
math.DS 2026-06-29

Singularities organize resonance tongues into six arrangements

by John Bailie, Priya Subramanian +1 more

Devil's terraces: determining the organization of resonance tongues in a periodically forced dynamical system

A resonance surface in a North Atlantic mixing model shows transitions between six global patterns arise from changes in boundary singularit

Figure from the paper full image
abstract click to expand
In periodically forced dynamical systems, resonance tongues are open regions of a parameter plane in which the dynamics on an invariant torus locks to a stable periodic orbit. While individual resonance tongues are well understood, the principles governing their global arrangement remain largely unexplored. We develop a topological framework, grounded in applied topology and Morse theory, whose central object is the two-dimensional resonance surface, defined as the graph of the rotation number $\rho$ over a parameter plane. Within this framework, resonance tongues appear as terraces of the resonance surface at rational values of $\rho$, and their global arrangement is determined by the singularities of this surface. Resolving the resonance surface requires the accurate computation of $\rho$, and we present an algorithm that does so efficiently and at high resolution. As a specific example, we examine a periodically forced model of vertical mixing in the North Atlantic, a process relevant to the Atlantic Meridional Overturning Circulation, and study how its resonance surface changes under variation of a third parameter. We identify six distinct resonance-tongue arrangements and show that the resonance transitions between them are due to changes in the number and type of singularities on the boundary of the resonance surface.
0
0
math.NT 2026-06-29

Lacunary orbits bound maximal gaps to (1/2)–((q+1)/(q-1)) log N/N a.e

by Yuval Peres, Bohan Yang

Maximal Gaps for Dilated Lacunary Integer Sequences

The largest empty interval among a1x … aNx mod 1 has liminf and limsup controlled by the growth ratio q for almost every x.

abstract click to expand
Let \((a_n)_{n\ge1}\subset\mathbb{N}\) be a lacunary sequence, \(a_{n+1}\ge q a_n\) for \(q>1\). For \(x\in\mathbb{T}\), we study the maximal empty circular gap \(G_N(x)\) of the finite orbit \(\{a_1x,\ldots,a_Nx\}\). We prove that, for Lebesgue-almost every \(x\), \[ \frac{1}{2} \le \liminf_{N\to\infty}\frac{NG_N(x)}{\log N} \le \limsup_{N\to\infty}\frac{NG_N(x)}{\log N} \le \frac{q+1}{q-1}\,. \] If, in addition, \(a_n\mid a_{n+1}\) for every \(n\), then this can be improved to \[ \lim_{N\to\infty}\frac{NG_N(x)}{\log N}=1 \] for Lebesgue-almost every \(x\).
0
0
math.DS 2026-06-29

Minimal measures dense for every entropy and integral in expanding systems

by Xiaobo Hou, Wanshan Lin +3 more

Abundance of minimal measures via entropy and multifractal analysis

The density holds for topologically expanding maps, transitive countable Markov shifts, and non-uniform symbolic systems via adapted multi-h

abstract click to expand
This paper investigates the distribution and abundance of minimal measures (measures supported on minimal sets) in various dynamical systems, extending the well-known density results for general ergodic measures. We introduce the conditional minimal-intermediate-entropy property, which asserts that for any given entropy $h$ and potential integral $a$, the set of ergodic minimal measures satisfying $h_\mu(f)=h$ and $\int \varphi d\mu = a$ is dense in the set of invariant measures satisfying these conditions. We establish that the conditional minimal-intermediate-entropy property holds for three broad classes of systems: topologically expanding maps (including topologically Anosov systems), transitive countable Markov shifts, and symbolic systems with non-uniform structure. Our proofs rely on a constructive multi-horseshoe technique adapted to handle challenges of non-compactness and non-uniformity.
0
0
math.DS 2026-06-29

Stable sets determine conditional entropy for amenable actions

by Xinyao He, Guohua Zhang

Dimensional entropy of amenable group actions over stable sets and fibres

Dimensional entropy on stable sets equals topological conditional entropy, and fiber dimensional entropy equals relative entropy of factor m

abstract click to expand
This paper is devoted to the study of Bowen's dimensional entropy on subsets for actions of amenable groups. We prove three main results. (1) First, topological conditional entropy is characterized by the dimensional entropy of stable sets (Theorem 1.1), answering a question of Dou, Wang and the second author of the present paper raised in [Fund. Math., 2025]. We remark that our Theorem 1.1 is the first characterization of topological conditional entropy via Bowen's dimensional entropy of stable sets even for $\mathbb{Z}$-actions. (2) Second, we establish a dimensional entropy inequality for factor maps (Theorem 1.2). It relates dimensional entropy of a set to that of its image and topological entropy of fibres, and may be viewed as the dimensional-entropy counterpart of the factor-map inequality for packing topological entropy due to Dou, Zheng, and Zhou proved as Theorem 1.4 in [Ergodic Theory Dynam. Systems, 2023]. (3) Third, the relative topological entropy of a factor map is determined by the dimensional entropy of the fibres (Theorem 1.3). Notably, our proof of this formula (Theorem 1.3) is purely topological, in contrast to the recent measure-theoretic approach of Dou, Wang and Zhou based on relative Shannon--McMillan--Breiman theorems. These results (Theorem 1.2 and 1.3) not only generalize the work of Oprocha and the second author of the present paper [Nonlinearity, 2011] from single transformations to amenable group actions, but also provide a purely topological and self-contained proof of a fibre entropy characterization recently obtained through measure-theoretic arguments.
0
0
math.SP 2026-06-29

Stabilization cost rate equals Lyapunov exponent on Aubry-André chain

by Nassim Athmouni, Nejib Brahmia +1 more

The cost rate of nonlinear remote stabilization on the Aubry--Andr\'e lattice: a reflected off-spectral exponent and the sharp identity for almost every phase

The energy needed to control a distant site grows at the off-spectral cocycle rate for every phase when coupling is subcritical or critical.

Figure from the paper full image
abstract click to expand
We study the exponential rate $r(\alpha,\lambda)$ of the energy $\mathcal{E}_N$ needed to steer a far site, at distance $N$, of an Aubry--Andr\'e chain $H_\lambda$ via one boundary actuator with closed-loop margin $\alpha$. An exact eigenbasis reduction writes $\mathcal{E}_N$ as a Cauchy quadratic form $\tilde b^\top C^{-1}\tilde b$ in the boundary-amplitude ratios, whose rate is the off-spectral Lyapunov exponent of the transfer cocycle at the reflected band edge $z^\star=2E_{\min}-2\alpha-E_{\max}$, giving $r(\alpha,\lambda)=\gamma_\lambda(z^\star)$. The rate lies in a bracket of width $\log_+(\lambda/2)$ whose ends coincide for $\lambda\le2$, the spectrum having logarithmic capacity $\max(1,\lambda/2)$. We prove the identity unconditionally, for every phase, on the whole metallic--critical range $0<\lambda\le2$: for $\lambda<2$ through subcritical almost reducibility as the sole external input, and at $\lambda=2$ because the Green's function there equals the Lyapunov exponent. For $\lambda>2$ the upper bound is unconditional, and the lower bound takes localization as its only external input: an inverse-free cocycle form makes $\mathcal{E}_N$ a cancellation-free positive sum, and a Christoffel--Darboux identity collapses its coefficients to $|c_k|=Q(\delta_k)(\hat\psi^{(k)}_N)^2$, where band-edge near-degeneracies cancel. With a three-distance lemma this yields $r=\gamma_\lambda(z^\star)$ at every Diophantine frequency and almost every phase, with gap $O(N^{-2/(2+\tau)})$ for type $\tau$ ($N^{-2/3}$ at bounded type), unconditionally for $\lambda\ge\lambda_1$ and under a polynomial-prefactor localization hypothesis for $2<\lambda<\lambda_1$. The relative gap $1-r/\gamma_\lambda(z^\star)$ vanishes at both ends of the localized phase, with $g_{\mathbb{C}\setminus\Sigma_\lambda}(z^\star)\to\operatorname{arccosh}3$ as $\lambda\to\infty$.
0
0
math.DS 2026-06-29

McMullen maps host rabbit and aeroplane baby Julia sets

by Suzanne Boyd, Kelsey Brouwer

Paper Fortune Tellers in Julia sets of Generalized McMullen maps II: Sidecars and Zippers

The basilica combinatorial model extends directly to other quadratic types from Mandelbrot bulbs with no renormalizations required.

Figure from the paper full image
abstract click to expand
We study the family of complex rational functions known as Generalized McMullen maps, F(z) = z^n + a/z^n+b, for integer n at least 3 fixed, and complex parameters a, b with a nonzero. In prior work by the same authors, we provided a combinatorial model for a large class of maps whose Julia sets contain both infinitely many homeomorphic copies of quadratic Julia sets conjugate to the ``basilica'', and infinitely many subsets homeomorphic to a set which is obtained by starting with the basilica, then changing a finite number of pairs of external ray landing point identifications, following an algorithm we described. In this article, we generalize beyond the basilica, and provide a catalog of additional types of hyperbolic Julia sets of Generalized McMullen maps, where the ``baby'' Julia set can be any rabbit, aeroplane, or Kokopelli quadratic Julia set; that is, where the c-value can be taken from any bulb attached to the main cardioid of the Mandelbrot set, or from the main cardioid of any principal baby Mandelbrot set (no renormalizations).
0
0
math.OC 2026-06-29

ILTS-SINDy recovers nonlinear dynamics models from data with up to 20% outliers by first…

by Fabio Amaral, Geovani N. Grapiglia +1 more

Robust Sparse Identification of Nonlinear Dynamics via Least Trimmed Squares

ILTS-SINDy decouples outlier detection from sparse regression and maintains accuracy with up to 20% corrupted observations.

Figure from the paper full image
abstract click to expand
In this work, we propose a robust Sparse Identification of Nonlinear Dynamics (SINDy) pipeline for handling datasets corrupted by noise and outliers. The method decouples outlier filtering from sparse regression by combining Iterative Least Trimmed Squares (ILTS) with Sequentially Thresholded Least Squares (STLS). Unlike standard approaches that treat all observations uniformly within a single regression stage, the proposed ILTS-SINDy framework first applies an ILTS procedure that iteratively minimizes the sum of the smallest squared residuals to identify the most reliable observations without prior knowledge of outliers, after which STLS is used to recover a parsimonious governing model. Extensive numerical experiments show that ILTS-SINDy can significantly outperform existing robust SINDy variants across a range of outlier contamination levels, with performance maintained even under settings with up to $20\%$ corrupted observations.
0
0
physics.flu-dyn 2026-06-29

Subtracting nonlinear terms lets DMD recover linearized flow dynamics

by Benjamin Herrmann, Katherine Cao +3 more

Data-driven linear analysis of turbulent flows

The NSDMD method approximates the mean-flow linearized operator from standard simulation snapshots for use on channel and aircraft flows.

Figure from the paper full image
abstract click to expand
Mean-flow-based linear analyses of turbulent flows, such as resolvent analysis, provide valuable insight about flow structures and their dynamics that has been widely leveraged to model, control and understand the underlying flow physics. However, these analyses are computationally expensive for flows over complex geometries and require the use of specialized codes that are typically only available in research environments. On the other hand, data-driven modal decompositions, such as the dynamic mode decomposition (DMD), identify turbulent flow structures that, although statistically relevant, do not provide insight into the physical mechanisms driving their dynamics. Here we introduce a novel data-driven method -- nonlinearity-subtracted DMD (NSDMD) -- that leverages knowledge of the structure of the Navier--Stokes equations to ensure that the learned operator is a low-rank approximation of the underlying mean-flow-linearized dynamics. Specifically, the method uses snapshots of the nonlinear terms in the perturbation equations to explicitly account for the contribution of the nonlinear forcing to the dynamics. We demonstrate the use of NSDMD to perform data-driven resolvent analysis on direct numerical simulation (DNS) and large-eddy simulation (LES) datasets, starting with a minimal channel flow and scaling up to the flow over a full aircraft model. As a result, NSDMD allows performing linear analyses of turbulent flows as a post-processing step on simulation data obtained with any available high-fidelity computational fluid dynamics (CFD) code.
0
0
physics.soc-ph 2026-06-29

Media sources drive drifting of opinion clusters in bounded-confidence models

by Oliver Zheng, Mason A. Porter

Drift Behavior in a Bounded-Confidence Opinion Model with Media Influence

An extended Deffuant-Weisbuch model shows a large cluster shifting toward one of two fixed media agents, with speed set by interaction param

Figure from the paper full image
abstract click to expand
People's opinions can change both from their interactions with each other and from their interactions with media sources. Bounded-confidence models (BCMs) of opinion dynamics provide one framework to study such dynamics. In a BCM, the nodes of a network are agents with continuous-valued opinions, and these agents interact with each other via the edges of the network. In this paper, we extend the original Deffuant--Weisbuch (DW) BCM by incorporating influence from two media sources -- one with a positive value and one with a negative value -- to capture the effects of a polarized media landscape. We show both numerically and analytically that our extended DW model exhibits drifting behavior in which a large cluster of opinions shifts toward one of the media agents. We analyze how the drift trajectory and speed depend on the model parameters, and we identify conditions in which drift is promoted or suppressed. Our results provide insight into how competing media sources can influence collective opinion formation in social systems.
0
0
math.SG 2026-06-29

Infinite ECH capacities obstruct Anosov flows in four dimensions

by Gabriel Beiner

Infinite ECH Capacities and Anosov Flows

Cotangent disk bundles over genus-at-least-two surfaces cannot carry Reeb or Hamiltonian Anosov flows, settling Herman's 1998 question in 4D

Figure from the paper full image
abstract click to expand
This article relates the theory of embedded contact homology (ECH) with the dynamics of Anosov flows. We show that in many cases the ECH capacities of a symplectic 4-manifold are infinite, including cotangent disk bundles over closed oriented surfaces of genus at least two. We prove that ECH obstructs Reeb Anosov and Hamiltonian Anosov flows, addressing the four-dimensional case of a question posed by Herman in 1998. Further, we obtain Floer-theoretic obstructions to a 3-manifold admitting any Anosov flow. As an application, we give new constraints on the existence of embedded Lagrangians of genus at least two in symplectic 4-manifolds. In an appendix, some related results in all dimensions are proved for capacities constructed from rational symplectic field theory.
0
0
math.DS 2026-06-29

Continua admit pointwise periodic maps with any polynomial entropy

by Maša {DJ}orić, Jelena Katić +1 more

A flexibility result for polynomial entropy of pointwise periodic homeomorphisms

Examples achieve every value including positive ones, in contrast to the zero result on manifolds and dendrites.

Figure from the paper full image
abstract click to expand
We construct a family of continua and pointwise periodic homeomorphisms realizing arbitrary polynomial entropy values in $[0,+\infty]$. In particular, this provides examples of pointwise periodic homeomorphisms with positive polynomial entropy. This contrasts with the fact that pointwise periodic homeomorphisms on connected manifolds and local dendrites have zero polynomial entropy.
0

browse all of math.DS → full archive · search · sub-categories