Periodicity properties of kth order linear recurrences whose characteristic polynomial splits completely over a finite field, II

1996 ◽  
pp. 333-348 ◽  
Author(s):  
Lawrence Somer
Keyword(s):  
Finite Field ◽  
Characteristic Polynomial ◽  
Linear Recurrences ◽  
Order Linear

scholarly journals Hyers-Ulam Stability of a System of First Order Linear Recurrences with Constant Coefficients

2015 ◽  
Vol 2015 ◽  
pp. 1-5 ◽  
Author(s):  
Bing Xu ◽  
Janusz Brzdęk
Keyword(s):  
Ulam Stability ◽  
Linear Difference Equations ◽  
Positive Real ◽  
Fixed Sequence ◽  
Linear Recurrences ◽  
Order Linear ◽  
First Order ◽  
Constant Coefficients ◽  
Complex Coefficients ◽  
Positive Real Constant

We study the Hyers-Ulam stability in a Banach spaceXof the system of first order linear difference equations of the formxn+1=Axn+dnforn∈N0(nonnegative integers), whereAis a givenr×rmatrix with real or complex coefficients, respectively, and(dn)n∈N0is a fixed sequence inXr. That is, we investigate the sequences(yn)n∈N0inXrsuch thatδ∶=supn∈N0yn+1-Ayn-dn<∞(with the maximum norm inXr) and show that, in the case where all the eigenvalues ofAare not of modulus 1, there is a positive real constantc(dependent only onA) such that, for each such a sequence(yn)n∈N0, there is a solution(xn)n∈N0of the system withsupn∈N0yn-xn≤cδ.

scholarly journals Graph polynomials and symmetries

2019 ◽  
Vol 18 (09) ◽  
pp. 1950172 ◽  
Author(s):  
Nafaa Chbili
Keyword(s):  
Automorphism Group ◽  
Finite Field ◽  
Characteristic Polynomial ◽  
Prime Order ◽  
Tutte Polynomial ◽  
Quotient Graph ◽  
Graph Polynomials ◽  
Tutte Polynomials

In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of this paper is to extend this study to other graph polynomials. In particular, we prove that if a graph [Formula: see text] has a symmetry of prime order [Formula: see text], then its characteristic polynomial, with coefficients in the finite field [Formula: see text], is determined by the characteristic polynomial of its quotient graph [Formula: see text]. Similar results are also proved for some generalization of the Tutte polynomial.

scholarly journals Quadratic form Approach for the Number of Zeros of Homogeneous Linear Recurring Sequences over Finite Fields

2017 ◽  
Vol 9 (3) ◽  
pp. 8
Author(s):  
Yasanthi Kottegoda
Keyword(s):  
Quadratic Form ◽  
Finite Field ◽  
Characteristic Polynomial ◽  
Finite Fields ◽  
Quadratic Forms ◽  
Linear Recurring Sequences ◽  
Exact Number ◽  
Number Of Zeros ◽  
Homogeneous Linear ◽  
Form Approach

We consider homogeneous linear recurring sequences over a finite field $\mathbb{F}_{q}$, based on an irreducible characteristic polynomial of degree $n$ and order $m$. Let $t=(q^{n}-1)/ m$. We use quadratic forms over finite fields to give the exact number of occurrences of zeros of the sequence within its least period when $t$ has q-adic weight 2. Consequently we prove that the cardinality of the set of zeros for sequences from this category is equal to two.

LU based algorithms for characteristic polynomial over a finite field

2003 ◽  
Vol 37 (3) ◽  
pp. 83-84
Author(s):  
Clément Pernet ◽  
Zhendong Wan
Keyword(s):  
Finite Field ◽  
Characteristic Polynomial

scholarly journals Testing modules for irreducibility

1994 ◽  
Vol 57 (1) ◽  
pp. 1-16 ◽  
Author(s):  
Derek F. Holt ◽  
Sarah Rees
Keyword(s):  
Finite Field ◽  
Characteristic Polynomial ◽  
Practical Method ◽  
Finite Dimensional ◽  
Performance Analyses ◽  
Dimensional Module

AbstractA practical method is described for deciding whether or not a finite-dimensional module for a group over a finite field is reducible or not. In the reducible case, an explicit submodule is found. The method is a generalistaion of the Parker-Norton ‘Meataxe’ algorithm, but it does not depend for its efficiency on the field being small. The principal tools involved are the calculation of the nullspace and the characteristic polynomial of a matrix over a finite field, and the factorisation of the latter. Related algorithms to determine absolute irreducibility and module isomorphism for irreducibles are also described. Details of an implementation in the GAP system, together with some performance analyses are included.

scholarly journals Kneading determinants of infinite order linear recurrences

2015 ◽  
Vol 475 ◽  
pp. 306-325
Author(s):  
João F. Alves ◽  
António Bravo ◽  
Henrique M. Oliveira
Keyword(s):  
Infinite Order ◽  
Linear Recurrences ◽  
Order Linear
Sign in / Sign up

Export Citation Format

Share Document