Direction of Goldbach Partitions

Paul Mackenzie
Messages
16
Reaction score
0
I have been investigating goldbach partitions for some time.
One interesting observation I have been able to determine is concerning the "direction" of the goldbach partitions whether they are increasing or decreasing as 2N increases.

To get an idea of this I constructed a function f(2N) where

f(2N) = 1 if G[2N] - G[2N-2] > 0
f(2N) = 0 if G[2N] - G[2N-2] = 0
f(2N) = -1 if G[2N] - G[2N-2] < 0


where G[2N] is the number of partitions for the even number 2N.

I then generated a sequence of numbers f(2N) beginning at 2N = 10 and finishing at 2N=75398
[arbitrarily selected]. The sequence is then:

{1,1,-1,1,1,-1,-1,1,1,-1,-1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,1,-1,1,1,-1,1,1,-1,...}


I ran a program to determine a histogram of the number of occurences of the subsequences of the following form


histogram

subsequence type
No. of Occurences

x,1,x
5563

x,-1,x
7003

x,1,1,x
7003

x,-1,-1,x
5562

x,1,1,1,x
0

x,-1,-1,-1,x
1

x,0,x
0





I have been trying to work out a descriptive name for this sequence. Any suggestions?

The question then arises will a sequence generated from Hardy-Littlewoods equation
for Goldbach partions be similar?

Also , any comments on the histogram? Why the assymetric nature ?

And why only these subsequences? I would have thought there would have been longer runs. Any ideas?

Paul
 
Physics news on Phys.org
What exactly does 'x,1,x' mean? Are the two x's the same or independent? Either way, the count seems much too low. How can it be less than x,1,1,x?
 
Hi Haruspex:

I am counting the number of consecutive runs of similar digits in the sequence. So the run x1x refers to either the subsequence 0,1,0, or 0,1,-1 or -1,1,0 or -1,1,-1.
As another example the consecutive run of two positive ones viz x,1,1,x refers to the subsequences -1,1,1,0 or -1,1,1,-1 or 0,1,1,0 or 0,1,1,-1.

All the counts are mutually exclusive, and add up to the correct number of digits [give or take one or two, as I am having problems with the start and end of the sequence]

But the question remains why this particular pattern.

Kind Regards
Paul
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top