跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 08:44 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 11:43 — 2026-11-22 11:43(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 08:44最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 08:42(北京时间)
新论文 · v1arXiv:2611.26143

Revisiting Finiteness of Matrix Monoids

Rida Ait El Manssour, Roland Guttenberg, Nathan Lhote, Mahsa Shirmohammadi, James Ben Worrell

原文摘要

This paper concerns decision problems related to finite monoids of rational matrices. We show that determining finiteness of a given finitely presented monoid is in PSPACE, improving the known $\text{co}{-}\text{NEXP}^{\text{NP}}$ bound. We also show that the membership problem for finite matrix monoids is PSPACE-complete, improving the known NEXP-upper bound. Our two complexity results are corollaries of a new polynomial bit-size bound on matrix entries in finite monoids. This is obtained by reduction to the case of matrix groups, using the structure theory of noncommutative algebras and of matrix monoids. Our techniques also give us a polynomial-time algorithm for deciding whether a monoid of rational matrices is conjugate to a monoid of integer matrices.

cs.FL · cs.LO

新论文 · v1arXiv:2611.26102

Burnside Problems for Matrix Semigroup Quotients with Applications to Border Complexity

Roland Guttenberg, Nathan Lhote, Mahsa Shirmohammadi, James Worrell

原文摘要

The Burnside theorem for matrix semigroups states that a finitely generated matrix semigroup is finite whenever each element has only finitely many distinct powers. We study analogous finiteness questions for quotients of matrix semigroups by congruences, which need not themselves admit faithful finite-dimensional matrix representations. We show three finiteness criteria based on uniform bounds on the quotient images of (rank-)stable subsemigroups and groups in the Zariski closure. Our proofs use exterior algebra and the Ramsey theorem to develop variations of Simon's factorisation forest to matrix semigroups modulo congruences. We also present applications of our results to border complexity. One such involves separating homogeneous algebraic branching programs of fixed width and degree from its Zariski closure.

cs.LO · cs.FL