Marco Ripà

activity

20222026

most citedNumber of stable digits of any integer tetration

21 citations · 40 across the 14 of their papers we have counts for

collaborators

Showing 2024Show all

5 papers · 1 filter

math.GM2024

Graham's number stable digits: An exact solution

Marco Ripà

In the decimal numeral system, we prove that the well-known Graham's number, $G :=^{n} 3$ (i.e., $3^{3^{\cdot^{\cdot^{\cdot^{3}}}}}$ ( $n$ times)), and any base $3$ tetration who…

math.CO2024

On the existence of Hamiltonian cycles in hypercubes

Gabriele Di Pietro, Marco Ripà

Building on the results of our previous work on Euclidean leaper tours, considering all integers $k > 1$ and $h > 0$ , we study the existence of Hamiltonian cycles in the vertex set $C(…

math.GM2024

Euclidean Tours in Fairy Chess

Gabriele Di Pietro, Marco Ripà

The present paper aims to extend the knight's tour problem for $k$ -dimensional grids of the form ${0, 1}^{k}$ to other fairy chess leapers. Accordingly, we constructively show the e…

math.CO2024

General uncrossing covering paths inside the axis-aligned bounding box

Marco Ripà

Given the finite set of $n_{1} \cdot n_{2} \cdot \dots \cdot n_{k}$ points $G_{n_{1}, n_{2}, \dots, n_{k}} \subset R^{k}$ such that $n_{k} \geq \dots \geq n_{2} \geq n_{1} \in Z^{+}$ ,…

math.GM2024★ 2 cited

Solving the $106$ years old $3^{k}$ points problem with the clockwise-algorithm

Marco Ripà

In this paper, we present the clockwise-algorithm that solves the extension in $k$ -dimensions of the infamous nine-dot problem, the well-known two-dimensional thinking outside the…

Graham's number stable digits: An exact solution

On the existence of Hamiltonian cycles in hypercubes

Euclidean Tours in Fairy Chess

General uncrossing covering paths inside the axis-aligned bounding box

Solving the 106 years old 3k points problem with the clockwise-algorithm

Solving the $106$ years old $3^{k}$ points problem with the clockwise-algorithm