linear recurrent sequence
Recently Published Documents


TOTAL DOCUMENTS

7
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

2019 ◽  
Vol 29 (2) ◽  
pp. 103-119
Author(s):  
Aleksandr A. Nechaev ◽  
Vadim N. Tsypyschev

Abstract The possibility to generalize the notion of a linear recurrent sequence (LRS) over a commutative ring to the case of a LRS over a non-commutative ring is discussed. In this context, an arbitrary bimodule AMB over left- and right-Artinian rings A and B, respectively, is associated with the equivalent bimodule of translations CMZ, where C is the multiplicative ring of the bimodule AMB and Z is its center, and the relation between the quasi-Frobenius conditions for the bimodules AMB and CMZ is studied. It is demonstrated that, in the general case, the fact that AMB is a quasi-Frobenius bimodule does not imply the validity of the quasi-Frobenius condition for the bimodule CMZ. However, under some additional assumptions it can be shown that if CMZ is a quasi-Frobenius bimodule, then the bimodule AMB is quasi-Frobenius as well.


2016 ◽  
Vol 11 (2) ◽  
pp. 125-150
Author(s):  
Christian Ballot

AbstractGiven an integral, increasing, linear-recurrent sequence A with initial term 1, the greedy algorithm may be used on the terms of A to represent all positive integers. For large classes of recurrences, the average digit sum is known to equal cA log n+O(1), where cA is a positive constant that depends on A. This asymptotic result is re-proved with an elementary approach for a class of special recurrences larger than, or distinct from, that of former papers. The focus is on the constants cA for which, among other items, explicit formulas are provided and minimal values are found, or conjectured, for all special recurrences up to a certain order.


2015 ◽  
Vol 13 (1) ◽  
Author(s):  
Dovile Karalienė ◽  
Zenonas Navickas ◽  
Raimondas Čiegis ◽  
Minvydas Ragulskis

AbstractAn interpolation scheme on an equispaced grid based on the concept of the minimal order of the linear recurrent sequence is proposed in this paper. This interpolation scheme is exact when the number of nodes corresponds to the order of the linear recurrent function. It is shown that it is still possible to construct a nearest mimicking algebraic interpolant if the order of the linear recurrent function does not exist. The proposed interpolation technique can be considered as the extension of the Prony method and can be useful for describing noisy and defected signals.


Sign in / Sign up

Export Citation Format

Share Document