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 math.COShow all

5 papers · 1 filter

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.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.CO2023★ 1 cited

Proving the existence of Euclidean knight's tours on $n \times n \times \dots \times n$ chessboards for $n < 4$

Marco Ripà

The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set…

math.CO2022

Optimal cycles enclosing all the nodes of a $k$ -dimensional hypercube

Roberto Rinaldi, Marco Ripà

We solve the general problem of visiting all the $2^{k}$ nodes of a $k$ -dimensional hypercube by using a polygonal chain that has minimum link-length, and we show that this optimal v…

math.CO2022

Shortest polygonal chains covering each planar square grid

Marco Ripà

Given any $n \in Z^{+}$ , 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 the existence of Hamiltonian cycles in hypercubes

General uncrossing covering paths inside the axis-aligned bounding box

Proving the existence of Euclidean knight's tours on n×n×⋯×n chessboards for n<4

Optimal cycles enclosing all the nodes of a k-dimensional hypercube

Shortest polygonal chains covering each planar square grid

Proving the existence of Euclidean knight's tours on $n \times n \times \dots \times n$ chessboards for $n < 4$

Optimal cycles enclosing all the nodes of a $k$ -dimensional hypercube