State transitions on graphs and analysis in cognitive and human sciences
State transitions on graphs and analysis in cognitive and human sciences
Mohammadesmail Nikfar1
1) PhD in Pure Mathematics, Mathematics Teacher, Department of Education, District 4, Tehran, Iran
IOI Code
:
ABFK-ABHHGE
Publication :
The third international conference on new researches in management, law, humanities and entrepreneurship(icmlhe.ir)
Abstract :
If there is a complete state transition from u to v in X at time t, then X is a cycle in u with period 2t. Our last result shows that the minimum time for a complete state transition with activity u is determined by the minimum period in u. Some premises are recalled. Suppose X is connected and T denotes the set of times t such that 〖H(t)e〗_u is a scalar multiple of e_u. Then T is an Abelian subgroup of R. By considering small values of t H(t)≈I+itA and also assuming 〖Ae〗_u≠0, we can obtain as a tangible consequence the discrete subgroup of T in R. So it was a cycle, but its generator is the minimum period of X in u. So the realization of a complete state transition from u to v at time t will lead to a cycle of X in u with period 2t. In conclusion, t≥σ/2 holds.
Keywords : regular graph complete permutation continuous quantum tour cognitive and human sciences