Higher nilpotency-class identity conjecture for unitriangular groups

At least 3 years old · documented by

Let k≥11k\geq 11 and let H⊂UT(n,Q)\mathcal{H}\subset \mathsf{UT}(n,\mathbb{Q}) be any finite set of matrices. Write I={1,2,…,k+1}\mathcal{I}=\{1,2,\ldots,k+1\}, let PI⁡I\operatorname{PI}^{\mathcal{I}} be the associated map on words in the alphabet I\mathcal{I}, and let HkH_k and L≥d(log⁡H)\mathfrak{L}_{\geq d}(\log\mathcal{H}) denote the polynomial and lower-degree Lie subspaces used in the paper. Higher nilpotency-class identity conjecture. There exist an integer r≥0r\geq0, positive rational numbers α1,…,αr\alpha_1,\ldots,\alpha_r, and words js=js,1js,2⋯js,ms\boldsymbol{j}_s=j_{s,1}j_{s,2}\cdots j_{s,m_s} in I\mathcal{I}, for s=1,…,rs=1,\ldots,r, such that PI⁡I(js)∈Z>0⋅(1,1,…,1)\operatorname{PI}^{\mathcal{I}}(\boldsymbol{j}_s)\in\mathbb{Z}_{>0}\cdot(1,1,\ldots,1) and, for all matrices B1,…,Bk+1∈UT(n,Q)B_1,\ldots,B_{k+1}\in\mathsf{UT}(n,\mathbb{Q}) satisfying log⁡Bi∈L≥1(log⁡H)\log B_i\in\mathfrak{L}_{\geq1}(\log\mathcal{H}) and ∑i=1k+1log⁡Bi∈L≥2(log⁡H)\sum_{i=1}^{k+1}\log B_i\in\mathfrak{L}_{\geq2}(\log\mathcal{H}),

∑σ∈S⁡k+1Hk(log⁡Bσ(1),…,log⁡Bσ(k+1))+∑s=1rαs∑σ∈S⁡k+1Hk(log⁡Bσ(js,1),…,log⁡Bσ(js,ms))∈L≥k+1(log⁡H)+L≥2(L≥2(log⁡H)).\sum_{\sigma\in\operatorname{S}_{k+1}}H_k(\log B_{\sigma(1)},\ldots,\log B_{\sigma(k+1)})+\sum_{s=1}^r\alpha_s\sum_{\sigma\in\operatorname{S}_{k+1}}H_k(\log B_{\sigma(j_{s,1})},\ldots,\log B_{\sigma(j_{s,m_s})}) \in\mathfrak{L}_{\geq k+1}(\log\mathcal{H})+\mathfrak{L}_{\geq2}(\mathfrak{L}_{\geq2}(\log\mathcal{H})).

The conjecture would supply the identities needed to extend the paper's polynomial-time computation of invertible subsets from nilpotency class at most ten to higher nilpotency classes; the authors identify proving the corresponding proposition for k≥11k\geq11 as the remaining obstacle, and no resolution is given here.

References

Primary source

Ruiwen Dong, “The Identity Problem in nilpotent groups of bounded class”, arXiv:2208.02164 (2023).

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.