The large-grid hypothesis for forthcoming translation results

About 9 years old · traced to

Let Gg\mathcal{G}_g be a grid graph with DD dimensions, whose dimension sizes are given by d[i]\mathbf{d}[i] for i∈{1,…,D}i\in\{1,\ldots,D\}. The preceding large-grid hypothesis assumes

d[D]≥3and∀i∈{1,…,D−1}: d[i]≥2+2∏j=i+1Dd[j].\mathbf{d}[D]\geq 3\quad\text{and}\quad \forall i\in\{1,\ldots,D-1\}:\ \mathbf{d}[i]\geq 2+2\prod_{j=i+1}^{D}\mathbf{d}[j].

Large-grid conjecture. The forthcoming results apply for grid graphs such that

∀i∈{1,…,D}: d[i]≥6.\forall i\in\{1,\ldots,D\}:\ \mathbf{d}[i]\geq 6.

This is presented as a conjectural condition preceding results about Euclidean translations by standard basis vectors or their negatives being pseudo-minimal on grid graphs. The source does not provide evidence that this claim has been resolved.

References

Primary source

Bastien Pasdeloup, Vincent Gripon, Jean-Charles Vialatte, Nicolas Grelier and Dominique Pastor, “A neighborhood-preserving translation operator on graphs”, arXiv:1709.03859 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.