Related papers: Transformations Integer Sequences And Pairing Func…
Combining the derivative operator with a binomial sum from the telescoping method, we establish a family of summation formulas involving generalized harmonic numbers.
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…
A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…
The Hankel transform of an integer sequence is a much studied and much applied mathematical operation. In this note, we extend the notion in a natural way to sequences of $d$ integer sequences. We explore links to generalized continued…
In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal…
In this paper we present a special formula for transforming integrals to series. The resulting series involves binomial transforms with the Taylor coefficients of the integrand. Five applications are provided for evaluating challenging…
In this paper, we give recurrence relations and identities for some integer sequences related to Ward numbers such as Ward-Lah numbers, varied Ward numbers and binomial Ward numbers. Most of the sequences are entered in the On-Line…
This note presents the basic mathematical structure of a new integer factorization method based on systems of linear Diophantine equations.
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
In this paper, we study some new factorizations of period-doubling sequences over a $k$-letter alphabet, where $k\geq 2$. First, we define the combinatorial and arithmetic properties of these sequences. Then, we define the kernel words of…
Remarks on the Cantor's nondenumerability proof of 1891 that the real numbers are noncountable will be given. By the Cantor's diagonal procedure, it is not possible to build numbers that are different from all numbers in a general assumed…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
We investigate a general method that allows one to construct new integer sequences extending existing ones. We apply this method to the classic Somos-4 and Somos-5, and the Gale-Robinson sequences, as well as to more general class of…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
Extending earlier work of R. Donaghey and P. J. Cameron, we investigate some canonical "eigen-sequences" associated with transformations of integer sequences. Several known sequences appear in a new setting: for instance the sequences (such…
In the present article, modeling certain rational numbers, that are represented in terms of Cantor series, are described. The statements on relations between digits in the representations of rational numbers by Cantor series (for the case…
We introduce a hybridization of digital sequences with uniformly distributed sequences in the domain of $b$-adic integers, $\mathbb Z_{b}, b\in\mathbb N\setminus\{1\}$, by using such sequences as input for generating matrices. The…
In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural…
An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…