Related papers: The Hadamard product and recursively defined seque…
Touchard-Riordan-like formulas are some expressions appearing in enumeration problems and as moments of orthogonal polynomials. We begin this article with a new combinatorial approach to prove these kind of formulas, related with integer…
We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution.…
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…
An extension of the product operator formalism of NMR is introduced, which uses the Hadamard matrix product to describe many simple spin 1/2 relaxation processes. The utility of this formalism is illustrated by deriving NMR…
An algebraic investigation on bicomplex numbers is carried out here. Particularly matrices and linear maps defined on them are discussed. A new kind of cartesian product, referred to as an idempotent product, is introduced and studied. The…
In this work, we illustrate and explore the use of Taylor series as solutions of differential equations. For a large a number of classes of differential equations in the literature, there are plenty of sources where the well known Taylor…
Hadamard matrices in $\{0,1\}$ presentation are square $m\times m$ matrices whose entries are zeros and ones and whose rows considered as vectors in $\Bbb R^m$ produce the Gram matrix of a special form with respect to the standard scalar…
The direct application of the definition of sorting in lattices is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a…
We search for triangular numbers that are multiples of other triangular numbers. It is found that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers that are triangular numbers and…
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical…
It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…
In this paper, we propose a numerical method for computing Hadamard finite-part integrals with an integral-power singularity at an endpoint, the part of the divergent integral which is finite as a limiting procedure. In the proposed method,…
We propose a generic framework to describe classical Ising-like models defined on arbitrary graphs. The energy spectrum is shown to be the Hadamard transform of a suitably defined sparse "coding" vector associated with the graph. We expect…
We use the well-known observation that the solutions of Jacobi's differential equation can be represented via non-oscillatory phase and amplitude functions to develop a fast algorithm for computing multi-dimensional Jacobi polynomial…
It is demonstrated how an explicit expression of the (partial) sum of Tetranacci numbers can be found and proved using generating functions and the Hadamard product. We also provide a Binet-type formula for generalized Fibonacci numbers, by…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…