ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A=x1,…,xk}A=x_1,\ldots,x_k\} be an alphabet and wt⁡:A→Z\operatorname{wt}:A\rightarrow\mathbb{Z} a weight function. For nonnegative integers n1,…,nkn_1,\ldots,n_k, let Rword(x1n1⋯xknk)\mathcal{R}^{\mathrm{word}}(x_1^{n_1}\cdots x_k^{n_k}) be the words with the prescribed multiplicities, and let Dwt⁡word(x1n1⋯xknk)\mathcal{D}^{\mathrm{word}}_{\operatorname{wt}}(x_1^{n_1}\cdots x_k^{n_k}) be those words whose levels relative to wt⁡\operatorname{wt} are all nonnegative. Sweep-map bijectivity conjecture. The map sw⁡wt⁡\operatorname{sw}_{\operatorname{wt}} maps each of these two sets bijectively to itself. This asserts that the general sweep map preserves both content and the nonnegative-level condition.

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.