The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A363755 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A363755

The original n X n X n dots problem: minimal number of straight lines (connected at their endpoints) required to join all the n^3 points belonging to the set {{0,1,...,n-1} X {0,1,...,n-1} X {0,1,...,n-1}} in R^3, without any additional constraint.
(history; published version)

#18 by Michael De Vlieger at Tue Aug 01 08:07:13 EDT 2023

STATUS

reviewed

approved

#17 by Joerg Arndt at Tue Aug 01 07:03:36 EDT 2023

STATUS

proposed

reviewed

#16 by Michel Marcus at Tue Aug 01 01:31:08 EDT 2023

STATUS

editing

proposed

#15 by Michel Marcus at Tue Aug 01 01:30:37 EDT 2023

LINKS

Marco Ripà, <a href="httpshttp://wwwdx.doi.researchgateorg/10.net13140/publicationRG.2.2.12199.57769/342331014_Solving_the_n_1_n_2_n_3_Points_Problem_for_n_3_6">Solving the n_1 <= n_2 <= n_3 Points Problem for n_3 < 6</a>, ResearchGate, 2020 (DOI: 10.13140/RG.2.2.12199.57769/1).

Marco Ripà, <a href="httpshttp://wwwdx.researchgatedoi.netorg/publication10.13140/366004468_RG.2.2.12769.99689">General_ conjecture_ on_ the_ optimal_ covering_ trails_ in_ a_ k-dimensional_ cubic_ lattice">General conjecture on the optimal covering trails in </a k-dimensional cubic lattice, >, ResearchGate, 2022.

STATUS

proposed

editing

#14 by Michel Marcus at Tue Aug 01 01:21:28 EDT 2023

STATUS

editing

proposed

#13 by Michel Marcus at Tue Aug 01 01:20:20 EDT 2023

LINKS

Roberto Rinaldi and Marco Ripà, <a href="https://arxiv.org/abs/2212.11216">Optimal cycles enclosing all the nodes of a k-dimensional hypercube, </a>, arXiv :2212.11216 [math.CO], 2022.

Marco Ripà, <a href="https://arxiv.org/abs/2208.01699v301699">Minimum-Link Covering Trails for any Hypercubic Lattice, </a>, arXiv :2208.01699 [math.GM], 2022.

STATUS

approved

editing

#12 by Michael De Vlieger at Tue Aug 01 00:01:53 EDT 2023

STATUS

reviewed

approved

#11 by Sean A. Irvine at Mon Jul 31 18:43:58 EDT 2023

STATUS

proposed

reviewed

#10 by Michel Marcus at Mon Jun 26 04:57:52 EDT 2023

STATUS

editing

proposed

Discussion

Tue Jun 27

20:18

Marco Ripà: You are right, my bad.

Mon Jul 31

18:43

Sean A. Irvine: Not a fan of "bref" sequences, but I think this one is ok.

#9 by Michel Marcus at Mon Jun 26 04:57:41 EDT 2023

REFERENCES

S. Sam Loyd, Cyclopedia of Puzzles, The Lamb Publishing Company, 1914, page 301.

LINKS

Roberto Rinaldi and Marco Ripà, <a href="https://arxiv.org/abs/2212.11216">Optimal cycles enclosing all the nodes of a k-dimensional hypercube, arXiv [math.CO], 2022.

STATUS

proposed

editing

Discussion

Mon Jun 26

04:57

Michel Marcus: Rin before Rip