Related papers: The method for obtaining expressions for coefficie…
In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
The main objective of this paper is to introduce the modified q-Genocchi polynomials and to define their generating function. In the paper, we show new relations, which are explicit formula, derivative formula, multiplication formula, and…
Every one knows that an equation is equivalent to a multivariate function. Generally speaking, there are more than one unknown x in this multivariate function and it is not easy to reduce the number of unknown x to one. In this paper we…
The main aim of this paper is to provide a novel approach to deriving identities for the Bernstein polynomials using functional equations. We derive various functional equations and differential equations using generating functions.…
We investigate a family of integrals involving modified Bessel functions that arise in the context of neutrino scattering. Recursive formulas are derived for evaluating these integrals and their asymptotic expansions are computed. We prove…
Let $\{a_\rr : \rr \in (\Z^+)^d \}$ be a $d$-dimensional array of numbers, for which the generating function $F(\zz) := \sum_\rr a_\rr \zz^\rr$ is meromorphic in a neighborhood of the origin. For example, $F$ may be a rational multivariate…
Field-theoretic construction of functional representations of solutions of stochastic differential equations and master equations is reviewed. A generic expression for the generating function of Green functions of stochastic systems is put…
Let G be a group generated by $r$ elements $g_1,g_2,..., g_r.$ Among the reduced words in $g_1,g_2,..., g_r$ of length $n$ some, say $\gamma_n,$ represent the identity element of the group $G.$ It has been shown in a combinatorial way that…
A recursive random number generator using prime reciprocals is described.
We describe a method for constructing characters of combinatorial Hopf algebras by means of integrals over certain polyhedral cones. This is based on ideas from resurgence theory, in particular on the construction of well-behaved averages…
This paper provides a unifying view of a wide range of problems of interest in machine learning by framing them as the minimization of functionals defined on the space of probability measures. In particular, we show that generative…
We recover Gessel's determinantal formula for the generating function of permutations with no ascending subsequence of length m+1. The starting point of our proof is the recursive construction of these permutations by insertion of the…
Let $F$ be a field of non-zero characteristic $p$, let $G$ be a cyclic group of order $q =p^a$ for some positive integer $a$, and let $U$ and $W$ be indecomposable $F G$-modules. We identify a generator for each of the indecomposable…
We present a method of computing the generating function $f_P(\x)$ of $P$-partitions of a poset $P$. The idea is to introduce two kinds of transformations on posets and compute $f_P(\x)$ by recursively applying these transformations. As an…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
In software reverse engineering, decompilation is the process of recovering source code from binary files. Decompilers are used when it is necessary to understand or analyze software for which the source code is not available. Although…
The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…