• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • Tagged with
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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

Dinâmica, combinatória e ergodicidade / Dynamics, combinatorics and ergodicity

Moretti Junior, Nilton Cesar 30 August 2017 (has links)
Submitted by Nilton Cesar Moretti Junior null (niiilton@hotmail.com) on 2018-07-31T04:58:47Z No. of bitstreams: 1 Dissertação-Final.pdf: 1149444 bytes, checksum: 6c44dc0b9f2462ee08c23da4a240fa0a (MD5) / Approved for entry into archive by Elza Mitiko Sato null (elzasato@ibilce.unesp.br) on 2018-07-31T18:13:18Z (GMT) No. of bitstreams: 1 morettijunior_nc_me_sjrp.pdf: 1461434 bytes, checksum: 7a6418b1192346448fc927ec6c6650dc (MD5) / Made available in DSpace on 2018-07-31T18:13:18Z (GMT). No. of bitstreams: 1 morettijunior_nc_me_sjrp.pdf: 1461434 bytes, checksum: 7a6418b1192346448fc927ec6c6650dc (MD5) Previous issue date: 2017-08-30 / Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Neste trabalho estudamos vários resultados relacionados com sistemas dinâmicos, teoria dos números e combinatória. Em particular, provamos os teoremas de Van Der Waerden, Szemeredi, Koksma e Weyl. / In this work we study several results connected with dynamical systems, number thoery and combinatorics. In particular, we prove Van Der Waerden, Szemer edi, Koksma and Weyl’s theorems.
2

Polynomial root separation and applications / Séparation des racines des polynômes et applications

Pejkovic, Tomislav 20 January 2012 (has links)
Nous étudions les bornes sur les distances des racines des polynômes entiers et les applications de ces résultats. La séparation des racines complexes pour les polynômes réductibles normalisés de quatrième degré à coefficients entiers est examinée plus à fond. Différents lemmes sur les racines des polynômes en nombres p-adiques sont prouvés. Sont fournies les familles explicites de polynômes de degré général, ainsi que les familles dans certaines classes de polynômes quadratiques et cubiques avec une très bon separation des racins dans le cadre p-adique. Le reste de la thèse est dédié aux résultats liés aux versions p-adiques des fonctions de Mahler et de Koksma wn et w*n , ainsi qu'aux classifications correspondantes des nombres transcendants dans Cp. Le résultat principal est une construction des nombres pour lesquelles les deux fonctions wn et w*n sont différentes pour tous les n et puis l'intervalle de valeurs possibles pour wn-w*n est élargi. Les inégalités reliant les valeurs des fonctions de Koksma en nombres algébriquement dépendants sont prouvées. / We study bounds on the distances of roots of integer polynomials and applications of such results. The separation of complex roots for reducible monic integer polynomials of fourth degree is thoroughly explained. Lemmas on roots of polynomials in the p-adic setting are proved. Explicit families of polynomials of general degree as well as families in some classes of quadratic and cubic polynomials with very good separation of roots in the same setting are exhibited. The second part of the thesis is concerned with results on p-adic versions of Mahler's and Koksma's functions wn and w*n and the related classifications of transcendental numbers in Cp. The main result is a construction of numbers such that the two functions wn and w*n differ on them for every n and later on expanding the interval of possible values for wn-w*n. The inequalities linking values of Koksma's functions for algebraically dependent numbers are proved.
3

Discrepancy of sequences and error estimates for the quasi-Monte Carlo method / Diskrepansen hos talföljder och feluppskattningar för kvasi-Monte Carlo metoden

Vesterinen, Niklas January 2020 (has links)
We present the notions of uniform distribution and discrepancy of sequences contained in the unit interval, as well as an important application of discrepancy in numerical integration by way of the quasi-Monte Carlo method. Some fundamental (and other interesting) results with regards to these notions are presented, along with some detalied and instructive examples and comparisons (some of which not often provided by the literature). We go on to analytical and numerical investigations of the asymptotic behaviour of the discrepancy (in particular for the van der Corput-sequence), and for the general error estimates of the quasi-Monte Carlo method. Using the discoveries from these investigations, we give a conditional proof of the van der Corput theorem. Furthermore, we illustrate that by using low discrepancy sequences (such as the vdC-sequence), a rather fast convergence rate of the quasi-Monte Carlo method may still be achieved, even for situations in which the famous theoretical result, the Koksma inequality, hasbeen rendered unusable. / Vi presenterar begreppen likformig distribution och diskrepans hos talföljder på enhetsintervallet, såväl som en viktig tillämpning av diskrepans inom numerisk integration via kvasi-Monte Carlo metoden. Några fundamentala (och andra intressanta) resultat presenteras med avseende på dessa begrepp, tillsammans med några detaljerade och instruktiva exempel och jämförelser (varav några sällan presenterade i litteraturen). Vi går vidare med analytiska och numeriska undersökningar av det asymptotiska beteendet hos diskrepansen (särskilt för van der Corput-följden), såväl som för den allmänna feluppskattningen hos kvasi-Monte Carlo metoden. Utifrån upptäckterna från dessa undersökningar ger vi ett villkorligt bevis av van der Corput's sats, samt illustrerar att man genom att använda lågdiskrepanstalföljder (som van der Corput-följden) fortfarande kan uppnå tämligen snabb konvergenshastighet för kvasi-Monte Carlo metoden. Detta även för situationer där de kända teoretiska resultatet, Koksma's olikhet, är oandvändbart.

Page generated in 0.017 seconds