arXiv:2607. 23732v1 Announce Type: cross Abstract: In Question~3.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
arXiv:2607. 24847v1 Announce Type: cross Abstract: We introduce an extremal invariant associated with Chowla-type order conditions in finite groups.
arXiv:2608. 07275v1 Announce Type: cross Abstract: A group is an E-group if every element commutes with each of its endomorphic images.
arXiv:2603. 20861v2 Announce Type: replace-cross Abstract: The homology of an ample groupoid is computed from the complex of compactly supported continuous functions on the nerve.
The paper investigates exact factorization and canonical presentations of languages relative to a fixed finite‑monoid observation. It shows that unique factorization does not guarantee a finite relative presentation property (FRP) by presenting a 36‑element quotient with infinite valid prime‑return rules, and introduces the stronger finite‑state relative presentation property (FSRP). The authors further define prime‑target left‑division determinism (PTLD), prove its implications for factorization and rule bounds, and provide efficient learning algorithms for the canonical PTLD presentation and FSRP controller.
arXiv:2603. 25414v4 Announce Type: replace-cross Abstract: A prevailing assumption in machine learning is that model correctness must be enforced after the fact.
arXiv:2609. 20231v1 Announce Type: cross Abstract: Let \(\cthreshold(n)\) be the largest integer \(q\) such that every loopless digraph on \(n\) vertices with at most \(q\) arcs is isomorphic to a spanning subdigraph of a self-complementary digraph of order \(n\).