• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 317
  • 222
  • 69
  • 44
  • 31
  • 14
  • 12
  • 7
  • 6
  • 6
  • 4
  • 3
  • 3
  • 3
  • 2
  • Tagged with
  • 855
  • 136
  • 124
  • 78
  • 66
  • 61
  • 60
  • 57
  • 49
  • 44
  • 43
  • 41
  • 40
  • 39
  • 38
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Über die schwedischen Sequenzen, eine musikgeschichtliche Studie.

Moberg, Carl Allan, January 1927 (has links)
Inaug.-diss.--Upsala. / "Quellen und literatur": p. [xi]-xix. Also issued online.
2

Interpolating and dominating sequences

Black, Ethan 13 May 2022 (has links)
In this thesis we will be working with dominating and interpolating sequences. We worked with a geometric approach and used pseudohyperbolic translated to the Euclidean disc in order to show that a sequence within a certain radius of a dominating sequence is dominating as well.
3

A detailed look into two problems on lacunary sequences

Volynin, Ilya. January 2008 (has links)
Thesis (M.S.)--Ohio State University, 2008. / Title from first page of PDF file. Includes bibliographical references (p. 8).
4

Mini-course on limits and sequences

Asante, Peter Kwadwo January 1900 (has links)
Master of Science / Department of Mathematics / Natalia Rojkovskaia / The topic of limits and sequences run through the math syllabi from high school to graduate school. However rigorous proofs of this concept is not seen up until a students second year in college or even later. This text is aimed at presenting proofs of limits of sequences at a level accessible to high school and undergraduate students who are interested in learning such proofs. The ''Epsilon-N" definition of the limit with proofs using this definition is presented in the text. We also look at properties of limits of sequences and their proofs as well as sequences without limits (that is sequences that diverge). We include some graphical representations of some sequences which can help one to determine whether a sequence will converge or diverge. Finally, the text contains a good number of exercises for the reader, some solved and others with hints to direct the reader in solving them.
5

A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence

Risley, Rebecca N. 08 1900 (has links)
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 algorithms for constructing characteristic Arnoux-Rauzy sequences (one of which is new even in the Sturmian case). Arnoux-Rauzy sequences arising from fixed points of primitive morphisms are characterized by an underlying periodic structure. We show that every Arnoux-Rauzy sequence contains arbitrarily large subwords of the form V^2+ε and, in the Sturmian case, arbitrarily large subwords of the form V^3+ε. Finally, we prove that an irrational number whose base b-digit expansion is an Arnoux-Rauzy sequence is transcendental.
6

Minimizing and stationary sequences.

January 1999 (has links)
by Wong Oi Ping. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 77-79). / Abstracts in English and Chinese. / Chapter 1 --- LP-minimizing and Stationary Sequences --- p.8 / Chapter 1.1 --- Residual function --- p.8 / Chapter 1.2 --- Minimizing sequences --- p.14 / Chapter 1.3 --- Stationary sequences --- p.17 / Chapter 1.4 --- On the equivalence of minimizing and stationary se- quence --- p.21 / Chapter 1.5 --- Complementarity conditions --- p.25 / Chapter 1.6 --- Subdifferential-based stationary sequence --- p.29 / Chapter 1.7 --- Convergence of an Iterative Algorithm --- p.32 / Chapter 2 --- Minimizing And Stationary Sequences In Nonsmooth Optimization --- p.38 / Chapter 2.1 --- Subdifferential --- p.38 / Chapter 2.2 --- Stationary and minimizing sequences --- p.40 / Chapter 2.3 --- C-convex and BC-convex function --- p.43 / Chapter 2.4 --- Minimizing sequences in terms of sublevel sets --- p.44 / Chapter 2.5 --- Critical function --- p.48 / Chapter 3 --- Optimization Conditions --- p.52 / Chapter 3.1 --- Introduction --- p.52 / Chapter 3.2 --- Second-order necessary and sufficient conditions with- out constraint --- p.55 / Chapter 3.3 --- The Lagrange and G-functions in constrained problems --- p.63 / Chapter 3.4 --- Second-order necessary conditions for constrained prob- lems --- p.73 / Chapter 3.5 --- Sufficient conditions for constrained problems --- p.74 / Bibliography
7

Higher-order Markov chain models for categorical data sequences

Fung, Siu-leung., 馮紹樑. January 2003 (has links)
published_or_final_version / abstract / toc / Mathematics / Master / Master of Philosophy
8

High-dimensional Markov chain models for categorical data sequences with applications

Fung, Siu-leung., 馮紹樑. January 2006 (has links)
published_or_final_version / abstract / Mathematics / Doctoral / Doctor of Philosophy
9

Chaotic synchronisation in wideband communication systems

Williams, Christopher January 1999 (has links)
No description available.
10

The transposition of sequences bounded by direct repeats

Jacobs, L. January 1988 (has links)
No description available.

Page generated in 0.0699 seconds