Log in

Relevant bibliographies by topics / Probabilistic number theory / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Probabilistic number theory.

Dissertations / Theses on the topic 'Probabilistic number theory'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 16 dissertations / theses for your research on the topic 'Probabilistic number theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Harper, Adam James. "Some topics in analytic and probabilistic number theory." Thesis, University of Cambridge, 2012. https://www.repository.cam.ac.uk/handle/1810/265539.

Full text

Abstract:

This dissertation studies four problems in analytic and probabilistic number theory. Two of the problems are about a certain random number theoretic object, namely a random multiplicative function. The other two problems are about smooth numbers (i.e. numbers only having small prime factors), both in their own right and in their application to finding solutions to S-unit equations over the integers. Thus all four problems are concerned, in different ways, with _understanding the multiplicative structure of the integers. More precisely, we will establish that certain sums of a random multiplica

APA, Harvard, Vancouver, ISO, and other styles

2

Hughes, Garry. "Distribution of additive functions in algebraic number fields." Title page, contents and summary only, 1987. http://web4.library.adelaide.edu.au/theses/09SM/09smh893.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zhao, Wenzhong. "Probabilistic databases and their application." Lexington, Ky. : [University of Kentucky Libraries], 2004. http://lib.uky.edu/ETD/ukycosc2004d00183/wzhao0.pdf.

Full text

Abstract:

Thesis (Ph. D.)--University of Kentucky, 2004.<br>Title from document title page (viewed Jan. 7, 2005). Document formatted into pages; contains x, 180p. : ill. Includes abstract and vita. Includes bibliographical references (p. 173-178).

APA, Harvard, Vancouver, ISO, and other styles

4

Lloyd, James Robert. "Representation, learning, description and criticism of probabilistic models with applications to networks, functions and relational data." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709264.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Xiang, and 李想. "Managing query quality in probabilistic databases." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47753134.

Full text

Abstract:

In many emerging applications, such as sensor networks, location-based services, and data integration, the database is inherently uncertain. To handle a large amount of uncertain data, probabilistic databases have been recently proposed, where probabilistic queries are enabled to provide answers with statistical guarantees. In this thesis, we study the important issues of managing the quality of a probabilistic database. We first address the problem of measuring the ambiguity, or quality, of a probabilistic query. This is accomplished by computing the PWS-quality score, a recently prop

APA, Harvard, Vancouver, ISO, and other styles

6

Rotondo, Pablo. "Probabilistic studies in number theory and word combinatorics : instances of dynamical analysis." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC213/document.

Full text

Abstract:

L'analyse dynamique intègre des outils propres aux systèmes dynamiques (comme l'opérateur de transfert) au cadre de la combinatoire analytique, et permet ainsi l'analyse d'un grand nombre d'algorithmes et objets qu'on peut associer naturellement à un système dynamique. Dans ce manuscrit de thèse, nous présentons, dans la perspective de l'analyse dynamique, l'étude probabiliste de plusieurs problèmes qui semblent à priori bien différents : l'analyse probabiliste de la fonction de récurrence des mots de Sturm, et l'étude probabiliste de l'algorithme du “logarithme continu”. Les mots de Sturm con

APA, Harvard, Vancouver, ISO, and other styles

7

Pariente, Cesar Alberto Bravo. "Um método probabilístico em combinatória." Universidade de São Paulo, 1996. http://www.teses.usp.br/teses/disponiveis/45/45132/tde-07052010-163719/.

Full text

Abstract:

O presente trabalho é um esforço de apresentar, organizado em forma de survey, um conjunto de resultados que ilustram a aplicação de um certo método probabilístico. Embora não apresentemos resultados novos na área, acreditamos que a apresentação sistemática destes resultados pode servir para a compreensão de uma ferramenta útil para quem usa dos métodos probabilísticos na sua pesquisa em combinatória. Os resultados de que falaremos tem aparecido na última década na literatura especializada e foram usados na investigação de problemas que resitiram a outras aproximações mais clássicas. Em vez

APA, Harvard, Vancouver, ISO, and other styles

8

Schimit, Pedro Henrique Triguis. "Modelagem e controle de propagação de epidemias usando autômatos celulares e teoria de jogos." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/3/3139/tde-05122011-153541/.

Full text

Abstract:

Estuda-se o espalhamento de doenças contagiosas utilizando modelos suscetível-infectado-recuperado (SIR) representados por equações diferenciais ordinárias (EDOs) e por autômatos celulares probabilistas (ACPs) conectados por redes aleatórias. Cada indivíduo (célula) do reticulado do ACP sofre a influência de outros, sendo que a probabilidade de ocorrer interação com os mais próximos é maior. Efetuam-se simulações para investigar como a propagação da doença é afetada pela topologia de acoplamento da população. Comparam-se os resultados numéricos obtidos com o modelo baseado em ACPs ale

APA, Harvard, Vancouver, ISO, and other styles

9

Silva, Everton Juliano da. "Uma demonstração analítica do teorema de Erdös-Kac." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-24032015-132813/.

Full text

Abstract:

Em teoria dos números, o teorema de Erdös-Kac, também conhecido como o teorema fundamental de teoria probabilística dos números, diz que se w(n) denota a quantidade de fatores primos distintos de n, então a sequência de funções de distribuições N definidas por FN(x) = (1/N) #{n <= N : (w(n) log log N)/(log log N)^(1/2)} <= x}, converge uniformemente sobre R para a distribuição normal padrão. Neste trabalho desenvolvemos todos os teoremas necessários para uma demonstração analítica, que nos permitirá encontrar a ordem de erro da convergência acima.<br>In number theory, the Erdös-Kac theorem,

APA, Harvard, Vancouver, ISO, and other styles

10

Shi, Lingsheng. "Numbers and topologies." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2003. http://dx.doi.org/10.18452/14871.

Full text

Abstract:

In der Ramsey Theorie fuer Graphen haben Burr und Erdos vor nunmehr fast dreissig Jahren zwei Vermutungen formuliert, die sich als richtungsweisend erwiesen haben. Es geht darum diejenigen Graphen zu charakterisieren, deren Ramsey Zahlen linear in der Anzahl der Knoten wachsen. Diese Vermutungen besagen, dass Ramsey Zahlen linear fuer alle degenerierten Graphen wachsen und dass die Ramsey Zahlen von Wuerfeln linear wachsen. Ein Ziel dieser Dissertation ist es, abgeschwaechte Varianten dieser Vermutungen zu beweisen. In der topologischen Ramseytheorie bewies Kojman vor kurzem eine topologische

APA, Harvard, Vancouver, ISO, and other styles

11

Moravej, Hans. "Vibration-based probabilistic model updating of civil structures using structural health monitoring techniques." Thesis, Queensland University of Technology, 2020. https://eprints.qut.edu.au/203653/1/Hans%20Moravej%20Thesis.pdf.

Full text

Abstract:

Information extracted from monitored data is susceptible to uncertainties and not reliable to be used for structural investigations. Finite element model updating (FEMU) is an accredited framework which aims to improve the accuracy of FEMs of real structures. However, FEMU faces barriers to achieving efficiency and addressing uncertainties. This study aims to develop a probabilistic approach based on Modular Bayesian approach (MBA) to address challenges in the application of FEMU. Moreover, this research proposes an integration between MBA and structural reliability analysis to assess the perf

APA, Harvard, Vancouver, ISO, and other styles

12

Hayani, Mounir. "Répartition probabiliste des nombres et idéaux premiers : conjecture de Hooley et biais de Chebyshev." Electronic Thesis or Diss., Bordeaux, 2025. http://www.theses.fr/2025BORD0065.

Full text

Abstract:

Cette thèse s'intéresse à deux sujets importants en théorie analytique des nombres : le biais de Chebyshev dans les corps des nombres et la variance des nombres premiers dans les progressions arithmétiques. Le biais de Chebyshev désigne le fait que les nombres premiers tendent à favoriser certaines classes de résidus par rapport à d'autres. Ce phénomène a été observé pour la première fois par Chebyshev dans le cadre classique de la répartition des nombres premiers modulo 4 et a ensuite été étudié de façon systématique par Rubinstein et Sarnak via la notion de distribution limite et les zéros d

APA, Harvard, Vancouver, ISO, and other styles

13

Bureaux, Julien. "Méthodes probabilistes pour l'étude asymptotique des partitions entières et de la géométrie convexe discrète." Thesis, Paris 10, 2015. http://www.theses.fr/2015PA100160/document.

Full text

Abstract:

Cette thèse se compose de plusieurs travaux portant sur l'énumération et le comportement asymptotique de structures combinatoires apparentées aux partitions d'entiers. Un premier travail s'intéresse aux partitions d'entiers bipartites, qui constituent une généralisation bidimensionnelle des partitions d'entiers. Des équivalents du nombre de partitions sont obtenus dans le régime critique où l'un des entiers est de l'ordre du carré de l'autre entier et au delà de ce régime critique. Ceci complète les résultats établis dans les années cinquante par Auluck, Nanda et Wright. Le deuxième travail tr

APA, Harvard, Vancouver, ISO, and other styles

14

Lewko, Mark J. 1983. "Combinatorial and probabilistic techniques in harmonic analysis." Thesis, 2012. http://hdl.handle.net/2152/ETD-UT-2012-05-5531.

Full text

Abstract:

We prove several theorems in the intersection of harmonic analysis, combinatorics, probability and number theory. In the second section we use combinatorial methods to construct various sets with pathological combinatorial properties. In particular, we answer a question of P. Erdos and V. Sos regarding unions of Sidon sets. In the third section we use incidence bounds and bilinear methods to prove several new endpoint restriction estimates for the Paraboloid over finite fields. In the fourth and fifth sections we study a variational maximal operators associated to orthonormal systems. Here we

APA, Harvard, Vancouver, ISO, and other styles

15

Xiao, Stanley Yao. "On the Erdös-Turán conjecture and related results." Thesis, 2011. http://hdl.handle.net/10012/6150.

Full text

Abstract:

The Erdös-Turán Conjecture, posed in 1941 in, states that if a subset B of natural numbers is such that every positive integer n can be written as the sum of a bounded number of terms from B, then the number of such representations must be unbounded as n tends to infinity. The case for h = 2 was given a positive answer by Erdös in 1956. The case for arbitrary h was given by Erdös and Tetali in 1990. Both of these proofs use the probabilistic method, and so the result only shows the existence of such bases but such bases are not given explicitly. Kolountzakis gave an effective algorithm that is

APA, Harvard, Vancouver, ISO, and other styles

16

Mehdizadeh, Marzieh. "Anatomy of smooth integers." Thèse, 2017. http://hdl.handle.net/1866/19299.

Full text

Abstract:

Dans le premier chapitre de cette thèse, nous passons en revue les outils de la théorie analytique des nombres qui seront utiles pour la suite. Nous faisons aussi un survol des entiers y−friables, c’est-à-dire des entiers dont chaque facteur premier est plus petit ou égal à y. Au deuxième chapitre, nous présenterons des problèmes classiques de la théorie des nombres probabiliste et donnerons un bref historique d’une classe de fonctions arithmétiques sur un espace probabilisé. Le problème de Erdos sur la table de multiplication demande quel est le nombre d’entiers distincts apparaissant

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!