1,286+ open-access research outputs.
We give a damped inexact Newton method for entropy-regularized least-squares on the nonnegative orthant that converges globally at a linear rate with $O(\log\epsilon^{-1})$ iteration complexity, local…
For a sequence $\gamma=(\gamma_n)_{n\ge 1}$, define \[ L_\gamma(z):=\sum_{n\ge 1}\gamma_n\frac{z^n}{1-z^n} =\sum_{n\ge 1}\Bigl(\sum_{d\mid n}\gamma_d\Bigr)z^n. \] We prove a short rigidity theorem: if…
We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q…
In this paper, we first derive the compressible Navier-Stokes/Landau-Lifshitz-Gilbert (NS-LLG) model for magnetoelastic materials via the energetic variational approach (EnVarA). It is important to em…
We give a new simple geometric proof that any seven points in the plane have four Tverberg partitions into three sets. This is the only confirmed non-trivial case of Sierksma's conjecture. Earlier pro…
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We prove this for every nonrecursive \ce\ many-one degree containing a $D$-maximal set.…
We establish Grauert--Riemenschneider vanishing for $F$-pure threefolds over a perfect field $k$ of characteristic $p>5$. We apply this to prove Steenbrink vanishing for three-dimensional sharply $F$-…
We give an algorithm to compute the Pyasetskii involution for $\mathrm{Sp}_{2n}$, $\mathrm{SO}_{2n+1}$ and $\mathrm{O}_{2n}$. The algorithm is a combination of Moeglin-Waldspurger's algorithm for the …
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerab…
We study the symmetric simple exclusion process with Glauber dynamics. When the process starts from a nonequilibrium measure, we prove central limit theorems for the occupation time in dimension two, …
We establish two identities for Lambert series and double Lambert series, thereby resolving conjectures of Andrews, Dixit, Schultz and Yee (Acta Arith.~181:253--286, 2017), as well as Amdeberhan, Andr…
In this paper, we study the Koshliakov zeta function $\eta_p(s)$, whose theory appears to be more involved than that of its counterpart $\zeta_p(s)$, owing to the fact that its defining series is not …
Andrews, Dixit, Schultz, and Yee conjecture the parity of a double Lambert series. In 2026, Amdeberhan, Andrews, and Ballantine offer some ideas that are pointing in the right direction for the proof.…
We calculate the $K$-theory of the reduced $C^*$-algebra $C^*_r(G)$ of a reductive $p$-adic group $G$. To do so, we show that each direct summand in Plymen's Plancherel decomposition of $C^*_r(G)$ is …
We provide some historical context to the study of solid angles carried out by Euler in his memoir \emph{De mensura angulorum solidorum} (On the measure of solid angles). We extend our study to the ge…
We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees …
It is well known that the Grauert-Riemenschneider canonical sheaf $\mathcal{K}_X$ of holomorphic square-integrable $n$-forms is a central tool in $L^2$-theory for the $\overline\partial$-operator on a…
Spin-glasses are natural Gibbs distributions that have been studied in Theoretical CS for many decades. Recently, they have been gaining attention from the community as they emerge naturally in neural…
The Gilbert graph $\text{Gilbert}(q,n,d)$, which arises naturally in graph theory and coding theory, is the regular graph on $\mathbb{F}_q^n$ in which two vertices are adjacent if their Hamming distan…
We study a family of hyperbolic Lambert series of the form \[ S_m=\sum_{n=1}^\infty\left( \frac{n^{2m}}{\cosh(\pi n)-1} -\frac{(2^{2m+1}-(-1)^{m(m+1)/2}2^{m+1}+4) n^{2m}}{\cosh(2\pi n)-1} +\frac{2^{2m…
Free open-access publishing with Google Scholar indexing.
Submission Guide →