English
Related papers

Related papers: On Randomness of Goldbach Sequences

200 papers

The equality between the number of odd spin structures on a Riemann surface of genus g, with $2^g - 1$ being a Mersenne prime, and the even perfect numbers, is an indication that the action of the modular group on the set of spin structures…

Mathematical Physics · Physics 2007-05-23 Simon Davis

This paper deals with (finite or infinite) sequences of arbitrary independent events in some probability space. We find sharp lower bounds for the probability of a union of such events when the sum of their probabilities is given. The…

Probability · Mathematics 2016-09-29 Jürgen Grahl , Shahar Nevo

The generation of series of random numbers is an important and difficult problem. Appropriate measurements on entangled states have been proposed as the definitive solution, based on the impossibility of exploiting quantum non locality to…

Quantum Physics · Physics 2019-08-29 Myriam Nonaka , Mónica Agüero , Marcelo Kovalsky , Alejandro Hnilo

An approach to modelling random sets with locally finite perimeter as random elements in the corresponding subspace of $L^1$ functions is suggested. A Crofton formula for flat sections of the perimeter is shown. Finally, random processes of…

Probability · Mathematics 2017-02-14 Jan Rataj

We study the asymptotic behaviour of random integer partitions under a new probability law that we introduce, the Plancherel-Hurwitz measure. This distribution, which has a natural definition in terms of Young tableaux, is a deformation of…

Combinatorics · Mathematics 2024-07-09 Guillaume Chapuy , Baptiste Louf , Harriet Walsh

When regularity lemmas were first developed in the 1970s, they were described as results that promise a partition of any graph into a ``small'' number of parts, such that the graph looks ``similar'' to a random graph on its edge subsets…

Data Structures and Algorithms · Computer Science 2025-07-01 Greg Bodwin , Tuong Le

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

Number Theory · Mathematics 2012-07-05 Terence Tao

In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…

General Mathematics · Mathematics 2021-06-03 Raouf Rajab

We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose…

Functional Analysis · Mathematics 2013-01-16 Almut Burchard , Marc Fortier

The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(\alpha p), \alpha = a/q + O(1/q^2), has been a central part of the main approach to the…

Number Theory · Mathematics 2013-12-31 H. A. Helfgott

Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…

Algebraic Geometry · Mathematics 2020-03-10 Paul Breiding , Orlando Marigliano

Quantum systems are the ultimate touchstone for the production of random sequences of numbers. Spatially spread entangled systems allow the generation of identical random sequences in remote locations. The impossibility of observing a…

Quantum Physics · Physics 2018-10-31 Marcelo G. Kovalsky , Alejandro A. Hnilo , Mónica B. Agüero

We show algorithmic randomness versions of the two classical theorems on subsequences of normal numbers. One is Kamae-Weiss theorem (Kamae 1973) on normal numbers, which characterize the selection function that preserves normal numbers.…

Information Theory · Computer Science 2016-01-01 Hayato Takahashi

Factorization is the most fundamental way to determine if a number $n$ is prime or composite. Yet, this approach becomes impracticable when considering large values of $n$, a difficulty that is exploited by cryptographic protocols. We…

Quantum Physics · Physics 2023-10-06 A. L. M. Southier , L. F. Santos , P. H. Souto Ribeiro , A. D. Ribeiro

The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no uniform effective procedure…

Information Theory · Computer Science 2007-12-11 Marius Zimand

We extend the Siegel-Walfisz theorem to a family of integer sequences that are characterized by constraints on the size of the prime factors. Besides prime powers, this family includes smooth numbers, almost primes and practical numbers.

Number Theory · Mathematics 2021-03-30 Andreas Weingartner

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Probability · Mathematics 2021-03-18 Arup Bose , Koushik Saha , Arusharka Sen , Priyanka Sen

The goal of this paper is to study Goldbach's conjecture for rings of regular functions of affine algebraic varieties over a field. Among our main results, we define the notion of Goldbach condition for Newton polytopes, and we prove in a…

Number Theory · Mathematics 2023-12-29 Alberto F. Boix , Danny A. J. Gómez-Ramírez

The correlation measure of order $k$ is a measure of pseudorandomness that quantifies the similarity between a sequence and its shifts. It is known that the correlation of order 4 is large for the Rudin-Shapiro sequence despite having nice…

Number Theory · Mathematics 2023-06-21 Pierre Popoli

A systematic study of the probability distribution of superimposed random codes is presented through the use of generating functions. Special attention is paid to the cases of either uniformly distributed but not necessarily independent or…

Databases · Computer Science 2008-06-19 Bernd Günther
‹ Prev 1 8 9 10 Next ›