Related papers: Integer Sequences: Irregular Arrays and Intra-Bloc…
Implicit regularization (IR) has been shown as an useful momentum space tool for perturbative calculations in dimension specific theories, such as chiral gauge, topological and supersymmetric quantum field theoretical models at one loop…
Investigation on open questions about perturbation of Hermitian sequences and their spectral symbols. Results on normal sequences are also furnished.
Iterative decoding techniques have gain popularity due to their performance and their application in most communications systems. In this paper, we present a new application of our iterative decoder on the GPCB (Generalized Parallel…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…
For any particularly interesting theorem one proof is never enough. Instead, the first proof sets the challenge to find a more elegant method that illuminates subtle features of the math, is simpler to understand, or even avoids using…
We provide a systematic formula, in terms of integer partitions, that generates perturbation theory explicitly at an arbitrary order. Our approach naturally includes an infinite number of perturbations and uses a single matrix equation that…
The dominant approach to sequence generation is to produce a sequence in some predefined order, e.g. left to right. In contrast, we propose a more general model that can generate the output sequence by inserting tokens in any arbitrary…
In this expository article we collect the integer sequences that count several different types of matrices over finite fields and provide references to the Online Encyclopedia of Integer Sequences (OEIS). Section 1 contains the sequences,…
In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…
Cantor sets of integers have a rich set of arithmetic combinatorial properties. We consider classical Cantor sets, with a base and a fixed set of allowed digits. For such sets, we (a) give examples of such sets that satisfy the intersective…
This note examines a problem in enumerative and asymptotic combinatorics involving the classical structure of integer compositions. What is sought is an analysis on average and in distribution of the length of the longest run of consecutive…
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 this paper we generalize notions of iterated integral with regard to an unpredictable process. We establish a formula of integration by parts, the existence of a continuous modification and give an expression of the increasing process.
Continued fractions with prescribed structures on sequences of their partial quotients have been intensively studied in the literature. As far as an integer sequence, especially a randomly generated one is concerned, an attractive question…
We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…
We investigate the arithmetic nature of P-recursive sequences through the lens of their D-finite generating functions. Building on classical tools from differential algebra, we revisit the integrality criterion for Motzkin-type sequences…
We give an explicit formula for the Hankel transform of a regular sequence in terms of the coefficients of the associated orthogonal polynomials and the sequence itself. We apply this formula to some sequences of combinatorial interest,…
To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of any integer monic polynomial by using…