We discuss a modification of Smilansky model in which a singular potential channel is replaced by a regular, below unbounded potential which shrinks as it becomes deeper. We demonstrate that, similarly to the original model, such a system exhibits a spectral transition with respect to the coupling constant, and determine the critical value above which a new spectral branch opens. The result is generalized to situations with multiple potential channels.

Representations of the sl (n+ 1, C) Lie algebras are constructed with the help of canonical (boson) realisations of these algebras. For every weight Lambda on the standard Cartan subalgebra of sl (n+ 1, C) the authors obtain a representation rho Lambda (n+ 1)(called the maximal representation) which contains an irreducible subrepresentation with Lambda as the highest weight. It is shown that for a major part of the weights Lambda the representations rho Lambda (n+ 1) themselves are irreducible. The standard construction of the highest-weight representations of semi-simple Lie algebras is based on the so-called elementary representations; comparing with them, the authors maximal representations are given in the explicit form.

We prove that a random map drawn from any class \mathfrak{C} of polynomial maps from (F_q)^n to (F_q)^{n+r} that is (i) totally random in the affine terms, and (ii) has a negligible chance of being not strongly one-way, provides a secure PRNG (hence a secure stream cipher) for any q. Plausible choices for are semi-sparse (i.e., the affine terms are truly random) systems and other systems that are easy to evaluate from a small (compared to a generic map) number of parameters. To our knowledge, there are no other positive results for provable security of specialized polynomial systems, in particular sparse ones (which are natural candidates to investigate for speed). We can build a family of provably secure stream ciphers a rough implementation of which at the same security level can be more than twice faster than an optimized QUAD (and any other provably secure stream ciphers proposed so far), and uses much less storage. This may also help build faster provably secure hashes. We also examine the effects of recent results on specialization on security, e.g., Aumasson-Meier (ICISC 2007), which precludes Merkle-Damgaard compression using polynomials systems {uniformly very sparse in every degree} from being universally collision-free. We conclude that our ideas are consistent with and complements these new results. We think that we can build secure primitives based on specialized (versus generic) polynomial maps which are more efficient.

No abstract uploaded!

We investigate an infinite array of point interactions of the same strength in \mathbb{R} ^<i>d</i>, <i>d</i> = 2, 3, situated at vertices of a polygonal curve with a fixed edge length. We demonstrate that if the curve is not a line, but it is asymptotically straight in a suitable sense, the corresponding Hamiltonian has bound states. An example is given in which the number of these bound states can exceed any positive integer.