Theoretically, in order to describe the behavior of a spectrum, a mathematical model whichcould predict the spectrum characteristics is needed. Since in this study a Two-state system has beenused like models which was introduced previously past and could couple with the environment, theformer ideas have been extended in this study. we use the second quantized version for writing thisHamiltonian...

in this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite hamiltonian group. the coverings with three proper subgroups and the principal series of such a group are also counted. finally, we give a complete description of the lattice of characteristic subgroups of a finite h...

We consider a simple electromagnetic gyrokinetic model for collisionless plasmas and show that it possesses a Hamiltonian structure. Subsequently, from this model we derive a two-moment gyrofluid model by means of a procedure which guarantees that the resulting gyrofluid model is also Hamiltonian. The first step in the derivation consists of imposing a generic fluid closure in the Poisson brack...

Definition 1 A Hamiltonian cycle in a graph is a cycle that visits each vertex exactly once. A Hamiltonian graph is a graph that contains a Hamiltonian cycle. It is well known that the problem of determining if a graph is Hamiltonian is N P-complete. Here we will construct a NIZK proof in the hidden-bits model (HBM) that is able to prove that a graph is Hamiltonian. First we define how graphs a...