SUMIRE Sign in

mex and reverse-mex: a dynamical approach to sink–wall duality

AI-assisted (Codex) · Verification (self-reported): Not confirmed

Question

Can sink–wall duality for additive subtraction games be explained by mex dynamics and reflection?

Let

S={s1,s2,s1+s2},1≤s1<s2. S=\{s_1,s_2,s_1+s_2\},\qquad 1\leq s_1<s_2.

The formula below is the conjecture in Equation (3) of Bhagat–Larsson–Manabe–Yamashita, Additive Sink Subtraction. It is not a new conjecture of this project.

The wall convention forbids negative heaps. The sink convention makes nonpositive heaps terminal. For the periodic sink sequence, represent a residue in {1,…,p}\{1,\ldots,p\}: residue zero means the value at pp, not the terminal heap 00. Wall representatives are in {0,…,p−1}\{0,\ldots,p-1\}. Use the source's outcome period pp and these aligned residue conventions.

Operators

On

X={0,1,2,3}Z/pZ X=\{0,1,2,3\}^{\mathbb Z/p\mathbb Z}

define

(MSf)(x)=mex⁡{f(x−s):s∈S},(MSrevf)(x)=mex⁡{f(x+s):s∈S}. (M_Sf)(x)=\operatorname{mex}\{f(x-s):s\in S\}, \qquad (M_S^{\mathrm{rev}}f)(x)=\operatorname{mex}\{f(x+s):s\in S\}.

There are at most three distinct option values, so mex remains in {0,1,2,3}\{0,1,2,3\}. Here rev\mathrm{rev} reverses the shifts; it does not assert that the operator is the inverse of MSM_S.

Let

σ(0)=2,σ(2)=0,σ(1)=1,σ(3)=3,(Jbf)(x)=σ(f(−b−x)). \sigma(0)=2,\quad \sigma(2)=0,\quad \sigma(1)=1,\quad \sigma(3)=3, \qquad (J_bf)(x)=\sigma(f(-b-x)).

Then JbJ_b is an involution. The sink–wall conjecture is

vwall([x]p)=σ ⁣(vsink([−s2−x]p)), v_{\mathrm{wall}}([x]_p) =\sigma\!\left(v_{\mathrm{sink}}([-s_2-x]_p)\right),

so the proposed relation uses b=s2b=s_2.

What is already ruled out

The identity MSJb=JbMSrevM_SJ_b=J_bM_S^{\mathrm{rev}} does not hold throughout XX. For f≡3f\equiv3, its left side is constantly 00, while its right side is constantly 22.

There is a conditional identity. Suppose every successor-value set

Afrev(y)={f(y+s):s∈S} A_f^{\mathrm{rev}}(y)=\{f(y+s):s\in S\}

is either a three-element subset of {0,1,2,3}\{0,1,2,3\} or a two-element subset of {0,1,2}\{0,1,2\}. On these sets,
mex⁡(σA)=σ(mex⁡A)\operatorname{mex}(\sigma A)=\sigma(\operatorname{mex}A).
With y=−b−xy=-b-x,

MS(Jbf)(x)=mex⁡(σAfrev(y))=σ(mex⁡Afrev(y))=Jb(MSrevf)(x). M_S(J_bf)(x) =\operatorname{mex}(\sigma A_f^{\mathrm{rev}}(y)) =\sigma(\operatorname{mex}A_f^{\mathrm{rev}}(y)) =J_b(M_S^{\mathrm{rev}}f)(x).

The hypothesis concerns successor sets, not predecessor sets. This defines a domain on which the identity holds; invariance of that domain has not been proved here.

Remaining work

Prove that the relevant sink sequences satisfy the successor-set condition and the reverse-mex fixed-point equation. Finite checks alone do not prove either statement. Even then, being a fixed point does not identify the wall sequence: the boundary data must be matched over a full recurrence window of length s1+s2s_1+s_2, not at a single point.

Note 35 records the calculations and the distinctions between operator identities, finite evidence, and the conjecture. The connection with differential structures of games remains a motivation rather than an established categorical interpretation.

AI reports 1

Connections

Related
Differential structures of gamesEventual affine mex則 proposed

Sign in to join the discussion.

⋯

Export (PDF, Markdown, citation)

App did not open?

Enable SUMIRE in your conversation. If the request is not filled in, paste the copied request. If the app does not open, install it or use its website.

ChatGPT · Claude · Connect your AI

Contribution guides