Related papers: A Study of Second-Order Linear Recurrence Sequence…
Repdigits are natural numbers formed by the repetition of a single digit. In this paper, we study the problem of writing repdigits as the difference of two balancing or Lucas-balancing numbers. The method of proof involves the application…
Convolutions for Tribonacci numbers involving binomial coefficients are treated with ordinary generating functions and the diagonalization method of Hautus and Klarner. In this way, the relevant generating function can be established, which…
The Linear Representation Hypothesis (LRH) states that neural networks learn to encode concepts as directions in activation space, and a strong version of the LRH states that models learn only such encodings. In this paper, we present a…
In this paper we study the sets of integers which are $n$-th terms of Lucas sequences. We establish lower- and upper bounds for the size of these sets. These bounds are sharp for $n$ sufficiently large. We also develop bounds on the growth…
In this paper, we define the bi-periodic Fibonacci matrix sequence that represent bi-periodic Fibonacci numbers. Then, we investigate generating function, Binet formula and summations of bi-periodic Fibonacci matrix sequence. After that, we…
We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials' $ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials . Secondly,…
We consider the theoretical and numerical aspects of the quadrature rules associated with a sequence of polynomials generated by a special $R_{II}$ recurrence relation. We also look into some methods for generating the nodes (which lie on…
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…
Second order approximate ancillaries have evolved as the primary ingredient for recent likelihood development in statistical inference. This uses quantile functions rather than the equivalent distribution functions, and the intrinsic…
The basis of this work is a simple, extended corollary of Wilson's theorem. This corollary generates many more quotients than those already generated by Wilson's theorem, and it was of interest to derive how they relate to each other and…
The order of orbit generation in one-dimensional Lorenz-like maps is presented within a two letter symbolics scheme. This order is derived from the natural order of a set of fractions associated to the binary sequences. Its relation to the…
Causal discovery with latent variables is a crucial but challenging task. Despite the emergence of numerous methods aimed at addressing this challenge, they are not fully identified to the structure that two observed variables are…
Recovering causal structure in the presence of latent variables is an important but challenging task. While many methods have been proposed to handle it, most of them require strict and/or untestable assumptions on the causal structure. In…
This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
We give a concise introduction to the theory of continuants and show how Perron used them in his proof of Tietze theorem on the convergence of infinite semi-regular continued fractions, as well as for the study of the convergence of purely…
We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…
Let x(n) be a recurrence relation. The main purpose of this article is to determine a recurrence for powers of x(n).
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
We use the generating function of the characters of $C_2$ to obtain a generating function for the multiplicities of the weights entering in the irreducible representations of that simple Lie algebra. From this generating function we derive…