Recent content by Adel Makram

Do galaxies that have surpassed the speed of light during the cosmic expansion emit radiation waves comparable to the sonic boom when an aeroplane breaches the sound barrier?

Except when a=0 and y<x, there is no solution. For a=0 and x>y, there is a solution but the matrix becomes absorbing Markov Matrix.

It is not a solvable problem. I converted the problem of solving the matrix into a problem of solving a (4x1) vector. The 4x4 matrix is not invertible, so there is no solution for the vector containing the entries of my original matrix. However, the correct solution is ##A = \begin{bmatrix}...

The problem is that those 4 equations failed, to me, to solve the 4 unknown. And my question is, given the stationary vector, is there any way to determine the transitional matrix?

So, how many solutions for A (aside from the trivial identity matrix) satisfy the equation, $$ \begin{bmatrix} a & b \\ c & d \end{bmatrix} \begin{bmatrix} 5/11\\ 6/11 \end{bmatrix}= \begin{bmatrix} 5/11\\ 6/11 \end{bmatrix} $$ ?

Thanks for the reply. Here is a sample from a home survey report.; "The flat roof covering to the side extension could not be seen from ground level or from a 3m surveyor's ladder. It was not raining at the time of inspection, so it is not possible to confirm that all roof coverings and...

Hi, I am looking for an app that converts a checklist to text. The advantage of this app is to save time in writing professional reports. For example, suppose a professional uses a list of 10 possible variables to examine a case but finds only 4 variables match a pre-set quality criteria. In...

But we know nothing about the entries values of ##A##, so how to determine its eigenvectors?

But what \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} has to do with the matrix ##A##?

Hi, For a 2 x 2 matrix ##A## representing a Markov transitional probability, we can compute the stationary vector ##x## from the relation $$Ax=x$$ But can we compute ##A## of the 2x2 matrix if we know the stationary vector ##x##? The matrix has 4 unknowns we should have 4 equations; so for a ##A...

Yes, this is correct.

Now you found the period of the cycle is 4. Is it possible to run your program to find the minimum length of symbols in the same generation that repeats itself? I know that Penrose tiling is not periodic so there may be no period. But I just want to study the statistical transition from one...

This is amazing thank you very much. These rules are the same local rules of Penrose tiling. No wondering the number 5 pops up.

I do not see why the cipher should be cyclic? What if we start with a million symbols already and let them reproduce and then keep truncating the result to the first million at each generation? How to assert that the first symbol in G41, on average, will be exactly the first symbol of G0?

Can you explain why less than 2? So, is checking the result every time against Gn or Gm a polynomial complexity?