Computing the algebraic relations of \(C\)-finite sequences and multisequences (Q2517807): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 5 users not shown)
Property / reviewed by
 
Property / reviewed by: Zhi-Wei Sun / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Zhi-Wei Sun / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Dependencies / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RComp / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: gfun / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2008.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153757816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2902935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Summation in Finite Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4753589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RComp: A \textit{Mathematica} package for computing with recursive sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: GFUN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4834167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner bases of lattices, corner polyhedra, and integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A holonomic systems approach to special functions identities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:36, 28 June 2024

scientific article
Language Label Description Also known as
English
Computing the algebraic relations of \(C\)-finite sequences and multisequences
scientific article

    Statements

    Computing the algebraic relations of \(C\)-finite sequences and multisequences (English)
    0 references
    0 references
    0 references
    9 January 2009
    0 references
    A \(C\)-finite sequence over a field \(K\) is a function \(a:\mathbb{Z}\to K\) satisfying a linear homogeneous recurrence \(c_0a(n)+\cdots+c_sa(n+s)=0\) with \(c_0,\ldots,c_s\in K\) and \(c_0,c_s\not=0\). An algebraic relation over \(K\) among \(r\) \(C\)-finite sequences \(a_1,\ldots,a_r\) over \(K\) is a polynomial \(P(x_1,\ldots,x_r)\in K[x_1,\ldots,x_r]\) such that \(P(a_1(n),\ldots,a_r(n))=0\) for all \(n\in\mathbb{Z}\). All algebraic relations among \(a_1,\ldots,a_r\) form an ideal \(I=I(a_1,\ldots,a_r;K)\) of the ring \(K[x_1,\ldots,x_r]\). The authors present an algorithm for computing generators of \(I\) when \(K\) is the rational field \(\mathbb{Q}\). Combining this with the Gröbner basis method, the authors can determine whether a given sequence can be represented in terms of other given sequences.
    0 references
    algorithm
    0 references
    algebraic relation
    0 references
    recurrence sequence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers