Matrix divisibility sequences

  title={Matrix divisibility sequences},
  author={G. Cornelissen and J. Reynolds},
  journal={arXiv: Number Theory},
We show that many existing divisibility sequences can be seen as sequences of determinants of matrix divisibility sequences, which arise naturally as Jacobian matrices associated to groups of maps on affine spaces. 
New examples of determinant divisibility sequences
In this paper we consider divisibility sequences obtained from square matrices. We work with of matrix divisibility sequences associated to a semigroup and arising from endomorphisms of an affineExpand
New Examples of Divisibility Sequences
We show that if a full group of invertible matrices is embedded in an a ne space, then the determinant divisibility sequence associated with the set of endomorphisms given by taking nth powers ofExpand
Linear divisibility sequences and Salem numbers
We study linear divisibility sequences of order 4, providing a characterization by means of their characteristic polynomials and finding their factorization as a product of linear divisibilityExpand
Periodicity of the Greatest Common Divisors within Generalized Divisibility Sequences
This paper addresses divisibility properties of some families of sequences arising from partial sums of a strong divisibility sequence. In particular, we demonstrate periodicity of greatest commonExpand
Primitive divisors of sequences associated to elliptic curves over function fields
We study the existence of a Zsigmondy bound for a sequence of divisors associated to points on an elliptic curve over a function field. More precisely, let k be an algebraically closed field, let CExpand


Prime powers in elliptic divisibility sequences
Certain elliptic divisibility sequences are shown to contain only finitely many prime power terms. In some cases the methods prove that only finitely many terms are divisible by a bounded number ofExpand
Abstract In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that LucasExpand
Elliptic divisibility sequences over certain curves
Abstract Let n ⩾ 5 be an integer. We provide an effective method for finding all elliptic curves in short Weierstrass form E / Q with j ( E ) ∈ { 0 , 1728 } and all P ∈ E ( Q ) such that the nth termExpand
Divisibility sequences for elliptic curves with complex multiplication
Elliptic divisibility sequences arise as sequences of denominators of the integer multiples of a rational point on an elliptic curve. Silverman proved that almost every term of such a sequence has aExpand
Elliptic Divisibility Sequences, Squares and Cubes
Elliptic divisibility sequences (EDSs) are generalizations of a class of integer divisibility sequences called Lucas sequences. There has been much interest in cases where the terms of LucasExpand
Generalized Greatest Common Divisors, Divisibility Sequences, and Vojta’s Conjecture for Blowups
Abstract.We apply Vojta’s conjecture to blowups and deduce a number of deep statements regarding (generalized) greatest common divisors on varieties, in particular on projective space and on abelianExpand
Descent on elliptic curves and Hilbert’s tenth problem
. Descent via an isogeny on an elliptic curve is used to construct two subrings of the field of rational numbers, which are complementary in a strong sense, and for which Hilbert's Tenth Problem isExpand
Bilinear recurrences and addition formulae for hyperelliptic sigma functions
Abstract The Somos 4 sequences are a family of sequences satisfying a fourth order bilinear recurrence relation. In recent work, one of us has proved that the general term in such sequences can beExpand
Wieferich's criterion and the abc-conjecture
Abstract We show that the abc-conjecture of Masser and Oesterle implies that there are infinitely many primes for which 2p−1 n= 1 (mod p2). More precisely, we show that there are at least O(log X)Expand
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
The problem of EDS Association is related to the Tate pairing and the MOV, Frey-Ruck and Shipsey EDS attacks on the elliptic curve discrete logarithm problem in the cases where these apply. Expand