1,446+ 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…
In 2014, Michal Lewicki and Andrzej Olbry\'s proved that if a real valued function $f$ defined on the real line satisfies the conditional functional equation \[ f(tx + (1-t)y) = t f(x) + (1-t) f(y),\q…
Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph …
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 prove that on a semisimple Lie algebra $\mathfrak{g}$ over a finite field of large characteristic, if a complex-valued invariant function $f$ and its Fourier transform $\hat f$ are both supported i…
We study the edge-expansion of the graph of a random $0/1$ polytope $P^d_p$, defined as the convex hull of a random subset of the points in $\{0,1\}^d$ where every point is retained independently and …
The extent to which the geometry of an object is determined by some associated spectral data is a longstanding problem. We investigate this problem in the context of the Steklov spectrum, focusing on …
Biochemical signalling cascades transduce extracellular stimuli into cellular responses through sequences of discrete, node-to-node activations. While signal fidelity depends critically on local inter…
A 0/1-polytope is the convex hull of a subset $V\subseteq \{0,1\}^n$. A celebrated conjecture of Mihail and Vazirani asserts that the graph of every 0/1-polytope has edge-expansion at least 1. In this…
For a set of $n$ points $V \subseteq \mathbb{R}$ let $G(V, p)$ be the random graph on $V$ where each possible edge is present independently with probability $p$. We call a subset $U \subseteq V$ {\emp…
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.…
The notion of asymptotic space for an unbounded metric space has been introduced by Micha Gromov in 1980s. It is intended to capture the structure of a metric space at infinity. The most comprehensive…
We give a categorical proof of the projectivity of $N$ in the free topos -- in proof-theoretic terms, the rule of countable choice for intuitionistic higher-order logic -- based on the unpublished pro…
The notion of $\ast$-measure on a compact Hausdorff space can be defined for arbitrary continuous triangular norm $\ast$. The well-known Hutchinson-Barnsley theory deals with the iterated function sys…
To model amplification Polymerase Chain Reaction (PCR) techniques targeting DNA sequences of several types, we introduce a multitype PCR branching process as a generalized version of the Michaelis-Men…
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 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…
Oriented graph discrepancy problems focus on finding specific subgraphs within a given oriented graph $G$ that contain a significant number of edges in one direction. This concept was first introduced…
Free open-access publishing with Google Scholar indexing.
Submission Guide →