Related papers: Roles of Log-concavity, log-convexity, and growth …
We study various regularization operators on plurisubharmonic functions that preserve Lelong classes with growth given by certain compact convex sets. The purpose is to show that the weighted Siciak-Zakharyuta functions associated with…
The paper considers the representation of k-valued logical functions in the class of disjunctive normal forms. Various classes of monotone functions of k-valued logic are investigated. Theorems are proved on the coincidence of reduced and…
We first prove that the Legendre transform is the only continuous and $\mathrm{SL}(n)$ contravariant valuation that behaves as a conjugation of two important translations on super-coercive, lower semi-continuous, and convex functions. Then…
Over the past few years considerable progress has been made on the resummation of double-logarithmically enhanced threshold (large-x) and high-energy (small-x) higher-order contributions to the splitting functions for parton and…
In several applications, such as \tsc{weno} interpolation and reconstruction [Shu C.W.: SIAM Rev. 51 (2009) 82--126], we are interested in the analytical expression of the weight-functions which allow the representation of the approximating…
In this paper, we consider the so-called Shape Invariant Model which stands for the estimation of a function f0 submitted to a random translation of law g0 in a white noise model. We are interested in such a model when the law of the…
We consider the class univalent log-harmonic mappings on the unit disk. Firstly, we obtain necessary and sufficient conditions for a complex-valued continuous function to be starlike or convex in the unit disk. Then we present a general…
This work considers the problem of finding a first-order stationary point of a non-convex function with potentially unbounded smoothness constant using a stochastic gradient oracle. We focus on the class of $(L_0,L_1)$-smooth functions…
An approach which unifies the Double Logarithmic Approximation at small x and the leading order DGLAP evolution of fragmentation functions at large x is presented. This approach reproduces exactly the Modified Leading Logarithm…
Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…
Training convolutional recurrent neural networks on first-order Ambisonics signals is a well-known approach when estimating the direction of arrival for speech/sound signals. In this work, we investigate whether increasing the order of…
Calculations of collinear correlation functions in perturbative QCD and Soft-Collinear Effective Theory (SCET) require a prescription for subtracting soft or zero-bin contributions in order to avoid double counting the contributions from…
In the $1970$s Nicolas proved that the coefficients $p_d(n)$ defined by the generating function \begin{equation*} \sum_{n=0}^{\infty} p_d(n) \, q^n = \prod_{n=1}^{\infty} \left( 1- q^n\right)^{-n^{d-1}} \end{equation*} are log-concave for…
We study a class of fully-discrete schemes for the numerical approximation of solutions of stochastic Cahn--Hilliard equations with cubic nonlinearity and driven by additive noise. The spatial (resp. temporal) discretization is performed…
Non-global logarithms arise from the sensitivity of collider observables to soft radiation in limited angular regions of phase space. Their resummation to next-to-leading logarithmic (NLL) order has been a long standing problem and its…
Following Lusztig, we consider a Coxeter group $W$ together with a weight function $L$. This gives rise to the pre-order relation $\leq_{L}$ and the corresponding partition of $W$ into left cells. We introduce an equivalence relation on…
The paper considers a global version of the notion of log canonical threshold for plurisubharmonic functions $u$ of logarithmic growth in $\mathbb{C}^n$, aiming at description of the range of all $p>0$ such that $e^{-u}\in…
We describe a slightly sub-exponential time algorithm for learning parity functions in the presence of random classification noise. This results in a polynomial-time algorithm for the case of parity functions that depend on only the first…
A fundamental construction in formal language theory is the Myhill-Nerode congruence on words, whose finitedness characterizes regular language. This construction was generalized to functions from $\Sigma^*$ to $\mathbb{Z}$ by Colcombet,…
Instead of a continuous system driven by Gaussian white noise, logical stochastic resonance will be investigated in a nonlinear bistable system with two thresholds driven by dichotomous noise, which shows a phenomenon different from…