Related papers: Number of ordered factorizations and recursive div…
A class of spherical functions is studied which can be viewed as the matrix generalization of Bessel functions. We derive a recursive structure for these functions. We show that they are only special cases of more general radial functions…
Let $f(n)$ denote the number of distinct unordered factorisations of the natural number $n$ into factors larger than 1.In this paper, we address some aspects of the function $f(n)$.
Existence results for Hilbert's problem 13th mean that any equation constructed by continue functions can be given solution represented as a superposition of continue functions of one variable or of continue functions of two variables.…
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending work of Biane. We deduce from our result a…
In this note we consider several kind of partition functions of one-dimensional models with nearest - neighbor interactions $I_n, n\in \mathbf{Z}$ and spin values $\pm 1$. We derive systems of recursive equations for each kind of such…
We consider some possible approaches to the fractional-order generalization of definition of variation (functional) derivative. Some problems of formulation of a fractional-order variational derivative are discussed. To give a consistent…
We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…
Through a brute-force approach to calculating the higher derivatives of the falling factorial function, a number of interesting quantities were obtained and analyzed. In particular, it was found that a quantity that can be described as the…
We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…
In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…
In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some…
We study the average order of the divisor function, as it ranges over the values of binary quartic forms that are reducible over the rationals.
Two distinct systems of commutative complex numbers in n dimensions are described, of polar and planar types. Exponential forms of n-complex numbers are given in each case, which depend on geometric variables. Azimuthal angles, which are…
A generalized version of the creation and annihilation operators is constructed and the factorization of the Schr\"odinger equation is investigated. It is shown that the generalized version of factorization operators yield a factorization…
We present Euler-type recurrence relations for some partition functions. Some of our results provide new recurrences for the number of unrestricted partitions of $n$, denote by $p(n)$. Others establish recurrences for partition functions…
We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…
We introduce a set of special functions called multiple polyexponential integrals, defined as iterated integrals of the exponential integral $\text{Ei}(z)$. These functions arise in certain perturbative expansions of the local solutions of…