30,266+ open-access research outputs.
We adapt the Ozsv\'ath-Szab\'o full path algorithm to every star-shaped graph and establish a correspondence between negative-twisting tight contact structures on any Seifert fibred space over $S^2$, โฆ
We prove a transfer theorem for hereditary classes of $(r+1)$-uniform hypergraphs. Let $\mathcal G$ be such a class, and for $H\in\mathcal G$ write $\Delta(H)$ and $d(H)$ for the maximum degree and avโฆ
We consider smooth convex minimization over compact convex sets, i.e., $\min_{x \in C} f(x)$ with the (vanilla) Frank-Wolfe algorithm. Well-known lower bounds establish a worst-case $\Omega(1/t)$ primโฆ
We show that every minimally generically globally rigid graph in $\mathbb R^d$ which contains a subgraph isomorphic to $K_{d+2}$ is itself isomorphic to $K_{d+2}$, confirming a conjecture by Garamv{\"โฆ
We construct a block bootstrap max-test for detecting the presence of significant predictors in a high dimensional setting, allowing for weakly dependent and heterogeneous (possibly non-stationary) daโฆ
In this paper, we aim at estimating the quarticity of continuous It\^{o} semimartingales. Instead of using some classical estimators, we introduce a more intuitive one and establish a central limit thโฆ
We establish an It\^o-type formula for finite $p$-variation paths with jumps for arbitrary $p\geq 1$. The formula is stated in a fully pathwise form and separates the reduced rough integral from expliโฆ
Mirror symmetry predicts an action by the fundamental group of a conjectural stringy K\"ahler moduli space on the derived category of an algebraic variety. For a toric variety, a model for this space โฆ
Motivated by an optimal-matching problem (Leighton-Shor) and the random-field Ising model (Aizenman-Wehr, Ding-Wirth), we consider a variational problem for graphs in $1+1$ dimension maximizing an actโฆ
Let $Z=\{Z(t): t\in \mathbb R\}$ be a stochastic process with trajectories in space $\mathbb D (\mathbb R)$. It is assumed that there exists an essentially smooth function $A:\mathbb R\to (-\infty, \iโฆ
We introduce an entropy-compatible neural network method for scalar hyperbolic conservation laws based on a computable surrogate of the Kru\v{z}kov entropy residual. The proposed loss is designed to eโฆ
We propose a regularized Hessian-free Newton-type method for minimizing smooth convex functions with Lipschitz continuous Hessians. The algorithm constructs an approximate Hessian by finite differenceโฆ
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โฆ
Continuous data assimilation (CDA) nudges observational data into governing equations to recover the underlying flow and improve predictions. Existing rigorous CDA analyses focus primarily on incompreโฆ
We prove a refinement of Gromov's cowaist inequality in the case of Hermitian line bundles. Combined with the cowaist-systole estimates in recent work of Stryker, this gives sharp stable two-systolic โฆ
In this work, we study optimization specified only through a comparison oracle: given two points, it reports which one is preferred. We call it function-free optimization because we do not assume acceโฆ
We study the optimization of (strongly) quasar-convex functions, a class that arises naturally in many machine learning and data science applications due to its favorable properties. The fundamental pโฆ
Let $\mathcal{PO}_n$ be the monoid of all order-preserving partial transformations on $X_n=\{1,\dots, n\}$ with the natural order, and let $\mathcal{O}_n$ and $\mathcal{POI}_n$ denote its submonoids oโฆ
Let $\lambda$ denote the Liouville function. We prove that $$\sum_{X \leq x < 2X} \sup_{\alpha \in \mathbb{R}/\mathbb{Z}} \bigg\lvert\!\sum_{x \leq n < x+H} \lambda(n) e(n\alpha)\bigg\rvert = o(HX)$$ โฆ
In this work, we investigate the well-posedness of a stochastic heat equation with an arbitrary (but polynomial) nonlinearity in any dimension $d\geq 1$ perturbed by a multiplicative white noise in thโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ