ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S⊆ZS\subseteq\mathbb{Z}, and let r(Z⟨S⟩)r(\mathbb{Z}\langle S\rangle) be obtained from Z⟨S⟩\mathbb{Z}\langle S\rangle by replacing every edge, including every loop, by rr parallel copies. Suppose n∈Nn\in\mathbb{N} satisfies

min(nδ0~Z⟨S⟩)<min((n−1)δ0~Z⟨S⟩)\mathrm{min}(\widetilde{n\delta_0}^{\mathbb{Z}\langle S\rangle})<\mathrm{min}(\widetilde{(n-1)\delta_0}^{\mathbb{Z}\langle S\rangle})

and

max(nδ0~Z⟨S⟩)>max((n−1)δ0~Z⟨S⟩).\mathrm{max}(\widetilde{n\delta_0}^{\mathbb{Z}\langle S\rangle})>\mathrm{max}(\widetilde{(n-1)\delta_0}^{\mathbb{Z}\langle S\rangle}).

Generalized parallel-loop sorting conjecture. Then r(Z⟨S⟩)r(\mathbb{Z}\langle S\rangle) sorts Δrn\Delta^{rn} for each r≥1r\geq1. This simultaneously generalizes the looped-path and parallel-edge conjectures, but the source supplies no proof of the general assertion.

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.