Zhefan Duan | Searcharxiv

arXiv2026

Logarithmic $A_{\mathrm{inf}}$-cohomology, Part II

We develop a theory of logarithmic $A_{\mathrm{inf}}$-cohomology with coefficients for a class of $p$-adic log formal schemes that are ``sufficiently log smooth'', where the coefficients are given by relative log BKF modules. Then we establish comparison isomorphisms with étale, de Rham, and crystalline cohomology, and also extend these results to the derived setting. As an application, we give a new proof of the $C_{\mathrm{st}}$ conjecture for semistable local systems. The proof also uses the prismatic interpretation of semistable local systems established by Du--Liu--Moon--Shimizu.

math.AG↗

arXiv2026

Norm-Query Complexity of Algorithmic Problems in Finite-Dimensional p-adic Normed Spaces

We study the deterministic norm-query complexity of computational problems in finite-dimensional vector spaces over $\mathbb{Q}_p$ equipped with an arbitrary ultrametric norm. For orthogonalization, we prove that no uniform finite query bound depending only on the dimension exists: for every deterministic algorithm that produces an $N$-orthogonal basis for every ultrametric norm $N$, the number of norm queries is unbounded as $N$ varies. We then study the Longest Vector Problem (LVP) for a rank-$m$ $p$-adic lattice. By adapting a brute-force search to the general norm-query setting and eliminating the scalar redundancy among nonzero coefficient vectors modulo $p$, we obtain an algorithm using exactly $(p^m-1)/(p-1)$ norm queries for $m\ge 2$, and prove that no deterministic norm-query algorithm can use fewer queries in the worst case. Finally, we consider the Closest Vector Problem (CVP). Apart from the trivial cases in which no norm query is needed, we prove that the deterministic worst-case norm-query complexity of the CVP is unbounded, even when the lattice and the target vector are fixed.

cs.CC↗