Related papers: Drawing dynamical and parameter planes of iterativ…
In this paper the author presents the results of the preliminary investigation of fractional dynamical systems based on the results of numerical simulations of fractional maps. Fractional maps are equivalent to fractional differential…
This paper is concerned with the local bifurcation analysis around typical singularities of piecewise smooth planar dynamical systems. Three-parameter families of a class of non$-$smooth vector fields are studied and the tridimensional…
We study plane quadratic and cubic differential systems satisfying the Caushy - Riemann conditions. We construct all global topologically equivalent phase portraits of the systems.
We find all quadratic post-critically finite (PCF) rational maps defined over the rationals. We describe an algorithm to search for possibly PCF maps. Using the algorithm, we eliminate all but twelve rational maps, all of which are…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…
Given a number field $K$ and a polynomial $f(z) \in K[z]$ of degree at least 2, one can construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, with an edge $\alpha \to \beta$ if and only…
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…
We investigate the iterative construction of discrete Laplacians on 2D square lattices, revealing emergent fractal-like patterns shaped by modular arithmetic. While classical 2222-style iterations reproduce known structures such as the…
Within the study of uncertain dynamical systems, iterated random functions are a key tool. There, one samples a family of functions according to a stationary distribution. Here, we introduce an extension, where one sample functions…
Criticality is traditionally regarded as an unstable, fine-tuned fixed point of the renormalization group. We introduce an iterative bicolored percolation process in two dimensions and show that it can both preserve criticality and…
We describe an algorithm for distinguishing hyperbolic components in the parameter space of quadratic rational maps with a periodic critical point. We then illustrate computer images of the hyperbolic components of the parameter spaces V1 -…
The standard way to parameterize the distributions represented by a directed acyclic graph is to insert a parametric family for the conditional distribution of each random variable given its parents. We show that when one's goal is to test…
Without adhering to any specific model, we have presented 4 X 4 quark mixing matrix as an extension of the 3 X 3 PDG parametrization of the CKM matrix. Using unitarity constraints as well as the hierarchy among the elements of the 3 X 3 CKM…
In this paper we discuss the dynamical structure of the rational family $(f_t)$ given by $$f_t(z)=tz^{m}\Big(\frac{1-z}{1+z}\Big)^{n}\quad(m\ge 2,~t\ne 0).$$ Each map $f_t$ has two super-attracting immediate basins and two free critical…
We consider the number of linear extensions of an N-free order P. We give upper and lower bounds on this number in terms of parameters of the corresponding arc diagram. We propose a dynamic programming algorithm to calculate the number. The…
Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…
We present a simple yet powerful and applicable quadrature based scheme for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve…
We propose a new methodology for parametric domain decomposition using iterative principal component analysis. Starting with iterative principle component analysis, the high dimension manifold is reduced to the lower dimension manifold.…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…