Related papers: The method for obtaining expressions for coefficie…
We have been striving to exceed computational complexity, and in the process, we have come to realize the dilemma of classical computing, and in turn we realize that superpositioner may be a way to solve. A superpositioner is a model formed…
Let $M$ be a finite dimensional modular representation of a finite group $G$. We consider the generating function for the non-projective part of the tensor powers of $M$, and we write $\gamma_G(M)$ for the reciprocal of the radius of…
Text-to-image generative models have enabled high-resolution image synthesis across different domains, but require users to specify the content they wish to generate. In this paper, we consider the inverse problem -- given a collection of…
If \(A \) is a set of natural numbers containing \(0 \), then there is a unique nonempty "reciprocal" set \(B \) of natural numbers (containing \(0 \)) such that every positive integer can be written in the form \(a + b \), where \(a \in A…
A redundant generating function is a generating function having terms which are not part of the solution of the original problem. We use redundant generating functions to study two path problems. In the first application we explain a…
A generalization of the generating function for Gegenbauer polynomials is introduced whose coefficients are given in terms of associated Legendre functions of the second kind. We discuss how our expansion represents a generalization of…
We show how the combined use of the generating function method and of the theory of multivariable Hermite polynomials is naturally suited to evaluate integrals of gaussian functions and of multiple products of Hermite polynomials.
We consider the set of power functions defined on the set of positive real number, and their linear combinations. After recalling some properties of the gamma function, we give two general definitions of derivatives of positive and negative…
The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…
We generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition.
The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…
When humans perform inductive learning, they often enhance the process with background knowledge. With the increasing availability of well-formed collaborative knowledge bases, the performance of learning algorithms could be significantly…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential…
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of…
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.
Gaussian process (GP) models provide a powerful tool for prediction but are computationally prohibitive using large data sets. In such scenarios, one has to resort to approximate methods. We derive an approximation based on a composite…
This paper proves a reciprocity formula for modular inverses for non-zero integers and demonstrates some applications of the reciprocity formula in calculating or verifying some modular inverses of specific forms, including the modular…
This is the second of two articles devoted to an exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper focuses on fusion rules, using the machinery developed for tensor products in…
This paper is the confluence of two streams of ideas in the literature on generating numerical invariants, namely: (1) template-based methods, and (2) recurrence-based methods. A template-based method begins with a template that contains…