相关论文: Collatz's "3x+1" problem and iterative maps on int…
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…
A simple construction is presented, which generalises piecewise linear one-dimensional Markov maps to an arbitrary number of dimensions. The corresponding coupled map lattice, known as a simplicial mapping in the mathematical literature,…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…
We solve the And\^{o} dilation problem for linear maps on vector space asked by Krishna and Johnson in \textit{[Oper. Matrices, 2022]}. More precisely, we show that any commuting linear maps on vector space can be dilated to commuting…
We introduce the \emph{Collatz conjecture} and its history. Some definition that this conjecture has, will be expressed and with these we try to explain some good lemma to justify the main properties of the \emph{Collatz conjecture}. With…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
We obtain the complete conjugacy invariants of expansive Lorenz maps and for any given two expansive Lorenz maps, there are two unique sequences of $(\beta_{i},\alpha_{i})$ pairs. In this way, we can define the classification of expansive…
In this note, continuous transitive maps $f$ on the interval $I$ are re-addressed, where $I$ denotes one of the intervals: $(-\infty, \infty)$, $(-\infty, a]$, $[b, \infty)$, $[a, b]$, where $a < b$ are real numbers. Such maps must have a…
We introduce the idea of an n-simplex graph and games upon simplicial complexes. We then define moves on a labeled graph and pose the problem of whether given two labelings of a graph it is possible to change one into another via these…
Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
In this article, we study the structure of the graph implied by a given map on the set $S_p=\{1,2,\dots,p-1\}$, where $p$ is an odd prime. The consecutive applications of the map generate an integer sequence, or in graph theoretical context…
In this paper we study the problem of augmenting a planar graph such that it becomes 3-regular and remains planar. We show that it is NP-hard to decide whether such an augmentation exists. On the other hand, we give an efficient algorithm…
The Collatz conjecture implies that an iterated function sequence under a certain linear operator, beginning with a certain complex valued function, must converge to a certain complex function.
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…
We consider regularized cutting-plane methods to minimize a convex function that is the sum of a large number of component functions. One important example is the dual problem obtained from Lagrangian relaxation on a decomposable problem.…
The harmonic numbers are the sequence 1, 1+1/2, 1+1/2+1/3, ... Their asymptotic difference from the sequence of the natural logarithm of the positive integers is Euler's constant gamma. We define a family of natural generalizations of the…
A standard interval exchange map is a one-to-one map of the interval which is locally a translation except at finitely many singularities. We define for such maps, in terms of the Rauzy-Veech continuous fraction algorithm, a diophantine…