English
Related papers

Related papers: Random functions from coupled dynamical systems

200 papers

A numeration system originally implies a digitization of real numbers, but in this paper it rather implies a compactification of real numbers as a result of the digitization. By definition, a numeration system with $G$, where $G$ is a…

Dynamical Systems · Mathematics 2007-05-23 Teturo Kamae

In this paper we will attempt to answer the following question: what are the natural quantum subsystems which emerge out of a system's dynamical laws? To answer this question we first define generalized tensor product structures (gTPS) in…

Quantum Physics · Physics 2024-07-17 Paolo Zanardi , Emanuel Dallas , Faidon Andreadakis , Seth Lloyd

We introduce functions for relative maximization in a general context: the beta and alpha applications. After a systematic study concerning regularities, we investigate how to approximate certain values of these functions using periodic…

Dynamical Systems · Mathematics 2007-05-23 Eduardo Garibaldi , Artur O. Lopes

Any infinite sequence of substitutions with the same matrix of the Pisot type defines a symbolic dynamical system which is minimal. We prove that, to any such sequence, we can associate a compact set (Rauzy fractal) by projection of the…

Dynamical Systems · Mathematics 2013-01-31 Pierre Arnoux , Masahiro Mizutani , Tarek Sellami

Let $\Lambda$ be a countable index set and $S=\{\phi_i: i\in \Lambda\}$ be a conformal iterated function system on $[0,1]^d$ satisfying the open set condition. Denote by $J$ the attractor of $S$. With each sequence $(w_1,w_2,...)\in…

Dynamical Systems · Mathematics 2013-11-27 Stéphane Seuret , Baowei Wang

This paper analyzes a certain action called "whirling" that can be defined on any family of functions between two finite sets equipped with a linear (or cyclic) ordering. Many maps of interest in dynamical algebraic combinatorics, such as…

Combinatorics · Mathematics 2025-12-10 Michael Joseph , James Propp , Tom Roby

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Discrete Mathematics · Computer Science 2008-06-20 Tsiriniaina Andriamampianina

In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…

Path planning is an important problem in robotics. One way to plan a path between two points $x,y$ within a (not necessarily simply-connected) planar domain $\Omega$, is to define a non-negative distance function $d(x,y)$ on…

Robotics · Computer Science 2017-08-22 Renjie Chen , Craig Gotsman , Kai Hormann

A decomposition theorem for the Lind zeta function of a reversal system $(X, T, R)$ of finite order is established. A reversal system can be regarded as an action of a certain group $G$ on $X$. To establish an explicit formula for the Lind…

Dynamical Systems · Mathematics 2017-12-12 Sieye Ryu

We show that under suitable conditions a random orbit generated by a system of nonexpansive maps recovers an invariant set via its omega-limit. In particular, this explains what happens to the Kaczmarz--von Neumann projection algorithm in…

Dynamical Systems · Mathematics 2013-07-24 Krzysztof Leśniak

Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…

Chaotic Dynamics · Physics 2009-10-31 Tomaz Prosen , Thomas H. Seligman , Hans A. Weidenmueller

The idea is advanced that self-organization in complex systems can be treated as decision making (as it is performed by humans) and, vice versa, decision making is nothing but a kind of self-organization in the decision maker nervous…

Adaptation and Self-Organizing Systems · Physics 2014-08-08 V. I. Yukalov , D. Sornette

We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile…

Statistical Mechanics · Physics 2008-08-28 Christoph Richard , Moritz Hoeffe , Joachim Hermisson , Michael Baake

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

Complex Variables · Mathematics 2025-05-22 Ilia Binder , David Pechersky

A simple weakly frequency dependent model for the dynamics of a population with a finite number of types is proposed, based upon an advantage of being rare. In the infinite population limit, this model gives rise to a non-smooth dynamical…

Populations and Evolution · Quantitative Biology 2007-05-23 Michael Baake , Uwe Grimm , Harald Jockusch

Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…

Dynamical Systems · Mathematics 2020-04-14 Dan Rust , Timo Spindeler

We study the dynamics of the attractor of the doubling map with an asymmetrical hole by associating to each hole an element of the lexicographic world. A description of the topological entropy function is given. We show that the set of…

Dynamical Systems · Mathematics 2016-08-08 Rafael Alcaraz Barrera

In this paper, we study random dynamical systems generated by two Allee maps. Two models are considered - with and without small random perturbations. It is shown that the behavior of the systems is very similar to the behavior of the…

Dynamical Systems · Mathematics 2017-09-13 Jozef Kováč , Katarína Janková

Given two ordinal $\lambda$ and $\gamma$, let $f:[0,\lambda) \rightarrow [0,\gamma)$ be a function such that, for each $\alpha<\gamma$, $\sup\{f(t): t\in[0, \alpha]\}<\gamma.$ We define a mapping $d_{f}: [0,\lambda)\times [0,\lambda)…

General Topology · Mathematics 2016-03-30 I. V. Protasov , K. D. Protasova
‹ Prev 1 3 4 5 6 7 10 Next ›