The problem of maximizing the L p norms of chords connecting points on a closed curve separated by arc length u arises in electrostatic and quantum-mechanical problems. It is known that among all closed curves of fixed length, the unique maximizing shape is the circle for 1 p 2, but this is not the case for sufficiently large values of p. Here we determine the critical value p c (u) of p above which the circle is not a local maximizer finding, in particular, that p c (1 2 L)= 5 2. This corrects a claim made in [P. Exner, EM Harrell, M. Loss, Lett. Math. Phys. 75 (2006) 225].

We consider an electron with an anomalous magnetic moment, <i>g</i> &gt; &gt; 2, confined to a plane and interacting with a nonhomogeneous magnetic field <i>B</i>, and investigate the corresponding Pauli Hamiltonian. We prove a lower bound on the number of bound states for the case when <i>B</i> is of a compact support and the related flux is <i>N</i> + <i></i>, <i></i>(0, 1]. In particular, there are at least <i>N</i> + 1 bound states if <i>B</i> does not change sign. We also consider the situation where the magnetic field is due to a localized rotationally symmetric electric current vortex in the plane. In this case the flux is zero; there is a pair of bound states for a weak coupling, and higher orbital-momentum spin-down states appearing as the current strength increases.

We show that Multivariate Public Key Cryptosystems (MPKCs) over fields of small odd prime characteristic, say 31, can be highly efficient. Indeed, at the same design security of 2^{80} under the best known attacks, odd-char MPKC is generally faster than prior MPKCs over \GF{2^k}, which are in turn faster than "traditional'' alternatives. This seemingly counter-intuitive feat is accomplished by exploiting the comparative over-abundance of small integer arithmetic resources in commodity hardware, here embodied by SSE2 or more advanced special multimedia instructions on modern x86-compatible CPUs. We explain our implementation techniques and design choices in implementing our chosen MPKC instances modulo small a odd prime. The same techniques are also applicable in modern FPGAs which often contains a large number of multipliers.

No abstract uploaded!

No abstract uploaded!