中文

非强Howson群

计算机视觉与模式识别 2025-01-13 v3 人工智能

摘要

若群G中任意两个有限生成子群H, K的交H∩K仍为有限生成,则称G为Howson群;若可从H, K的秩得到H∩K秩的统一界限,则称G为强Howson群。显然,每个强Howson群都是Howson群,但文献中是否真如此尚不清楚。本文通过构造第一个非强Howson的Howson群,证明了反向不成立。

关键词

引用

@article{arxiv.2409.09566,
  title  = {Learning Transferable Features for Implicit Neural Representations},
  author = {Kushal Vyas and Ahmed Imtiaz Humayun and Aniket Dashpute and Richard G. Baraniuk and Ashok Veeraraghavan and Guha Balakrishnan},
  journal= {arXiv preprint arXiv:2409.09566},
  year   = {2025}
}

备注

Project Website: https://kushalvyas.github.io/strainer.html