On computing the closures of solvable permutation groups

INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION（2024）

引用 0|浏览0

暂无评分

摘要

Let m >= 3 be an integer. It is proved that the m-closure of a given solvable permutation group of degree n can be constructed in time nO(m).

查看译文

关键词

Permutation group,closure,polynomial-time algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要