Related papers: Convolutions power of a characteristic function

We prove an asymptotic formula for the shifted convolution of the divisor functions $d_3(n)$ and $d(n)$, which is uniform in the shift parameter and which has a power-saving error term. The method is also applied to give analogous estimates…

In this paper, the classical problem of the probabilistic characterization of a random variable is re-examined. A random variable is usually described by the probability density function (PDF) or by its Fourier transform, namely the…

This paper is devoted to studying the first-order variational analysis of non-convex and non-differentiable functions that may not be subdifferentially regular. To achieve this goal, we entirely rely on two concepts of directional…

Because the stochastic calculus yields rarely random variables with laws defined by explicit closed formulas, probabilistic numerical computations are done most often by simulation. The simulation by the shift, whose field of application is…

A piecewise Chebyshevian spline space is good for design when it possesses a B-spline basis and this property is preserved under knot insertion. The interest in such kind of spaces is justified by the fact that, similarly as for polynomial…

The singular values of convolutional mappings encode interesting spectral properties, which can be used, e.g., to improve generalization and robustness of convolutional neural networks as well as to facilitate model compression. However,…

In a seminal paper, Valiant (2006) introduced a computational model for evolution to address the question of complexity that can arise through Darwinian mechanisms. Valiant views evolution as a restricted form of computational learning,…

Fa\`a di Bruno's formula gives an expression for the derivatives of the composition of two real-valued functions. In this paper we prove a multivariate and synthesized version of Fa\`a di Bruno's formula in higher dimensions, providing a…

In this paper, we give one possible definition for functions of several variables applied to endomorphisms of finite dimensional C-vector spaces. This definition is consistent with the usual notion of a function of a square matrix. Some…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

Boolean functions are mathematical objects used in diverse applications. Different applications also have different requirements, making the research on Boolean functions very active. In the last 30 years, evolutionary algorithms have been…

We discuss and prove a number of results for calculating characteristic cycles, or graded, enriched characteristic cycles. We concentrate particularly on results related to hypersurfaces.

Inspired by two basic mechanisms in animal visual systems, we introduce a feature transform technique that imposes invariance properties in the training of deep neural networks. The resulting algorithm requires less parameter tuning, trains…

We discuss the functional lazy techniques in generation and handling of arbitrarily long sequences of derivatives of numerical expressions in one ``variable''; the domain to which the paper belongs is usually nicknamed ``Automatic…

Probabilistic circuits (PCs) represent a probability distribution as a computational graph. Enforcing structural properties on these graphs guarantees that several inference scenarios become tractable. Among these properties, structured…

The paper is devoted to a comprehensive second-order study of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and variational analysis, specifically those related to…

A unification of characteristic mode decomposition for all method-of-moment formulations of field integral equations describing free-space scattering is derived. The work is based on an algebraic link between impedance and transition…

Functions are a fundamental object in mathematics, with countless applications to different fields, and are usually classified based on certain properties, given their domains and images. An important property of a real-valued function is…

Catamorphisms are functions that are recursively defined on list and trees and, in general, on Algebraic Data Types (ADTs), and are often used to compute suitable abstractions of programs that manipulate ADTs. Examples of catamorphisms…

This paper characterizes the inherent power of evolutionary algorithms. This power depends on the computational properties of the genetic encoding. With some encodings, two parents recombined with a simple crossover operator can sample from…