The coefficient formula for Leibniz graphs in the factorizing operator

About 7 years old · traced to

Let cnc_n be the coefficients in the factorizing operator

◊=2⋅∑n⩾1ℏnn!⋅cn⋅Fn−1([ ⁣[P,P] ⁣],P,…,P),\Diamond=2\cdot\sum_{n\geqslant1}\frac{\hbar^n}{n!}\cdot c_n\cdot\mathcal{F}_{n-1}\bigl([\![{\mathcal{P},\mathcal{P}}]\!],\mathcal{P},\ldots,\mathcal{P}\bigr),

where wΓw_\Gamma is the weight of a Leibniz graph Γ\Gamma and # ⁣Aut⁡(Γ)\#\!\operatorname{Aut}(\Gamma) denotes the order of its automorphism group. The coefficient formula for Leibniz graphs. For all n⩾2n\geqslant2,

cn=n3!=n6,c_n=\frac{n}{3!}=\frac{n}{6},

and consequently the coefficient of the marker Γ\Gamma for the equivalence class [Γ][\Gamma] is

2n⋅wΓ# ⁣Aut⁡(Γ).2^n\cdot\frac{w_\Gamma}{\#\!\operatorname{Aut}(\Gamma)}.

This formula is supported by the experiments described in the source, but it remains to be explained how it follows from the L∞L_\infty condition; establishing that derivation would clarify the relation between the formality morphism and associativity of the star product.

References

Primary source

Ricardo Buring and Arthemy Kiselev, “Formality morphism as the mechanism of -product associativity: how it works”, arXiv:1907.00639 (2019).

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.