Related papers: Automatic Generation of Convolution Identities for…
The last decade has witnessed the success of the traditional feature-based method on exploiting the discrete structures such as words or lexical patterns to extract relations from text. Recently, convolutional and recurrent neural networks…
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.…
We study the graded polynomial identities with a homogeneous involution on the algebra of upper triangular matrices endowed with a fine group grading. We compute their polynomial identities and a basis of the relatively free algebra,…
A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…
We derive new infinite series involving Fibonacci numbers and Riemann zeta numbers. The calculations are facilitated by evaluating linear combinations of polygamma functions of the same order at certain arguments.
By counting the numbers of periodic points of all periods for some interval maps, we obtain infinitely many new congruence identities in number theory.
We introduce two remarkable identities written in terms of single commutators and anticommutators for any three elements of arbitrary associative algebra. One is a consequence of other (fundamental identity). From the fundamental identity,…
An important aspect in the theory of algebras with polynomial identities is the study of the asymptotic behavior of the codimension sequence $c_n(A),\, n\geq 1,$ which measures the growth of polynomial identities of a given algebra $A$. In…
Using general identities for difference operators, as well as a technique of symbolic computation and tools from probability theory, we derive very general kth order (k \ge 2) convolution identities for Bernoulli and Euler polynomials. This…
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
The sequence $F_{dn+h}$ and its convolutions have (for $h=0$) been studied in a recent paper at the arxiv [arXiv:2603.08636]. The instance with general $h$ is more involved and uses Chebyshev polynomials.
The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…
Angular parts of certain solvable models are studied. We find that an extension of this class may be based on suitable trigonometric identities. The new exactly solvable Hamiltonians are shown to describe interesting two- and three-particle…
Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give…
We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to…
We find exact identities for sums of the form \begin{equation*}\label{eq:convsumabs} \sum_{\stackrel{n_1+n_2 = n}{n_1 \in \mathbb{Z} \setminus \{ 0, n \} }} Q(n_1,n_2) \sigma_{-r_1}(n_1) \sigma_{-r_2}(n_2), \end{equation*} where…
We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
We prove an interesting identity for the sum of determinants, which is a generalization of the sum of a geometric progression. The proof is quite long and a number of other identities are proved along the way. Some of the more elementary…
Associative algebras with involution over a field of zero characteristic are considered. It is proved that in this case for any finitely generated associative algebra with involution there exists a finite dimensional algebra with involution…