The ordered-partition expansion conjecture for basic sequences

About 11 years old · traced to

Let kk be a field, let {ei}1≤i≤ℓ\{\mathbf e_i\}_{1\leq i\leq \ell} be the standard basis of kℓk^\ell, and let B=(B1,…,Bℓ)\mathbf B=(B_1,\ldots,B_\ell) be a delta ℓ\ell-tuple with Bi=DiPi−1B_i=D_iP_i^{-1}. Let bn(x)b_{\mathbf n}(\mathbf x) be the basic sequence from the Transfer Theorem, let BB range over the ordered partitions of [ℓ][\ell], and let β\beta range over the partitions of BB. With θj\theta_j the umbral shift operator p↦xjpp\mapsto x_jp, write θβPβ\theta_\beta P_\beta for the corresponding products and ∣B∣|B| for the number of parts of BB. Ordered-partition expansion conjecture. The basic sequence from the Transfer Theorem can also be calculated as

bn(x)=∑B⊢[ℓ](−1)ℓ−∣B∣(θβPβ)Bxn−1n!.b_{\mathbf n}(\mathbf x)=\sum\limits_{B\vdash[\ell]}(-1)^{\ell-|B|}\left(\theta_{\beta}P_{\beta}\right)_B\dfrac{\mathbf x^{\mathbf n-\mathbf 1}}{\mathbf n!}.

This conjectural expansion is intended to provide an alternative way to expand the Jacobian expression in the Transfer Theorem; the source gives it as an open question based on examples, and no general proof or resolution is supplied.

References

Primary source

Erik Insko, Katie Johnson and Shaun Sullivan, “A Terrible Expansion of the Determinant”, arXiv:1509.03647 (2015).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.