Very sparse return sets in arithmetic dynamics

She Yang

Home/Archive/arXiv

arXiv · 2609.32181

Very sparse return sets in arithmetic dynamics

She Yang

View original source ↗Read source document ↗Export metadata ↓

Abstract

When studying the dynamical Mordell-Lang conjecture by using the $p$-adic method, experts have found that return sets of the $p$-adic version of the DML problem can be very sparse. In this article, we investigate the similar phenomenon for a complex analytic version of the DML problem and the DML problem for backward orbits.

Explore related subjects

math.DS math.AG math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

She Yang. 2026-09-26. Very sparse return sets in arithmetic dynamics. https://arxiv.org/abs/2609.32181

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

KEEP EXPLORING

Related papers

arXiv2026

Markov matrix perturbations to optimize dynamical and entropy functionals

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

math.DS↗

arXiv2026

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

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

math.DS↗

arXiv2026

Polynomial Interpolation of a Vector Field on a Convex Polyhedral Domain

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

math.DS↗