ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Can we extend the polynomial splittability bound to 3D grids? Specifically, can we get a 1poly(n)\frac{1}{\text{poly}(n)} lower bound on splittability into k=2k = 2 components of exactly the same numbers of vertices in an n×n×nn \times n \times n grid graph? What's the analog for generating the dual of a spanning tree with Wilson's algorithm? Perhaps there is a different route altogether.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.