Related papers: Dynamics of a quasi-quadratic map

An FI- or an OI-module $\mathbf{M}$ over a corresponding noetherian polynomial algebra $\mathbf{P}$ may be thought of as a sequence of compatible modules $\mathbf{M}_n$ over a polynomial ring $\mathbf{P}_n$ whose number of variables depends…

Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…

This article begins the study of irreducible maps involving finite-dimensional uniserial modules over finite-dimensional associative algebras. We work on the classification of irreducible maps between two uniserials over triangular…

We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the…

Many natural and social systems possess power-law memory, and their mathematical modeling requires the application of discrete and continuous fractional calculus. Most of these systems are nonlinear and demonstrate regular and chaotic…

We give a necessary and sufficient condition for a map defined on a simply-connected quasiconvex metric space to factor through a tree. In case the target is the Euclidean plane and the map is H\"older continuous with exponent bigger than…

Let $\mathcal{O}$ be an order in the imaginary quadratic field $K$. For positive integers $M \mid N$, we determine the least degree of an $\mathcal{O}$-CM point on the modular curve $X(M,N)_{/K(\zeta_M)}$ and also on the modular curve…

To approximate a simple root of an equation we construct families of iterative maps of higher order of convergence. These maps are based on model functions which can be written as an inner product. The main family of maps discussed is…

The Minor problem, namely the study of the spectrum of a principal submatrix of a Hermitian matrix taken at random on its orbit under conjugation, is revisited, with emphasis on the use of orbital integrals and on the connection with…

One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…

We characterize all bounded orbits of two similar Collatz-type quadratic mappings of the set of non-negative integers. In one case, where cycles of all possible lengths may occur, an orbit is bounded if and only if it reaches a cycle. For…

This paper proposes a formula expression for the well-known Collatz conjecture (or 3x+1 problem), which can pinpoint all the growth points in the orbits of the Collatz map for any natural numbers. The Collatz map $Col: \mathcal{N}+1…

Let X be a closed surface of genus two embedded in the 3-sphere. Then X inherits a metric and an orientation, which give an almost complex structure, which automatically integrates to a genuine complex structure, making X a Riemann surface.…

An algorithm which either finds an nonzero integer vector ${\mathbf m}$ for given $t$ real $n$-dimensional vectors ${\mathbf x}_1,...,{\mathbf x}_t$ such that ${\mathbf x}_i^T{\mathbf m}=0$ or proves that no such integer vector with norm…

The dynamical degrees of a rational map $f:X\dashrightarrow X$ are fundamental invariants describing the rate of growth of the action of iterates of $f$ on the cohomology of $X$. When $f$ has nonempty indeterminacy set, these quantities can…

If the face\mbox{-}cycles at all the vertices in a map are of same type then the map is called semi\mbox{-}equivelar. A map is called minimal if the number of vertices is minimal. We know the bounds of number of vertex orbits of…

Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…

Let $\mathcal{R}$ be a $2$-torsion free commutative ring with unity, $X$ a locally finite pre-ordered set and $I(X,\mathcal{R})$ the incidence algebra of $X$ over $\mathcal{R}$. If $X$ consists of a finite number of connected components, in…

Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…