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"”.
-
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 …
-
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.
-
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 …
-
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 …
-
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, …
-
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.
-
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.
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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.
-
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 …
-
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 …
-
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 …
-
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 …
-
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 ℝ<sup>m</sup>, and a real m-by-m evolution matrix A. We distinguish two varieties of …
-
ΠΡΩΤΟΙ ΑΡΙΘΜΟΙ ΚΑΙ ΚΥΚΛΟΤΟΜΙΑ-ΠΡΩΤΟΙ ΑΡΙΘΜΟΙ ΤΗΣ ΜΟΡΦΗΣ Χ + (Χ+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).
Page 1 of 2