We study Schrdinger operators on an infinite quantum graph of a chain form which consists of identical rings connected at the touching points by -couplings with a parameter\alpha\in {\bb R}. If the graph is' straight', ie periodic with respect to ring shifts, its Hamiltonian has a band spectrum with all the gaps open whenever 0. We consider a'bending'deformation of the chain consisting of changing one position at a single ring and show that it gives rise to eigenvalues in the open spectral gaps. We analyze dependence of these eigenvalues on the coupling and the'bending angle'as well as resonances of the system coming from the bending. We also discuss the behaviour of the eigenvalues and resonances at the edges of the spectral bands.

Let <i>A</i> and <i>B</i> be non-negative self-adjoint operators in a separable Hilbert space such that their form sum <i>C</i> is densely defined. It is shown that the Trotter product formula holds for imaginary parameter values in the <i>L</i> ²-norm, that is, one has <div class="gsh_dspfr"> \lim_{no+\infty} \int\limits^T_{-T} \left\|\left(e^{-itA/n}e^{-itB/n} ight)^nh - e^{-itC}hight\|^2dt = 0

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.

Using the complex coloring method, we present the graphs of the quantum dilogarithm function Gb(z) and visualize its analytic and asymptotic behaviours. In particular we demonstrate the limiting process when the modified Gb(z)→Γ(z) as b→0. We also survey the relations of Gb(z) with different variants of the quantum dilogarithm function.

In this paper, we show the claims in the original Kipnis-Shamir attack on the HFE cryptosystems and the improved attack by Courtois that the complexity of the attacks is polynomial in terms of the number of variables are invalid. We present computer experiments and a theoretical argument using basic algebraic geometry to explain why it is so. Furthermore we show that even with the help of the powerful new Gröbner basis algorithm like F_4, the Kipnis-Shamir attack still should be exponential but not polynomial. This again is supported by our theoretical argument.