An Exact Counterexample to Carlson's Associated-Prime Depth Conjecture from a Group of Order 128
arXiv:2607. 23732v1 Announce Type: cross Abstract: In Question~3.
arXiv:2607. 24847v1 Announce Type: cross Abstract: We introduce an extremal invariant associated with Chowla-type order conditions in finite groups.
arXiv:2607. 23732v1 Announce Type: cross Abstract: In Question~3.
arXiv:2609. 03246v1 Announce Type: cross Abstract: Smoothness of a function on the real line is reflected in the decay of its Fourier transform, which suggests that smoothness of a function in $L^2(G)$ for a group $G$ should mean concentration of the Fourier coefficients at low frequency.
arXiv:2608. 07275v1 Announce Type: cross Abstract: A group is an E-group if every element commutes with each of its endomorphic images.
arXiv:2609. 17578v1 Announce Type: cross Abstract: Let $a_1,\ldots,a_m$ be distinct elements of a field $K$, and let $Z(X)=\prod_{i=1}^m (X-a_i)$.
arXiv:2607. 23004v1 Announce Type: cross Abstract: Let $t(N)$ be the largest $t$ for which there exist distinct sets $A_1,\dots,A_t \subseteq \{1,\dots,N\}$ such that $A_i \cap A_j$ is a nonempty arithmetic progression for all $i \neq j$ (Erdos Problem #272).
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. 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.
arXiv:2604. 02995v3 Announce Type: replace-cross Abstract: We introduce the penalised Saito functional $\mathfrak S_{\lambda,\beta}(\mathcal{A};d_1,d_2)$ for a reduced arrangement $\mathcal{A}$ of $n$ lines and a prescribed pair $d_1+d_2=n-1$.
arXiv:2608. 15558v1 Announce Type: cross Abstract: For $m\geq 2$, let $c_p(m)$ be the all-dimensional best constant in $$ \left\|\sum_{k=1}^m A_k\right\|_p \leq c_p(m)\left\|\sum_{k=1}^m |A_k|\right\|_p.
arXiv:2609.06327v2 Announce Type: replace-cross Abstract: A query-oblivious coreset for a softmax-attention head is a subset of the key-value pairs whose attention output is within $\varepsilon$ of t...
arXiv:2607. 10751v1 Announce Type: new Abstract: Following Alon, Hanneke, Holzman, and Moran (FOCS 2021), we define a partial concept class (PCC) as a family of partial functions \(f: V\to\{0,1,\ast\}\); equivalently, its concepts partition the ground set into black ($f^{-1}(1)$), grey ($f^{-1}(\ast)$), and white parts ($f^{-1}(0)$).
arXiv:2504. 19451v4 Announce Type: replace-cross Abstract: This paper presents two concrete applications of Artificial Intelligence to algorithmic and analytic number theory.