Results 31 to 40 of about 599 (109)
Isoperimetric inequalities on slabs with applications to cubes and Gaussian slabs
Communications on Pure and Applied Mathematics, Volume 79, Issue 4, Page 1012-1072, April 2026.Abstract We study isoperimetric inequalities on “slabs”, namely weighted Riemannian manifolds obtained as the product of the uniform measure on a finite length interval with a codimension‐one base. As our two main applications, we consider the case when the base is the flat torus R2/2Z2$\mathbb {R}^2 / 2 \mathbb {Z}^2$ and the standard Gaussian measure
Emanuel Milman
wiley +1 more source
Optimal control and cost-effective analysis of an age-structured emerging infectious disease model. [PDF]
Infect Dis Model, 2022 Jia P, Yang J, Li X.
europepmc +1 more source
On universal unbiasedness of delta estimators [PDF]
, 1999 This paper considers delta estimators of a Radon-Nicodym derivative of a probability function with respect to a measure. Sufficient conditions for asymptotic unbiasedness and global rates of convergence, which can be improved by imposing ...
Delgado, Miguel A., Vidal-Sanz, Jose M.
core +1 more source
Some bounds related to the 2‐adic Littlewood conjecture
Mathematika, Volume 72, Issue 2, April 2026.Abstract For every irrational real α$\alpha$, let M(α)=supn⩾1an(α)$M(\alpha) = \sup _{n\geqslant 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or ∞$\infty$, if unbounded). The 2‐adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational α$\alpha$ such that M(2kα)$M(2^k \alpha)$ is ...
Dinis Vitorino, Ingrid Vukusic
wiley +1 more source
Randomly generated polytopes for testing mathematical programming algorithms [PDF]
Randomly generated polytopes are used frequently to test and compare algorithms for a variety of mathematical programming problems. These polytopes are constructed by generating linear inequality constraints with coefficients drawn independently from a ...
Dam, W.B. van
core +1 more source
Discrepancy of arithmetic progressions in boxes and convex bodies
Mathematika, Volume 72, Issue 2, April 2026.Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source
Variants of a theorem of Macbeath in finite‐dimensional normed spaces
Mathematika, Volume 72, Issue 2, April 2026.Abstract A classical theorem of Macbeath states that for any integers d⩾2$d \geqslant 2$, n⩾d+1$n \geqslant d+1$, d$d$‐dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with n$n$ vertices.
Zsolt Lángi, Shanshan Wang
wiley +1 more source
Large deviations for singular and degenerate diffusion models in adaptive evolution [PDF]
, 2009 In the course of Darwinian evolution of a population, punctualism is an important phenomenon whereby long periods of genetic stasis alternate with short periods of rapid evolutionary change.
Champagnat, Nicolas
core +3 more sources
Mathematical Methods in the Applied Sciences, Volume 49, Issue 4, Page 2135-2160, 15 March 2026.ABSTRACT It is an elementary fact in the scientific literature that the Lipschitz norm of the realization function of a feedforward fully connected rectified linear unit (ReLU) artificial neural network (ANN) can, up to a multiplicative constant, be bounded from above by sums of powers of the norm of the ANN parameter vector.
Arnulf Jentzen, Timo Kröger
wiley +1 more source
Consistent Density Deconvolution under Partially Known Error Distribution [PDF]
We estimate the distribution of a real-valued random variable from contaminated observations. The additive error is supposed to be normally distributed, but with unknown variance.
Schwarz, Maik, Van Bellegem, Sébastien
core