406+ open-access research outputs.
In a seminal work, Chatterjee and Durrett (2009) established that for the SIS epidemic process on random graphs with power-law degree distributions, the infection survives for an exponentially long tiโฆ
Diffusion models have emerged as powerful generative priors for solving PDE-constrained inverse problems. Compared to end-to-end approaches relying on massive paired datasets, explicitly decoupling thโฆ
In this paper, we prove a conjecture by Daniele Mundici on the sum of squared distances between consecutive elements in the $Q$-th Farey sequence for $Q\in\mathbb{Z}$ and $Q\geq 2$.โฆ
Inspired by the recent 90th anniversary of the Scottish Book we present some reflections about its impact. First we discuss new areas of mathematics it helped launch. Then we argue that it was activelโฆ
The goal of this paper is to compute the motivic local density of an isolated algebraic surface singularity, in order to explain its link with algebraic multiplicity. In this context, we can use an adโฆ
The continuous quadratic knapsack (CQK) problem involves minimizing a diagonal convex quadratic function subject to box constraints and a single linear equality constraint. It has numerous applicationโฆ
We present a structure-aware parallel presolve framework specialized to arrowhead linear programs (AHLPs) and designed for high-performance computing (HPC) environments, integrated into the parallel iโฆ
We address the question of normal-crossings-preserving resolution of singularities (NC-preserving resolution), and compare the cases of characteristic 0 and characteristic 2. In characteristic 0, itโฆ
We consider the mean-field noisy Kuramoto-Daido model, which is a McKean-Vlasov equation on the circle with bimodal interaction $W(\theta)=\cos\theta+m\cos2\theta$ for $m\ge 0$ and interaction strengtโฆ
In this paper we investigate the chromatic number of the Grassmann graphs and of their powers, denoted $J_q(n,m,t)$. In this graph, the vertices correspond to the $m$-dimensional subspaces in $\mathbbโฆ
Given a simple graph $G$, its $A_\alpha$ matrix is a convex combination with parameter $\alpha\in [0,1]$ of its adjacency matrix and its degree diagonal matrices. Here we compare two lower bounds presโฆ
We analyse weighted Motzkin paths with step multiplicities that vary linearly with height. In the balanced case the associated exponential generating function satisfies a Pearson-type PDE, and solvingโฆ
We establish power saving asymptotics for the sum of the divisor function along a binary quartic form, improving on work of Daniel. The proof involves an application of a recent two dimensional delta โฆ
Flow cones of a directed acyclic graph admit a family of unimodular triangulations given by Danilov, Karzanov, and Koshevoy (DKK) whose normal fans are related to (generalizations) of the associahedroโฆ
Probing is an important presolving technique in mixed-integer programming solvers. It selects binary variables, tentatively fixes them to 0 and 1, and performs propagation to deduce additional variablโฆ
We study the integral models of meta-unitary Shimura varieties through the lens of Scholze's fiber product conjecture. Reformulating Bultel's original construction in terms of moduli stacks of Shtukasโฆ
We present a strengthening of the proof of the St\'ephanois theorem. We follow the modular version by Waldschmidt, which is based in a suggestion by Daniel Bertrand, but it also applies to the originaโฆ
In this paper, we investigate dead-core problems for fully nonlinear degenerate parabolic equations with strong absorption, \begin{equation*} |Du|^{p} F(D^{2}u) - u_{t} = \lambda_{0}(x,t)\, u^{\mu}\โฆ
For a fixed constant $\lambda > 0$ and a bounded Lipschitz domain $\Omega \subset \mathbb{R}^n$ with $n \geq 2$, we establish that almost-minimizers (functions satisfying a sort of variational inequalโฆ
We introduce a new broadly unifying family of combinatorial objects, which we call permutation flows, associated to an acyclic directed graph $G$ together with a framing $F$. This new family is combinโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ