相关论文: Allowed patterns of symmetric tent maps via commut…
This paper describes the design of a modified tent map characterized by a uniform probability density function. The use of this map is proposed as an alternative to the tent map and the Bernoulli shift. It is shown that practical circuits…
Arguments inspired by algorithmic information theory predict an inverse relation between the probability and complexity of output patterns in a wide range of input-output maps. This phenomenon is known as \emph{simplicity bias}. By viewing…
Topological conjugateness of one dimensional unimodal dynamical systems, which are generated by interval [0, 1] into itself maps are studied. We study the smoothness and differentiability of the conjugacy of symmetrical and non-symmetrical…
In this paper, we view parking functions viewed as labeled Dyck paths in order to study a notion of pattern avoidance first introduced by Remmel and Qiu. In particular we enumerate the parking functions avoiding any set of two or more…
The scope of this paper is two-fold. First, to present to the researchers in combinatorics an interesting implementation of permutations avoiding generalized patterns in the framework of discrete-time dynamical systems. Indeed, the orbits…
In this paper, we focus attention on extending the topological conjugacy of adding machine maps and minimal systems to iterated function systems. We provide necessary and sufficient conditions for an iterated function system to be…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
A permutation \tau contains another permutation \sigma as a pattern if \tau has a subsequence whose elements are in the same order with respect to size as the elements in \sigma. This defines a partial order on the set of all permutations,…
The allowed patterns of a map on a one-dimensional interval are those permutations that are realized by the relative order of the elements in its orbits. The set of allowed patterns is completely determined by the minimal patterns that are…
We consider a dynamical system to have memory if it remembers the current state as well as the state before that. The dynamics is defined as follows: $x_{n+1}=T_{\alpha}(x_{n-1},x_{n})=\tau (\alpha \cdot x_{n}+(1-\alpha)\cdot x_{n-1}),$…
We introduce here a classification of unimodal maps $[0, 1]\rightarrow [0, 1]$, which commute with piecewise linear surjective maps $[0, 1]\rightarrow [0, 1]$. Remind that if continuous piecewise linear unimodal map $g$ commutes with a…
Tradable mobility credit (TMC) schemes are an approach to travel demand management that have received significant attention in recent years. This paper proposes and analyzes alternative market models for a TMC system -- focusing on market…
In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we…
We define a non-commutative version of the $A_1$ T-system, which underlies frieze patterns of the integer plane. This system has discrete conserved quantities and has a particular reduction to the known non-commutative Q-system for $A_1$.…
In this article, we have studied a 1D map, which is formed by combining the two well-known maps i.e. the tent and the logistic maps in the unit interval i.e. [0, 1]. The proposed map can behave as the piecewise smooth or non-smooth maps…
Binary clustering systems are closely related to monotone transit functions. An interesting class are pyramidal transit functions defined by the fact that their transit sets form an interval hypergraph. We investigate here properties of…
We propose a novel approach for computing committor functions, which describe transitions of a stochastic process between metastable states. The committor function satisfies a backward Kolmogorov equation, and in typical high-dimensional…
We study a deterministic dynamics with two time scales in a continuous state attractor network. To the usual (fast) relaxation dynamics towards point attractors (``patterns'') we add a slow coupling dynamics that makes the visited patterns…
This paper demonstrates that the safety override arising from the use of a barrier function can in some cases be needlessly restrictive. In particular, we examine the case of fixed-wing collision avoidance and show that when using a barrier…
The tent map family is arguably the simplest 1-parametric family of maps with non-trivial dynamics and it is still an active subject of research. In recent works the second author, jointly with J. Yorke, studied the graph and backward…