Theorem of mutations in a numeral sequence

  • Thread starter Thread starter dimension10
  • Start date Start date
  • Tags Tags
    Sequence Theorem
dimension10
Messages
371
Reaction score
0
I have observed a strange thing when you modify a sequence of numbers bit by bit.
 

Attachments

Physics news on Phys.org
I have read your paper, but I am a bit perplexed by the last line:

'You will notice that no matter what the X and Y sequences are n-n2.'

What do you mean by this? If you mean that the sequences are of length n - n2, then this is not true as n = n2 = 3 in your example.

I am always interested in theorems regarding numerical strings, but I feel that your paper did not quite convey the theorem you are wanting to give us.

Any way you can simply write out the theorem without any example? If not, maybe rephrase your last line/paragraph to better explain this.

Ben
 
BWElbert said:
I have read your paper, but I am a bit perplexed by the last line:

'You will notice that no matter what the X and Y sequences are n-n2.'

What do you mean by this? If you mean that the sequences are of length n - n2, then this is not true as n = n2 = 3 in your example.

I am always interested in theorems regarding numerical strings, but I feel that your paper did not quite convey the theorem you are wanting to give us.

Any way you can simply write out the theorem without any example? If not, maybe rephrase your last line/paragraph to better explain this.

Ben

I think he meant n = n2 not n-n2
Edit but that can't be right since it dosn't work for the mutation ABCDE->BAECD.
 
Last edited:
##\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