TL;DR: In this paper, the commutation relations within the Pauli groups built on all decompositions of a given Hilbert space dimension $q, containing a square, into its factors are studied.
Abstract: We study the commutation relations within the Pauli groups built on all decompositions of a given Hilbert space dimension $q$, containing a square, into its factors. Illustrative low dimensional examples are the quartit ($q=4$) and two-qubit ($q=2^2$) systems, the octit ($q=8$), qubit/quartit ($q=2\times 4$) and three-qubit ($q=2^3$) systems, and so on. In the single qudit case, e.g. $q=4,8,12,...$, one defines a bijection between the $\sigma (q)$ maximal commuting sets [with $\sigma[q)$ the sum of divisors of $q$] of Pauli observables and the maximal submodules of the modular ring $\mathbb{Z}_q^2$, that arrange into the projective line $P_1(\mathbb{Z}_q)$ and a independent set of size $\sigma (q)-\psi(q)$ [with $\psi(q)$ the Dedekind psi function]. In the multiple qudit case, e.g. $q=2^2, 2^3, 3^2,...$, the Pauli graphs rely on symplectic polar spaces such as the generalized quadrangles GQ(2,2) (if $q=2^2$) and GQ(3,3) (if $q=3^2$). More precisely, in dimension $p^n$ ($p$ a prime) of the Hilbert space, the observables of the Pauli group (modulo the center) are seen as the elements of the $2n$-dimensional vector space over the field $\mathbb{F}_p$. In this space, one makes use of the commutator to define a symplectic polar space $W_{2n-1}(p)$ of cardinality $\sigma(p^{2n-1})$, that encodes the maximal commuting sets of the Pauli group by its totally isotropic subspaces. Building blocks of $W_{2n-1}(p)$ are punctured polar spaces (i.e. a observable and all maximum cliques passing to it are removed) of size given by the Dedekind psi function $\psi(p^{2n-1})$. For multiple qudit mixtures (e.g. qubit/quartit, qubit/octit and so on), one finds multiple copies of polar spaces, ponctured polar spaces, hypercube geometries and other intricate structures. Such structures play a role in the science of quantum information.
TL;DR: The Journal of Physics A: Mathematical and Theoretical publishing team would like to apologise to the author of the above paper due to an oversight, the article was published with an incorrect publication date as mentioned in this paper.
Abstract: The Journal of Physics A: Mathematical and Theoretical publishing team would like to apologise to the author of the above paper. Due to an oversight, the article was published with an incorrect publication date. The correct date is: 20 December 2010.
TL;DR: In this paper, a generalization of the Dedekind-Psi function for any integer is introduced, where the ratio of the divisor function is defined as the sum of the polynomial functions of all the divisible integers.
Abstract: Recall that an integer is $t-$free iff it is not divisible by $p^t$ for some prime $p.$ We give a method to check Robin inequality $\sigma(n) < e^\gamma n\log\log n,$ for $t-$free integers $n$ and apply it for $t=6,7.$ We introduce $\Psi_t,$ a generalization of Dedekind $\Psi$ function defined for any integer $t\ge 2$ by $$\Psi_t(n):=n\prod_{p \vert n}(1+1/p+\cdots+1/p^{t-1}).$$ If $n$ is $t-$free then the sum of divisor function $\sigma(n)$ is $ \le \Psi_t(n).$ We characterize the champions for $x \mapsto \Psi_t(x)/x,$ as primorial numbers. Define the ratio $R_t(n):=\frac{\Psi_t(n)}{n\log\log n}.$ We prove that, for all $t$, there exists an integer $n_1(t),$ such that we have $R_t(N_n)< e^\gamma$ for $n\ge n_1,$ where $N_n=\prod_{k=1}^np_k.$ Further, by combinatorial arguments, this can be extended to $R_t(N)\le e^\gamma$ for all $N\ge N_n,$ such that $n\ge n_1(t).$ This yields Robin inequality for $t=6,\,7.$ For $t$ varying slowly with $N$, we also derive $R_t(N)< e^\gamma.$
TL;DR: The Riemann Hypothesis is equivalent to the Dedekind π(n) function for n ≥ 3, and it is shown in this article that the ratio π (n) = π n/n log n/log π log n for π = 1 + π 2/n/n.
Abstract: Let $\Psi(n):=n\prod_{p | n}(1+\frac{1}{p})$ denote the Dedekind $\Psi$ function. Define, for $n\ge 3,$ the ratio $R(n):=\frac{\Psi(n)}{n\log\log n}.$ We prove unconditionally that $R(n) \frac{e^\gamma}{\zeta(2)}$ for $n\ge 3$ is equivalent to the Riemann Hypothesis.
TL;DR: In this article, it was shown that the Riemann hypothesis is satisfied if and only if $f(n)=\psi(n)/n-e^{\gamma} \log \log n n_0=30$ (D), where π(n) is Euler's constant.
Abstract: Let $\mathcal{P}$ be the set of all primes and $\psi(n)=n\prod_{n\in \mathcal{P},p|n}(1+1/p)$ be the Dedekind psi function. We show that the Riemann hypothesis is satisfied if and only if $f(n)=\psi(n)/n-e^{\gamma} \log \log n n_0=30$ (D), where $\gamma \approx 0.577$ is Euler's constant. This inequality is equivalent to Robin's inequality that is recovered from (D) by replacing $\psi(n)$ with the sum of divisor function $\sigma(n)\ge \psi(n)$ and the lower bound by $n_0=5040$. For a square free number, both arithmetical functions $\sigma$ and $\psi$ are the same. We also prove that any exception to (D) may only occur at a positive integer $n$ satisfying $\psi(m)/m<\psi(n)/n$, for any $m