Related papers: Additive transform of an arithmetic function : Par…
Two approximations, derived from continuous expansions of Riemann-Liouville fractional derivatives into series involving integer order derivatives, are studied. Using those series, one can formally transform any problem that contains…
For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…
Explaining why aggregated measures change is a critical challenge in data analytics that existing systems struggle to address. While current attribution methods exist, they lack a unified solution that is simultaneously general for…
Existing approaches to combine both additive and multiplicative neural units either use a fixed assignment of operations or require discrete optimization to determine what function a neuron should perform. However, this leads to an…
Symbolic Regression searches for a function form that approximates a dataset often using Genetic Programming. Since there is usually no restriction to what form the function can have, Genetic Programming may return a hard to understand…
A type of fractional derivative, referred to as \alpha-derivative, is studied. The \alpha-derivative of fractional type obeys Leibnitz rule. Based on the definition of \alpha-derivative the operations of analysis and differential geometry…
In this paper, we will extend the falling and rising factorial transforms \cite{ref. 1} which in this case every arbitrary function can be applied. Then, the properties of these transforms will be investigated and some corollaries will be…
In many network problems, graphs may change by the addition of nodes, or the same problem may need to be solved in multiple similar graphs. This generates inefficiency, as analyses and systems that are not transferable have to be…
The unprecedented performance achieved by deep convolutional neural networks for image classification is linked primarily to their ability of capturing rich structural features at various layers within networks. Here we design a series of…
An arithmetic function $f$ is called a $sieve$ $function$ of $range$ $Q$ if its Eratosthenes transform $g=f\ast\mu$ has support in $[1,Q]$, where $g(q)\ll_{\varepsilon} q^{\varepsilon}$ ($\forall\varepsilon>0$). We continue our study of the…
We present a method using contour integration to derive definite integrals and their associated infinite sums which can be expressed as a special function. We give a proof of the basic equation and some examples of the method. The advantage…
We study the questions of determining the asymptotics of the probabilistic characteristics of additive arithmetic functions in the paper, regardless of whether they have a limit distribution or not. Several assertions are proved about the…
The well-known $|supp(f)||supp(\widehat{f}|\geq |G|$ inequality gives lower estimation of each supports. In the present paper we give upper estimation under arithmetic constrains. The main notion will be the additive energy which plays a…
For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…
The $\Sopfr(n)$ function is defined as the sum of prime factors of $n$ each of which is taken with its multiplicity. This function is studied numerically. The analogy between $\Sopfr(n)$ and the primes distribution function is drawn and…
A tree functional is called additive if it satisfies a recursion of the form $F(T) = \sum_{j=1}^k F(B_j) + f(T)$, where $B_1,\ldots,B_k$ are the branches of the tree $T$ and $f(T)$ is a toll function. We prove a general central limit…
This paper explores the innovative application of the Fractional Fourier Transform (FrFT) in sound synthesis, highlighting its potential to redefine time-frequency analysis in audio processing. As an extension of the classical Fourier…
The so-called polynomial equations play an important role both in algebra and in the theory of functional equations. If the unknown functions in the equation are additive, relatively many results are known. However, even in this case, there…
We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…
Let $f(n)$ be a strongly additive complex valued arithmetic function. Under mild conditions on $f$, we prove the following weighted strong law of large numbers: if $ X,X_1,X_2,... $ is any sequence of integrable i.i.d. random variables,…