6,151+ open-access research outputs.
We address the question of the large-time behavior of solutions to reaction-diffusion equations in periodic media. We start with the description of the asymptotic shape of the invasion set, which is cโฆ
Modern stochastic optimization pipelines increasingly rely on learned generative models to represent uncertainty, while downstream decisions are evaluated almost entirely through Monte Carlo scenariosโฆ
We prove that any random variable $X$ whose moment generating function is point-wise upper bounded by that of $ G \sim \mathcal{N}(0,1) $ must be dominated by $ G/\mathbb{E}[|G|] $ in convex order, meโฆ
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 โฆ
We derive an identity for the determinant of the sum of two $n\times n$ matrices, $A$ and $B$, whose entries are defined via contour integrals. Specifically, we consider $A(i,j)=\frac{1}{2\pi\mathrm{iโฆ
We study the expected number of rolls required for the cumulative sum of a fair six-sided die to first enter a prescribed target set $H\subset\mathbb{Z}_{\ge0}$. A one-variable dynamic-programming forโฆ
We give a direct algebraic proof of the necessity direction in the single-point higher-order Szeg\H{o} sum rules on the unit circle for $m=1,2,3$. More precisely, for $H_m(e^{i\theta})=(1-\cos\theta)^โฆ
By results of Dantzig (1951) and Adler (2013), computing the optimal solutions of a linear program is equivalent to finding optimal strategies in zero-sum bimatrix games. Dantzig's original result wasโฆ
In this paper, we have studied the hyponormality and invertibility of the operator of type $wT_{\varphi}+T_{\psi}$ where $w$ is any non-zero complex number and $T_{\varphi}, T_{\psi} $ are Toeplitz opโฆ
A Newton--Kantorovich-type argument enables the a posteriori existence verification of a unique regular root near a computed approximation, purely from computable data. This framework allows for non-sโฆ
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โฆ
Utilising recent advances in incidence geometry for balls and tubes, and advances in sum-product theory in the discrete setting, we show that for $0 < s \leq 1/2$ and for any $A \subset \mathbb{R}$ wiโฆ
In computational science workflows, it is often the case that 1) objective functions for optimization involve multiple simulation outputs, and 2) those simulations can be performed (at least partiallyโฆ
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 โฆ
Let $\tau(n)$ denote the classical divisor function. In this paper, we consider the hyperbolic fractional sum of the divisor function defined by $$ T(x) = \sum_{n_1 n_2 \leqslant x} \tau\left( \left[ โฆ
Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality established by Tao oโฆ
We consider what we refer to as {Decision-Focused Federated Learning (DFFL)} framework, i.e., a predict-then-optimize approach employed by a collection of agents, where each agent's predictive model iโฆ
We define the Verma vector system for each finite dimensional irreducible representation of the orthosymplectic Lie superalgebra $\mathfrak{spo}(4|1)$ with the highest weight $\lambda,$ via the conditโฆ
In this paper, we consider 2D incompressible Euler equations in an unbounded domain with a free surface and a fixed bottom at finite depth. The fluid motion is under the influence of gravity and surfaโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ