On Superpotentials and Charge Algebras of Gauge Theories

We propose a new "Hamiltonian inspired" covariant formula to define (without harmful ambiguities) the superpotential and the physical charges associated to a gauge symmetry. The criterion requires the variation of the Noether current not to contain any derivative terms in \partial_{\mu}\delta \f. The examples of Yang-Mills (in its first order formulation) and 3-dimensional Chern-Simons theories are revisited and the corresponding charge algebras (with their central extensions in the Chern-Simons case) are computed in a straightforward way. We then generalize the previous results to any (2n+1)-dimensional non-abelian Chern-Simons theory for a particular choice of boundary conditions. We compute explicitly the superpotential associated to the non-abelian gauge symmetry which is nothing but the Chern-Simons Lagrangian in (2n-1) dimensions. The corresponding charge algebra is also computed. However, no associated central charge is found for $n \geq 2$. Finally, we treat the abelian p-form Chern-Simons theory in a similar way.Comment: 32 pages, LaTex. The proposal is restricted to first order theories. An appendix is added. Some references are adde

Quantum dense coding over Bloch channels

Dynamics of coded information over Bloch channels is investigated for different values of the channel's parameters. We show that, the suppressing of the travelling coded information over Bloch channel can be increased by decreasing the equilibrium absolute value of information carrier and consequently decreasing the distilled information by eavesdropper. The amount of decoded information can be improved by increasing the equilibrium values of the two qubits and decreasing the ratio between longitudinal and transverse relaxation times. The robustness of coded information in maximum and partial entangled states is discussed. It is shown that the maximum entangled states are more robust than the partial entangled state over this type of channels

Internal Partitions of Regular Graphs

An internal partition of an $n$-vertex graph $G=(V,E)$ is a partition of $V$ such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every $d$-regular graph with $n>N(d)$ vertices has an internal partition. Here we prove this for $d=6$. The case $d=n-4$ is of particular interest and leads to interesting new open problems on cubic graphs. We also provide new lower bounds on $N(d)$ and find new families of graphs with no internal partitions. Weighted versions of these problems are considered as well