No abstract uploaded!

The product formula for perturbations of propagators by Faris is generalized: we show that one can use arbitrary partitions of a given interval and perform the limit uniformly with respect to the partition norm. The results are applied to express solutions of the Schrdinger equation, in particular for some complex and time-dependent potentials, by means of Nelson-type path integrals.

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 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.

In this paper, we present a new algorithm, such that, for the small integer solution (SIS) problem, if the solution is bounded ( by an integer \beta in l_\infty norm, which we call a bounded SIS (BSIS) problem, {\it and if the difference between the row dimension n and the column dimension m of the corresponding matrix is relatively small with respect the row dimension m}, we can solve it easily with a complexity of polynomial in m.