Computing the algebraic relations of C-finite sequences and multisequences

نویسندگان

  • Manuel Kauers
  • Burkhard Zimmermann
چکیده

We present an algorithm for computing generators for the ideal of algebraic relations among sequences which are given by homogeneous linear recurrence equations with constant coefficients. Knowing these generators makes it possible to use Gröbner basis methods for carrying out certain basic operations in the ring of such sequences effectively. In particular, one can answer the question whether a given sequence can be represented in terms of other given sequences. A collection of examples, which were done with an implementation of our algorithm, is included.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error linear complexity measures for multisequences

Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences....

متن کامل

The expected value of the joint linear complexity of periodic multisequences

Complexity measures for sequences of elements of a finite field, such as the linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based (or vectorized) stream ciphers, which require the study of the complexity of multisequences. We extend a wellknown relationship between the linear complexity of an N -periodic sequence ...

متن کامل

COMPUTING THE PRODUCTS OF CONJUGACY CLASSES FOR SPECIFIC FINITE GROUPS

Suppose $G$ is a finite group, $A$ and $B$ are conjugacy classes of $G$ and $eta(AB)$ denotes the number of conjugacy classes contained in $AB$. The set of all $eta(AB)$ such that $A, B$ run over conjugacy classes of $G$ is denoted by $eta(G)$.The aim of this paper is to compute $eta(G)$, $G in { D_{2n}, T_{4n}, U_{6n}, V_{8n}, SD_{8n}}$ or $G$ is a decomposable group of order $2pq$, a group of...

متن کامل

Generalized Joint Linear Complexity of Linear Recurring Multisequences

The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems. Extensive research has been carried out on the joint linear complexity of N-periodic multisequences using tools from Discrete Fourier transform. Each Nperiodic multisequence can be identified with a single N-periodic sequence over an appropriate extension field. It has been demon...

متن کامل

TOPOLOGICAL SIMILARITY OF L-RELATIONS

$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2008