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 1395 for “"Sums"”.

  1. Exponential sums, character sums, sieve methods and distribution of prime numbers /

    … thesis is focus on the methods of exponential sums and sieve methods applying to distribution of primes numbers in several forms, such as Piatetski-Shapiro primes, Beatty sequences, almost primes and primes in arithmetic progression. In the end, we also think about the classical problem in …

    missouri Repository record for Exponential sums, character sums, sieve methods and distribution of prime numbers / (opens in a new tab)

  2. LASSO: Listing All Subset Sums Obediently for Evaluating Unbounded Subset Sums

    In this study we present a novel algorithm, LASSO, for solving the unbounded and bounded subset sum problem. The LASSO algorithm was designed to solve the unbounded SSP quickly and to return all subsets summing to a target sum. As speed was the highest priority, we benchmarked the run time …

    montana Repository record for LASSO: Listing All Subset Sums Obediently for Evaluating Unbounded Subset Sums (opens in a new tab)

  3. LASSO: Listing All Subset Sums Obediently for Evaluating Unbounded Subset Sums

    In this study we present a novel algorithm, LASSO, for solving the unbounded and bounded subset sum problem. The LASSO algorithm was designed to solve the unbounded SSP quickly and to return all subsets summing to a target sum. As speed was the highest priority, we benchmarked the run time …

    montana-tech Repository record for LASSO: Listing All Subset Sums Obediently for Evaluating Unbounded Subset Sums (opens in a new tab)

  4. Effective estimates for sums of Kloosterman sums, modular forms, and applications

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for Effective estimates for sums of Kloosterman sums, modular forms, and applications (opens in a new tab)

  5. Direct Sums of Rings

    This paper consists of a study of the direct sum U of two rings S and T. Such a direct sum is defined as the set of all ordered pairs (s1, t1), where s1 is an arbitrary element in S and t1 is an arbitrary element in T.

    unt Repository record for Direct Sums of Rings (opens in a new tab)

  6. Quadratic Form Gauss Sums

    … G(Q_r;S;p^n) as a product of quadratic Gauss sums.

    carleton Repository record for Quadratic Form Gauss Sums (opens in a new tab)

  7. Analogues of Dedekind Sums

    … develops the arithmetic theory of the analogous sums introduced by Berndt. Many properties, both elementary and analytic, are derived. In this thesis we parallel one of the paths laid out by H. Rademacher in his study of $s(d, c).$ New methods are required in the study of $S(d, c).$ As an …

    uiuc Repository record for Analogues of Dedekind Sums (opens in a new tab)

  8. Character Sums and Their Applications

    <p>Character sums play significant roles in analytic number theory. In particular, bounding additive and multiplicative characters of the integers modulo $q$ as well as of finite fields are classical questions that have led to many fruitful and far-reaching applications. </p><p>In this thesis, we …

    duke Repository record for Character Sums and Their Applications (opens in a new tab)

  9. Sign Ambiguities of Gaussian Sums

    … and Davenport-Hasse} relations, between Gaussian sums, were known. In 1964, H. Hasse conjectured that the norm and Davenport-Hasse relations are the only multiplicative relations connecting the Gaussian sums over $mathbb F_p$. However, in 1966, K. Yamamoto provided a simple counterexample …

    lsu-thes Repository record for Sign Ambiguities of Gaussian Sums (opens in a new tab)

  10. Evaluation of the Convolution Sums

    … integers $n$ we evaluate the convolution sums $\displaystyle\overset{}{\underset{ \begin{array}{c} {(l,m) \in \mathbb{N}^2} \\ {\alpha l+\beta m=n} \end{array} } {\sum}}\sigma(l)\sigma(m)$, where $(\alpha,\beta) = (1,14), (2,7), (1,26), (2,13), (1,28)$, $(4,7), (1,30), (2,15), (3,10), …

    carleton Repository record for Evaluation of the Convolution Sums (opens in a new tab)

  11. Exponential sums and additive combinatorics

    … lead us to new bounds of certain exponential sums. We also use known bounds on exponential and character sums to give new results in additive combinatorics. Specifically we will see how bounds on some quantities from additive combinatorics appear naturally when trying to bound multilinear …

    unsw Repository record for Exponential sums and additive combinatorics (opens in a new tab)

  12. Unique Subdirect Sums of Rings

    Made available in DSpace on 2014-12-05T21:50:18Z (GMT). No. of bitstreams: 1 6101637.pdf: 2614030 bytes, checksum: c9ba47c0ce33d6adc445b6f4f91df9a3 (MD5) Previous issue date: 1961

    uiuc Repository record for Unique Subdirect Sums of Rings (opens in a new tab)

  13. Closure properties of randomly stopped sums /

    … the distribution functions of randomly stopped sums, randomly stopped maximums, and randomly stopped maximums of sums belong to some heavy-tailed classes. The random variables are real-valued and not necessarily identically distributed, whereas the counting random variable is integer valued, …

    vilnius Repository record for Closure properties of randomly stopped sums / (opens in a new tab)

  14. Eigenvalues for Sums of Hermitian Matrices

    … C=A+B. We mainly focus on inequalities bounding sums of r eigenvalues for C by sums of r eigenvalues for A with r eigenvalues for B, for some r less than n. We begin by using linear algebra to establish some classical results, including a result by R.C. Thompson that allows us to reformulate the …

    ecu Repository record for Eigenvalues for Sums of Hermitian Matrices (opens in a new tab)

Page 1 of 70