21 citations · 40 across the 14 of their papers we have counts for
6 papers · 1 filter
Optimal cycles enclosing all the nodes of a -dimensional hypercube
Roberto Rinaldi, Marco Ripà
We solve the general problem of visiting all the nodes of a -dimensional hypercube by using a polygonal chain that has minimum link-length, and we show that this optimal v…
Number of stable digits of any integer tetration
Marco Ripà, Luca Onnis
In the present paper we provide a formula that allows to compute the number of stable digits of any integer tetration base . The number of stable digits, at the g…
Minimum-Link Covering Trails for any Hypercubic Lattice
Marco Ripà
In 1994, Kranakis et al. published a conjecture about the minimum link-length of every rectilinear covering path for the -dimensional grid $P(n,k) := \{0,1, \dots, n-1\} \times…
The congruence speed formula
Marco Ripà
We solve a few open problems related to a peculiar property of the integer tetration , which is the constancy of its congruence speed for any sufficiently large .…
Shortest polygonal chains covering each planar square grid
Marco Ripà
Given any , we constructively prove the existence of covering paths and circuits in the plane which are characterized by the same link length of the minimum-l…
On some open problems concerning perfect powers
Marco Ripà
The starting point of our paper is Kashihara's open problem number , concerning the sequence of the OEIS, asking how many terms are powers of integers. We confirm his…