Generalised characteristic polynomials

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Characteristic Polynomials

Introduction. Let F be a field and let V be a finite dimensional vector space over F which is also a module over the ring F[a]. Here a may lie in any extension ring of F. We do not assume, as yet, that V is a faithful module, so that a need not be a linear transformation on V. It is known that by means of a decomposition of V into cyclic F[a]-modules we may obtain a definition of the characteri...

متن کامل

Automatic sequences and generalised polynomials

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially resolve this conjecture, proving that any hypothetical counterexample is periodic away from a very sparse and structured set. In particular, we show that for a po...

متن کامل

Expected Characteristic Polynomials

These notes are not necessarily an accurate representation of what happened in class. The notes written before class say what I think I should say. I sometimes edit the notes after class to make them way what I wish I had said. There may be small mistakes, so I recommend that you check any mathematically precise statement before using it in your own work. These notes were last revised on Decemb...

متن کامل

Characteristic and Ehrhart Polynomials

Let A be a subspace arrangement and let (A; t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(Bn), where Bn is the type B Weyl arrangement, then (A; t) counts a certain set of lattice points. This is the only known combinatorial interpretation of this polynomial in the subspace case. One can use this result to study the par...

متن کامل

Characteristic polynomials and pseudospectra

In this paper, we study the ε-lemniscate of the characteristic polynomial in relation to the pseudospectrum of the associated matrix. It is natural to investigate this question because these two sets can be seen as generalizations of eigenvalues. The question of numerical determination of the ε-lemniscate raises the problem of computing the characteristic polynomial p. We can express the coeffi...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 1990

ISSN: 0747-7171

DOI: 10.1016/s0747-7171(08)80012-0