A note about invariant polynomial transformations of integer sequences

MaRDI QIDQ5404245zbMATH OpenFDO

Authors Leonid Bedratyuk

Publication date 24 March 2014

Full work available at URL https://arxiv.org/abs/1202.2507, http://www.emis.de/journals/JIS/VOL15/Bedratyuk/bedratyuk4.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Hankel determinantinvariantpolynomial transformation

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Matrices, determinants in number theory (11C20) Actions of groups on commutative rings; invariant theory (13A50)

Abstract: We present an algorithm to find invariant poynomial transformations of integer sequences, using the classical invariant theory approach.

Recommendations

• A note on invariant polynomials
• Invariant sequences under binomial transformation
• A note on polynomial sequences modulo integers
• scientific article; zbMATH DE number 3918724
• Integer-valued polynomials on invariant sets under rotation
• On the existence and number of invariant polynomials
• Polynomial transformations of linear recurring sequences over ℤp2
• Invariant polynomials and minimal zero sequences

Cited in

(3)

• Invariant sequences under binomial transformation
• Polynomial transformations of linear recurring sequences over ℤp2
• A note on a transform to self-inverse sequences

This page was built for publication: A note about invariant polynomial transformations of integer sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404245)