Consistency criterion for torsion-free nilpotent group presentations

Let nNn\in\mathbb N, let TT be a sequence of (n3)\binom{n}{3} indeterminates, and let C1(T),,Cr(T)C_1(T),\ldots,C_r(T) be the coefficients obtained from the associativity defect polynomial defined by the multiplication polynomials F(T;x,y)F(T;x,y). Define

Cn={tZ(n3)G(t) is consistent}.\mathcal C_n=\{t\in\mathbb Z^{\binom{n}{3}}\mid G(t)\text{ is consistent}\}.

Consistency conjecture. If

t{tZ(n3)C1(t)==Cr(t)=0},t\in\{t\in\mathbb Z^{\binom{n}{3}}\mid C_1(t)=\cdots=C_r(t)=0\},

then tCnt\in\mathcal C_n.

Associativity proves the necessity of the coefficient equations; the conjecture asserts their sufficiency and would give an alternative algebraic description of consistency for these nilpotent presentations. The supplied text reports only experimental evidence and does not indicate a resolution.

Sources & referencesView supporting material

Primary source

Alexander Cant and Bettina Eick, “Polynomials describing the multiplication in finitely generated torsion free nilpotent groups”, arXiv:1801.02932 (2018).

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.