We consider a quantum mechanical particle living on a graph and discuss the behaviour of its wavefunction at graph vertices. In addition to the standard (or-type) boundary conditions with continuous wavefunctions, we investigate two types of a singular coupling which are analogous to the interaction and its symmetrized version for a particle on a line. We show that these couplings can be used to model graph superlattices in which point junctions are replaced by complicated geometric scatterers. We also discuss the band spectra for rectangular lattices with the mentioned couplings. We show that they roughly correspond to their Kronig-Penney analogues: the lattices have bands whose widths are asymptotically bounded and do not approach zero, while the lattice gap widths are bounded. However, if the lattice-spacing ratio is an irrational number badly approximable by rationals, and the coupling constant is small

We discuss a model of a leaky quantum wire and a family of quantum dots described by Laplacian in L²(²) with an attractive singular perturbation supported by a line and a finite number of points. The discrete spectrum is shown to be nonempty, and furthermore, the resonance problem can be explicitly solved in this setting; by Birman-Schwinger method it is reformulated into a Friedrichs-type model.

No abstract uploaded!

In this paper, we prove a closed formula for the degree of regularity of the family of HFE- (HFE Minus) multivariate public key cryptosystems over a finite field of size q. The degree of regularity of the polynomial system derived from an HFE- system is less than or equal to \begin{eqnarray*} \frac{(q-1)(\lfloor \log_q(D-1)\rfloor +a)}2 +2 & & \text{if is even and is odd,} \\ \frac{(q-1)(\lfloor \log_q(D-1)\rfloor+a+1)}2 +2 & & \text{otherwise.} \end{eqnarray*} Here q is the base field size, D the degree of the HFE polynomial, r=\lfloor \log_q(D-1)\rfloor +1 and a is the number of removed equations (Minus number). This allows us to present an estimate of the complexity of breaking the HFE Challenge 2: \begin{itemize} \item the complexity to break the HFE Challenge 2 directly using algebraic solvers is about 2^{96}. \end{itemize}

No abstract uploaded!