ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is f pnq “ Opnq? Karim Adiprasito ř Question 12. Given a graph G and C a collection of cycles, let \C}1 “ \gammaPC |\gamma| be the total length. Given a field F and C, glue in the corresponding 2-disks into the cell complex underlying the graph, and consider the homology over F . Let \alphaF pGq be the minimum }C}1 such that the F -homology vanishes after this gluing. Let \alphaZ pGq be the same for Z-homology, and \alpha\pi1 pGq for vanishing the first homotopy group. Let \alpha8 pGq be the same but for vanishing all homotopy groups. We have \alphaF pGq ď \alphaZ pGq ď \alpha\pi1 pGq ď \alpha8 pGq. Is it true that \alpha\pi1 pGq{\alphaF2 pGq is unbounded? For the strongest form, one would ask for G of bounded degree.

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.