Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 30 for “"linear recurrence"”.

  1. Multiplicities of Linear Recurrence Sequences

    … major results concerning the multiplicities of linear recurrence sequences. We first investigate binary recurrence sequences where we exhibit a result due to Beukers and a result due to Brindza, Pintér and Schmidt. We then investigate ternary recurrences and exhibit a result due to …

    waterloo Repository record for Multiplicities of Linear Recurrence Sequences (opens in a new tab)

  2. Linear recurrence sequences of composite numbers /

    The main objects studied in this thesis are linear recurrence sequences of composite numbers. We have studied the second order (binary) linear recurrence, tribonacci – like and higher order sequences. Many examples have been given.

    vilnius Repository record for Linear recurrence sequences of composite numbers / (opens in a new tab)

  3. PARALLEL SOLUTION TO LINEAR RECURRENCE (ARCHITECTURE)

    … parallel solution to the problem of first order linear recurrence. Given a system of n first order equations, the proposed parallel algorithm solves it in time O(n/p + logp) on a multiprocessor system with p processors. The multiprocessor system may be operating in synchronous or asynchronous …

    rice Repository record for PARALLEL SOLUTION TO LINEAR RECURRENCE (ARCHITECTURE) (opens in a new tab)

  4. Linear Recurrence Sequences in Diophantine Analysis

    … it is possible to associate a well behaved recurrence sequence to the solution set of a Diophantine equation, which can be useful in generating explicit results. It is known that the solution set to any norm form equation is naturally associated to a family of linear recurrence sequences. As …

    oregon Repository record for Linear Recurrence Sequences in Diophantine Analysis (opens in a new tab)

  5. On termination and divergence of linear programs

    … some of the central problems in the study of linear programs, and to provide an up-to-date survey of the latest results in this field.</p> <p>In particular, we review some of the classical decision problems in the theory of linear recurrence sequences. Namely, we revisit the Skolem Problem, …

    oxford Repository record for On termination and divergence of linear programs (opens in a new tab)

  6. Tiesinės rekurenčiosios sekos sudarytos iš sudėtinių skaičių /

    The main objects studied in this thesis are linear recurrence sequences of composite numbers. We have studied the second order (binary) linear recurrence, tribonacci – like and higher order sequences. Many examples have been given.

    vilnius Repository record for Tiesinės rekurenčiosios sekos sudarytos iš sudėtinių skaičių / (opens in a new tab)

  7. The signs in an elliptic net

    … net is a map form A to R, which satisfy a non linear recurrence relation. In this thesis we give a formula to compute the sign of any term of an elliptic net without actually computing the value of that term.

    lethbridge Repository record for The signs in an elliptic net (opens in a new tab)

  8. Sudėtiniai skaičiai sveikųjų skaičių sekose /

    … integer parts of powers of a fixed number and a linear recurrence sequence consisting of integer numbers. The thesis consists of the introduction, 3 sections, conclusions and bibliography. In Section 1 we consider composite numbers in the sequences of integer parts of powers of rational numbers …

    vilnius Repository record for Sudėtiniai skaičiai sveikųjų skaičių sekose / (opens in a new tab)

  9. Composite numbers in the sequences of integers /

    … integer parts of powers of a fixed number and a linear recurrence sequence consisting of integer numbers. The thesis consists of the introduction, 3 sections, conclusions and bibliography. In Section 1 we consider composite numbers in the sequences of integer parts of powers of rational numbers …

    vilnius Repository record for Composite numbers in the sequences of integers / (opens in a new tab)

  10. ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS

    … the diagram, the values satisfy a second-order linear recurrence. Although these functions arise naturally in hyperbolic geometry, 2-bridge links, and Dehn filling constructions, this dissertation studies their algebraic properties. First, we study values of Farey recursive functions at …

    montana Repository record for ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS (opens in a new tab)

  11. ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS

    … the diagram, the values satisfy a second-order linear recurrence. Although these functions arise naturally in hyperbolic geometry, 2-bridge links, and Dehn filling constructions, this dissertation studies their algebraic properties. First, we study values of Farey recursive functions at …

    montana-tech Repository record for ALGEBRAIC PROPERTIES OF FAREY RECURSIVE FUNCTIONS (opens in a new tab)

  12. An investigation into modular forms, Q-series, partitions and related applications

    … sequence of numbers defined by a second order linear recurrence relation of the form <i>U</i>_n_+1 = λ<i>U</i><sub>n-1</sub>. It is shown how the well known modular transformations of the standard theta functions θ2, θ3 and θ4 can be used to produce similar results.</p><p> Many new and …

    soton Download PDF for An investigation into modular forms, Q-series, partitions and related applications (opens in a new tab)

  13. The Divisibility and Modular Properties of Kth-Order Linear Recurrences Over The Ring of Integers of an Algebraic Number Field With Respect to Prime Ideals

    … Let k (GREATERTHEQ) 2 and let (w) be a kth-order linear recurrence over R satisfying the recursion relation (1) w(,n+k) = a(,1)w(,n+k-1) + a(,2)w(,n+k-2) +...+ a(,k)w(,n). Those recurrences (u) satisfying (1) for which u(,0) = u(,1) =...= u(,k-2) = 0 and u(,k) = 1 are called unit sequences. Let f …

    uiuc Repository record for The Divisibility and Modular Properties of Kth-Order Linear Recurrences Over The Ring of Integers of an Algebraic Number Field With Respect to Prime Ideals (opens in a new tab)

  14. Group-invariant CR mappings

    … associated to the lens spaces $L(p,q)$ satisfy a linear recurrence relation of order $2^q-1$ and no smaller. We also give explicit but complicated formulas for the coefficients. Finally, we explore connections with representation theory and invariant theory.

    uiuc Repository record for Group-invariant CR mappings (opens in a new tab)

  15. Greatest common divisors near s-units, applications, and conjectures on arithmetic abelian surfaces

    … common divisors of terms from two general linear recurrence sequences, extending the results of Levin, who considered the case where the linear recurrences are simple. The exceptional set is not as good as finitely many linear relations as in the simple case, but within the control of a …

    msu Repository record for Greatest common divisors near s-units, applications, and conjectures on arithmetic abelian surfaces (opens in a new tab)

  16. Sparse Automatic Sets

    … of zero sets for sequences satisfying a linear recurrence over fields of positive characteristic. A fundamental dichotomy for automatic sets shows that they are either sparse, having counting functions that grow relatively slowly, or they are not sparse, in which case their counting …

    waterloo Repository record for Sparse Automatic Sets (opens in a new tab)

  17. Scalable parallel tridiagonal algorithms with diagonal pivoting and their optimization for many-core architectures

    … which can be solved by high-performance parallel linear recurrence solvers. An Adaptive R-Cyclic Reduction algorithm introduces pivoting into the conventional R-Cyclic Reduction family, which commonly suffers limited quality of solutions due to no applicable pivoting. Our proposed algorithms can …

    uiuc Repository record for Scalable parallel tridiagonal algorithms with diagonal pivoting and their optimization for many-core architectures (opens in a new tab)

  18. Using character varieties: Presentations, invariants, divisibility and determinants

    … then the set of all characters from G into a linear algebraic group is a useful (but not complete) invariant of G . In this thesis, we present some new methods for computing with the variety of SL2C -characters of a finitely presented group. We review the theory of Fricke characters, and …

    unh-thes Repository record for Using character varieties: Presentations, invariants, divisibility and determinants (opens in a new tab)

  19. Reachability problems for linear dynamical systems

    … of principal interest in this thesis is <em>linear dynamical systems</em>: deterministic systems which evolve under a linear operator. They are specified by an <em>initial state set</em> I, contained in &Ropf;<sup>m</sup>, and a real m-by-m evolution matrix A. We distinguish two varieties of …

    oxford Repository record for Reachability problems for linear dynamical systems (opens in a new tab)

  20. ΠΡΩΤΟΙ ΑΡΙΘΜΟΙ ΚΑΙ ΚΥΚΛΟΤΟΜΙΑ-ΠΡΩΤΟΙ ΑΡΙΘΜΟΙ ΤΗΣ ΜΟΡΦΗΣ Χ + (Χ+1)

    … IN TERMS OF SUITABLE (NON-HOMOGENEOUS) LINEAR RECURRENCE SEQUENCES OF ORDER 2 (THEOREM 3.4.15). AS A CONSEQUENCE, ALL PRIMES OF THE SAME FORM IN A GIVEN INTERVAL CAN BE DETERMINED BY A SEIVING PROCEDURE (THEOREM 3.4.16).

    greece Repository record for ΠΡΩΤΟΙ ΑΡΙΘΜΟΙ ΚΑΙ ΚΥΚΛΟΤΟΜΙΑ-ΠΡΩΤΟΙ ΑΡΙΘΜΟΙ ΤΗΣ ΜΟΡΦΗΣ Χ + (Χ+1) (opens in a new tab)

Page 1 of 2