Search arXivSearch

arXiv · 2211.05038

An Algorithmic Pipeline for Solving Equations over Discrete Dynamical Systems Modelling Hypothesis on Real Phenomena

Abstract

This paper provides an algorithmic pipeline for studying the intrinsic structure of a finite discrete dynamical system (DDS) modelling an evolving phenomenon. Here, by intrinsic structure we mean, regarding the dynamics of the DDS under observation, the feature of resulting from the "cooperation" of the dynamics of two or more smaller DDS. The intrinsic structure is described by an equation over DDS which represents a hypothesis over the phenomenon under observation. The pipeline allows solving such an equation, i.e., validating the hypothesis over the phenomenon, as far the asymptotic behavior and the number of states of the DDS under observation are concerned. The results are about the soundness and completeness of the pipeline and they are obtained by exploiting the algebraic setting for DDS introduced in [10].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alberto Dennunzio, Enrico Formenti, Luciano Margara, Sara Riva. 2022-12-19. An Algorithmic Pipeline for Solving Equations over Discrete Dynamical Systems Modelling Hypothesis on Real Phenomena. https://arxiv.org/abs/2211.05038

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

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS