跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 00:32 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-15 00:32最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

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

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 00:30(北京时间)
新论文 · v1arXiv:2611.11641

Spectral Stability, Fatou Basin Contraction, and Machine-Checked Multipliers in Holomorphic Extensions of Generalized Syracuse Dynamics

Volkan Dağlı, Zerrin Dağlı, Dağhan Dağlı, Emrah Yurtseven, Murat Emre Özkaya

原文摘要

We embed the Syracuse operator $T(n) = n/2$ (even $n$), $T(n) = (3n+1)/2$ (odd $n$) and the Collatz map $C(n)$ into $\mathbb{C}$ via entire functions of exponential type $π$: $f(z) = \frac{1}{4}(1 + 4z - (1 + 2z)\cos(πz))$ and $F(z) = \frac{1}{4}(2 + 7z - (2 + 5z)\cos(πz))$. We prove five results: (1) every integer periodic cycle $C \subset \mathbb{N}^+$ of $T$ is a strictly attracting Fatou cycle of $f$ with multiplier $μ_f(C) = 3^{N_{\mathrm{odd}}}/2^N = \prod_{n \in C\text{ odd}} \frac{3n}{3n+1} \in (0,1)$, and $μ_f(O_{1,2}) = μ_F(O_{1,4,2}) = 3/4 < 1$; (2) on the Fatou basin $B(O_{1,2})$, $g = f^{\circ 2}$ conjugates to $Φ_j(g(z)) = \frac{3}{4}Φ_j(z)$ with Koenigs Taylor jets $c_2(1) = -\frac{13}{2}π^2$ and $d_2(2) = -\frac{9}{2}π^2$; (3) the Schwarzian derivative is strictly negative on $\mathbb{Z}$ ($S(f)(n) \le 3π^2 - \frac{3}{8}π^4 \approx -6.9196 < 0$), and a repelling Julia 2-cycle $O_{\mathrm{rep}} \subset J(f)$ ($μ\approx 1.2148 > 1$) isolates $B(O_{1,2})$; (4) on $(\mathbb{Z}_2, μ_{\mathrm{Haar}})$, the 2-adic Lyapunov exponent $λ_{\mathrm{Haar}} = \frac{1}{2}\ln(3/4) \approx -0.143841 < 0$ equals $\frac{1}{2}\ln|μ_f(O_{1,2})|$; and (5) we certify 20 theorems in Lean 4 (anc/CollatzAttractor.lean, 0 sorry). These results establish local Fatou invariants and 2-adic ergodic averages for $f(z)$, leaving open whether every $n_0 \in \mathbb{N}^+$ lies in $\bigcup_{k \ge 0} f^{-k}(B(O_{1,2}))$.

cs.LO · cs.SC · math.CV · math.DS

新论文 · v1arXiv:2611.03872

Learning Almost Complex and Complex Structures

Edward Hirst, Tancredi Schettini Gherardini, Tomás S. R. Silva, Jakob Stein

原文摘要

We study the numerical constructions of almost complex and complex structures on spheres and products of spheres up to real dimension six. Our general set-up parametrises almost complex structures via a global matrix field in an ambient Euclidean space, compressed by the tangent projector. The projector's algebraic residual measures the almost complex condition, while its Nijenhuis tensor is evaluated in the intrinsic norm of the round product metric. Polynomial features and neural networks are trained without prescribed targets to perform general searches for these structures. The almost complex search passes numerical admissibility checks on all nine examples that admit such structures and rejects $S^4$, where a topological obstruction is known. A matrix correction then enforces the almost complex identity, subject to a novel uniform admissibility condition. For integrability, a free polynomial representation with Levenberg-Marquardt optimisation learns the complex structures on $S^2\times S^2$, $S^3\times S^1$, $S^3\times S^3$ and $S^5\times S^1$, with the largest Nijenhuis norms found by adversarial search all below $10^{-9}$. These general searches were unsuccessful on $S^6$, $S^4\times S^2$ and $S^4\times T^2$. Therefore, for these three cases direct numerical reconstructions were built in torus-fibred coordinates. They are integrable by construction, satisfy their compatibility conditions to better than $10^{-11}$, and corroborate the recent constructions on $S^6$ and $S^4\times S^2$.

math.CV · cs.LG