ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix integers nn and pp. A tile is a tuple (cout,cin,v,ε)(c_{\mathrm{out}},c_{\mathrm{in}},v,\varepsilon), where coutc_{\mathrm{out}} and cinc_{\mathrm{in}} are carry values, v=(a1,…,an)v=(a_1,\ldots,a_n) is an integer vector, and ε\varepsilon is an integer coefficient. Write Fisv(Ti)F^i s_{v(T_i)} for the ii-fold Frobenius transform of the Schur character indexed by v(Ti)v(T_i), and let the zero tile be (0,0,(0,…,0),1)(0,0,(0,\ldots,0),1).

Tile-structure conjecture. For fixed nn and pp, there is a finite list of valid tiles such that Prim(d)\mathrm{Prim}(d) is the sum

∑T0,T1,…∏iε(Ti)Fisv(Ti),\sum_{T_0,T_1,\ldots}\prod_i\varepsilon(T_i)F^i s_{v(T_i)},

where all but finitely many tiles are zero, cout(Ti)=cin(Ti+1)c_{\mathrm{out}}(T_i)=c_{\mathrm{in}}(T_{i+1}), cin(T0)=ENDc_{\mathrm{in}}(T_0)=\mathrm{END}, and

∑i∑jpiaj(Ti)=2d−2.\sum_i\sum_j p^i a_j(T_i)=2d-2.

The conjecture abstracts the observed tile descriptions for even-carry and Nim polynomials. It is supported by computed examples, but the source does not provide a general construction or proof.

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.