A new method for solving the linear recurrence relation with nonhomogeneous constant coefficients in some cases

Recursive relation mainly describes the unique law satisfied by a sequence, so it plays an important role in almost all branches of mathematics. It is also one of the main algorithms commonly used in computer programming. This paper first introduces the concept of recursive relation and two common basic forms, then starts with the solution of linear recursive relation with non-homogeneous constant coefficients, gives a new solution idea, and gives a general proof. Finally, through an example, the general method and the new method given in this paper are compared and verified.

An Effective S-Box Construction Based on Linear Recurrences With Constant Co-Efficient

In this paper, we propose an algorithm for the construction of substitution-box through a linear recurrence relation. S-box is considered as the building block of block ciphers; here we present a technique to construct Substitution-boxes by using linear recurrence relation to comply with the standards of good quality S-boxes. We have witnessed that the latest research relies more on improving already existing techniques, rather than developing wholly new methods. We use linear recurrence in an entirely new way. Real initial and obtained values are concealed by converting it into new numbers to avoid any pattern to follow. The obtained S-boxes are analyzed through performance tests to check the strength and quality of our S-boxes. Later we will encrypt an image and also perform encryption and decryption in noise channels to make it more applicable in low profile applications.

Weakly minimal groups with a new predicate

Fix a weakly minimal (i.e. superstable [Formula: see text]-rank [Formula: see text]) structure [Formula: see text]. Let [Formula: see text] be an expansion by constants for an elementary substructure, and let [Formula: see text] be an arbitrary subset of the universe [Formula: see text]. We show that all formulas in the expansion [Formula: see text] are equivalent to bounded formulas, and so [Formula: see text] is stable (or NIP) if and only if the [Formula: see text]-induced structure [Formula: see text] on [Formula: see text] is stable (or NIP). We then restrict to the case that [Formula: see text] is a pure abelian group with a weakly minimal theory, and [Formula: see text] is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of [Formula: see text]. Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form [Formula: see text]. Most notably, we show that if [Formula: see text] is a weakly minimal additive subgroup of the algebraic numbers, [Formula: see text] is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of [Formula: see text] is a root of unity, then [Formula: see text] is superstable for any [Formula: see text].

Representation of a quotient of solutions of a four-term linear recurrence relation in the form of a branched continued fraction

The quotient of two linearly independent solutions of a four-term linear recurrence relation is represented in the form of a branched continued fraction with two branches of branching by analogous with continued fractions. Formulas of partial numerators and partial denominators of this branched continued fraction are obtained. The solutions of the recurrence relation are canonic numerators and canonic denominators of $\mathcal{B}$-figured approximants. Two types of figured approximants $\mathcal{A}$-figured and $\mathcal{B}$-figured are often used. A $n$th $\mathcal{A}$-figured approximant of the branched continued fraction is obtained by adding a next partial quotient to the $(n-1)$th $\mathcal{A}$-figured approximant. A $n$th $\mathcal{B}$-figured approximant of the branched continued fraction is a branched continued fraction that is a part of it and contains all those elements that have a sum of indexes less than or equal to $n$. $\mathcal{A}$-figured approximants are widely used in proving of formulas of canonical numerators and canonical denominators in a form of a determinant, $\mathcal{B}$-figured approximants are used in solving the problem of corresponding between multiple power series and branched continued fractions. A branched continued fraction of the general form cannot be transformed into a constructed branched continued fraction. For calculating canonical numerators and canonical denominators of a branched continued fraction with $N$ branches of branching, $N>1$, the linear recurrent relations do not hold. $\mathcal{B}$-figured convergence of the constructed fraction in a case when coefficients of the recurrence relation are real positive numbers is investigated.

On the General Solution of the Heideman–Hogan Family of Recurrences

We consider a family of nonlinear rational recurrences of odd order which was introduced by Heideman and Hogan, and recently rediscovered in the theory of Laurent phenomenon algebras (a generalization of cluster algebras). All of these recurrences have the Laurent property, implying that for a particular choice of initial data (all initial values set to 1) they generate an integer sequence. For these particular sequences, Heideman and Hogan gave a direct proof of integrality by showing that the terms of the sequence also satisfy a linear recurrence relation with constant coefficients. Here we present an analogous result for the general solution of each of these recurrences.

Intervals without primes near elements of linear recurrence sequences

Let [Formula: see text] be an unbounded sequence of integers satisfying a linear recurrence relation with integer coefficients. We show that for any [Formula: see text] there exist infinitely many [Formula: see text] for which [Formula: see text] consecutive integers [Formula: see text] are all divisible by certain primes. Moreover, if the sequence of integers [Formula: see text] satisfying a linear recurrence relation is unbounded and non-degenerate then for some constant [Formula: see text] the intervals [Formula: see text] do not contain prime numbers for infinitely many [Formula: see text]. Applying this argument to sequences of integer parts of powers of Pisot and Salem numbers [Formula: see text] we derive a similar result for those sequences as well which implies, for instance, that the shifted integer parts [Formula: see text], where [Formula: see text] and [Formula: see text] runs through some infinite arithmetic progression of positive integers, are all composite.

Banach function norms via Cauchy polynomials and applications

Let X1,…,Xk be quasinormed spaces with quasinorms | ⋅ |j, j = 1,…,k, respectively. For any f = (f1,⋯,fk) ∈ X1 ×⋯× Xk let ρ(f) be the unique non-negative root of the Cauchy polynomial [Formula: see text]. We prove that ρ(⋅) (which in general cannot be expressed by radicals when k ≥ 5) is a quasinorm on X1 ×⋯× Xk, which we call root quasinorm, and we find a characterization of this quasinorm as limit of ratios of consecutive terms of a linear recurrence relation. If X1,…,Xk are normed, Banach or Banach function spaces, then the same construction gives respectively a normed, Banach or a Banach function space. Norms obtained as roots of polynomials are already known in the framework of the variable Lebesgue spaces, in the case of the exponent simple function with values 1,…,k. We investigate the properties of the root quasinorm and we establish a number of inequalities, which come from a rich literature of the past century.

Sequences of Numbers Meet the Generalized Gegenbauer-Humbert Polynomials

Here we present a connection between a sequence of numbers generated by a linear recurrence relation of order 2 and sequences of the generalized Gegenbauer-Humbert polynomials. Many new and known formulas of the Fibonacci, the Lucas, the Pell, and the Jacobsthal numbers in terms of the generalized Gegenbauer-Humbert polynomial values are given. The applications of the relationship to the construction of identities of number and polynomial value sequences defined by linear recurrence relations are also discussed.

Sequences of Non-Gegenbauer-Humbert Polynomials Meet the Generalized Gegenbauer-Humbert Polynomials

Here, we present a connection between a sequence of polynomials generated by a linear recurrence relation of order 2 and sequences of the generalized Gegenbauer-Humbert polynomials. Many new and known transfer formulas between non-Gegenbauer-Humbert polynomials and generalized Gegenbauer-Humbert polynomials are given. The applications of the relationship to the construction of identities of polynomial sequences defined by linear recurrence relations are also discussed.

Convolution Identities for Stirling Numbers of the First Kind

We derive several new convolution identities for the Stirling numbers of the first kind. As a consequence we obtain a new linear recurrence relation which generalizes known relations.