A note about invariant polynomial transformations of integer sequences

TL;DR

This paper introduces an algorithm based on classical invariant theory to identify polynomial transformations of integer sequences that remain unchanged, providing a new tool for analyzing sequence invariance.

Contribution

It presents a novel algorithm leveraging classical invariant theory to find invariant polynomial transformations of integer sequences.

Findings

Algorithm successfully identifies invariant polynomial transformations.

Provides a systematic approach for sequence invariance analysis.

Enhances understanding of polynomial invariance in integer sequences.

Abstract

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