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 23 for “"Sequences (Mathematics)"”.

  1. On the theory of integer sequences

    We explore certain sequences of integers which appear in the number theory. We start by exploring properties of Beatty sequences. We concentrate on looking at the sum of primes from a Beatty sequence and properties of certain multiplicative functions on a Beatty sequence. We move on to the Robin …

    missouri Repository record for On the theory of integer sequences (opens in a new tab)

  2. Reliability diagnostic strategies for series systems under imperfect testing

    An expected cost model was developed for failure detection in series systems under imperfect testing. Type I and type II error probabilities are included and single-pass sample paths are required. The model accounts for the expected costs of testing components, false positive termination, and …

    vt Repository record for Reliability diagnostic strategies for series systems under imperfect testing (opens in a new tab)

  3. A construction of arithmetic progression-free sequences

    We describe a particular greedy construction of an arithmetic progression-free sequence from a finite composition. We also give an analysis on the properties of the resulting sequence.

    ttu Repository record for A construction of arithmetic progression-free sequences (opens in a new tab)

  4. Congruence properties of linear recurring sequences

    … with the behaviour modulo n of linear recurring sequences of integers with characteristic polynomial ƒ ( x ) where n is a positive integer and ƒ ( x ) is a monic polynomial of degree k. Let α [subscript 1], α [subscript 2],...,α [subscript k] be the zeros of ƒ ( x ) and D ( ƒ ) ≠ 0 its …

    adelaide Repository record for Congruence properties of linear recurring sequences (opens in a new tab)

  5. A generalized linear complexity

    … cryptographic applications require pseudo-random sequences which are "unpredictable," in the sense that recovering the sequence from a short captured segment is computationally infeasible. Such sequences are said to be cryptographically strong. Due to the Berlekamp-Massey algorithm, a …

    ttu Repository record for A generalized linear complexity (opens in a new tab)

  6. A fast multiple longest common subsequence (MLCS) algorithm

    … on a benchmark set of both random and biological sequences reveals a near-linear speed-up with respect to the sequential algorithm.

    missouri Repository record for A fast multiple longest common subsequence (MLCS) algorithm (opens in a new tab)

  7. Applications of binary sequence of order k

    The cumulative distribution of the finite sum of the binary sequence of order k is studied and some of its applications discussed. Certain properties of this sequence are studied and uniformly superior bounds for the cumulative distribution under minimal information on the "success" probabilities …

    njit Repository record for Applications of binary sequence of order k (opens in a new tab)

  8. A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence

    We investigate a class of minimal sequences on a finite alphabet Ak = {1,2,...,k} having (k - 1)n + 1 distinct subwords of length n. These sequences, originally defined by P. Arnoux and G. Rauzy, are a natural generalization of binary Sturmian sequences. We describe two simple combinatorial …

    unt Repository record for A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence (opens in a new tab)

  9. Modular forms and two new integer sequences at level 7 : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Mathematics at Massey University, Albany, New Zealand

    Integer sequences resulting from recurrence relations with polynomial coefficients are rare. Two new integer sequences have been discovered and are the main result in this thesis. They consist of a three-term quadratic recurrence (𝑛+1)²𝑐₇(𝑛+1) = (26𝑛² + 13𝑛 + 2)𝑐₇(𝑛) + 3(2𝑛 - 2)𝑐₇(𝑛-1) with initial …

    massey Repository record for Modular forms and two new integer sequences at level 7 : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Mathematics at Massey University, Albany, New Zealand (opens in a new tab)

  10. Weak and Norm Convergence of Sequences in Banach Spaces

    We study weak convergence of sequences in Banach spaces. In particular, we compare the notions of weak and norm convergence. Although these modes of convergence usually differ, we show that in ℓ¹ they coincide. We then show a theorem of Rosenthal's which states that if {𝓍ₙ} is a bounded sequence in …

    unt Repository record for Weak and Norm Convergence of Sequences in Banach Spaces (opens in a new tab)

  11. The Fibonacci sequence and Hosoya's triangle

    The purpose of this thesis is to study the Fibonacci sequence in a context many are unfamiliar with. A triangular array of numbers, similar looking to Pascal's triangle, was constructed a few decades ago and is called Hosoya's triangle. Each element within the triangle is created using Fibonacci …

    csusb Repository record for The Fibonacci sequence and Hosoya's triangle (opens in a new tab)

  12. The Fibonacci sequence and Hosoya's triangle

    The purpose of this thesis is to study the Fibonacci sequence in a context many are unfamiliar with. A triangular array of numbers, similar looking to Pascal's triangle, was constructed a few decades ago and is called Hosoya's triangle. Each element within the triangle is created using Fibonacci …

    csusb-retro Repository record for The Fibonacci sequence and Hosoya's triangle (opens in a new tab)

Page 1 of 2