Related papers: A Linear Division-Based Recursion with Number Theo…
Under certain mild conditions, some limit theorems for functionals of two independent Gaussian processes are obtained. The results apply to general Gaussian processes including fractional Brownian motion, sub-fractional Brownian motion and…
We study a class of semilinear diffusion equations on infinite, connected, weighted graphs, focusing on two types of nonlinearities: monotone decreasing and Lipschitz continuous. Under minimal structural assumptions on the graph, we…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
A connection between fractional calculus and statistical distribution theory has been established by the authors recently. Some extensions of the results to matrix-variate functions were also considered. In the present article, more results…
Using the theory of functions of several variables and $q$-calculus, we prove an expansion theorem for the analytic function in several variables which satisfies a system of $q$-partial differential equations. Some curious applications of…
We use actions by finite cyclic groups to derive generalizations of three classical theorems from elementary number theory.
The two Fresnel Integrals are real and imaginary part of the integral over complex-valued exp(ix^2) as a function of the upper limit. They are special cases of the integrals over x^m*exp(i*x^n) for integer powers m and n, which are…
In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…
This study involves definitions for multiple-counting regular and summation sequences of rho. My paper introduces and proves recurrent relationships for multiple-counting sequences and shows their association with Fermat's little theorem. I…
In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…
Quantitative limit theorems for non-linear functionals on the Wiener space are considered. Given the possibly infinite sequence of kernels of the chaos decomposition of such a functional, an estimate for different probability distances…
In this paper we study the tightness of solutions for a family of recursion equations. These equations arise naturally in the study of random walks on tree-like structures. Examples include the maximal displacement of a branching random…
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…
In this article, we investigate sparse subsets of the natural numbers and study the sparseness of some sets associated with the Euler's totient function $\phi$ via the property of `Banach Density'. These sets related to the totient function…
We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstr\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur…
We consider an analytic function $f$ whose zero set forms a unit intensity Poisson process on the real line. We show that repeated differentiation causes the zero set to converge in distribution to a random translate of the integers.
We extend the theory of infinite-exponent partition relations to arbitrary linear order types, with a particular focus on the real number line. We give a complete classification of all consistent partition relations on the real line with…
In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…
Let $\phi(n)$denote Euler's phi function. We study the distribution of the numbers $gcd(n,\phi(n))$ and their divisors. Our results generalize previous results of Erd\H{o}s and Pollack.
We discuss an extension of classical combinatorics theory to the case of spatially distributed objects.