Add to ORKGWe extend Kaprekar’s Routine for a large class of applications. We also give particular examples of this generalization as alternatives to Kaprekar’s Routine and Number. Some open questions about the length of the iterations until reaching either zero or a constant or a cycle, and about the length of the cycles are asked at the end
The extensions of first-order logic with a least fixed point operators (FO + LFP) and with a partial...
An introduction to orbit-finite sets, which are a type of sets that are infinite enough to describe ...
We study multiply recurrent and hypercyclic operators as a special case of $\mathcal F$-hypercyclici...
We extend Kaprekar’s Routine for a large class of applications. We also give particular examples of ...
This Demonstration shows fractal patterns in the number of steps required to reach a fixed point or ...
Iteration of an endofunction f on a finite set X defines cycles of f. To a given set L of lengths an...
This article analyzes Folner sequences of projections for bounded linear operators and their relatio...
We study iteration and recursion operators in the multiset relational model of linear logic and prov...
and [14] provide the notation and terminology for this paper. In this paper m is a natural number. L...
Stage de DEA. Rapport de stage.On définit des opérateurs de limites sur les fonctions. A l'aide de c...
AbstractThe extensions of first-order logic with a least fixed point operator (FO + LFP) and with a ...
In this article practical, experimental and theoretical results of the conducted research are presen...
We show that an idea, originating initially with a fundamental recursive iteration scheme (usually r...
The AKS algorithm (by Agrawal, Kayal and Saxena) is a significant theoretical result proving “PRIMES...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
The extensions of first-order logic with a least fixed point operators (FO + LFP) and with a partial...
An introduction to orbit-finite sets, which are a type of sets that are infinite enough to describe ...
We study multiply recurrent and hypercyclic operators as a special case of $\mathcal F$-hypercyclici...
We extend Kaprekar’s Routine for a large class of applications. We also give particular examples of ...
This Demonstration shows fractal patterns in the number of steps required to reach a fixed point or ...
Iteration of an endofunction f on a finite set X defines cycles of f. To a given set L of lengths an...
This article analyzes Folner sequences of projections for bounded linear operators and their relatio...
We study iteration and recursion operators in the multiset relational model of linear logic and prov...
and [14] provide the notation and terminology for this paper. In this paper m is a natural number. L...
Stage de DEA. Rapport de stage.On définit des opérateurs de limites sur les fonctions. A l'aide de c...
AbstractThe extensions of first-order logic with a least fixed point operator (FO + LFP) and with a ...
In this article practical, experimental and theoretical results of the conducted research are presen...
We show that an idea, originating initially with a fundamental recursive iteration scheme (usually r...
The AKS algorithm (by Agrawal, Kayal and Saxena) is a significant theoretical result proving “PRIMES...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
The extensions of first-order logic with a least fixed point operators (FO + LFP) and with a partial...
An introduction to orbit-finite sets, which are a type of sets that are infinite enough to describe ...
We study multiply recurrent and hypercyclic operators as a special case of $\mathcal F$-hypercyclici...