Pivot-orbit containment conjecture for the family Fn,t{\cal F}^{n,t}

From papers

Let nn and tt satisfy 0tn10\leq t\leq n-1, and let Fn,t{\cal F}^{n,t} be the family of Boolean functions defined by

fn,t=i=0t1j=tn1xixj+i=tn2j=i+1n1xixj+a(x0,x1,,xn1),f^{n,t}=\sum_{i=0}^{t-1}\sum_{j=t}^{n-1}x_ix_j+\sum_{i=t}^{n-2}\sum_{j=i+1}^{n-1}x_ix_j+a(x_0,x_1,\ldots,x_{n-1}),

where deg(a)1\deg(a)\leq 1, together with arbitrary Boolean functions of x0,,xt1x_0,\ldots,x_{t-1}; the pivot orbit of a Boolean function is the set of functions obtained from it by successive pivot operations. Pivot-orbit containment conjecture. If fFn,tf\in{\cal F}^{n,t}, then its pivot orbit is contained in

k=0n1Fn,k.\bigcup_{k=0}^{n-1}{\cal F}^{n,k}.

This claim concerns the invariance of the constructed family under pivot operations, up to changing the parameter tt. The supplied excerpt does not state whether the claim has been proved or remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Constanza Riera, Lars Eirik Danielsen and Matthew G. Parker, “On Pivot Orbits of Boolean Functions”, arXiv:math/0604396 (2006).

Solutions 0

No solutions have been posted yet.