No abstract uploaded!

Recent developments in multivariate polynomial solving algorithms have made algebraic cryptanalysis a plausible threat to many cryptosystems. However, theoretical complexity estimates have shown this kind of attack unfeasible for most realistic applications. In this paper we present a strategy for computing Gröbner basis that challenges those complexity estimates. It uses a flexible partial enlargement technique together with reduced row echelon forms to generate lower degree elements–mutants. This new strategy surpasses old boundaries and obligates us to think of new paradigms for estimating complexity of Gröbner basis computation. The new proposed algorithm computed a Gröbner basis of a degree 2 random system with 32 variables and 32 equations using 30 GB which was never done before by any known Gröbner bases solver.

No abstract uploaded!

We study singular Schrdinger operators with an attractive interaction supported by a closed smooth surface AR3 and analyze their behavior in the vicinity of the critical situation where such an operator has empty discrete spectrum and a threshold resonance. In particular, we show that if A is a sphere and the critical coupling is constant over it, any sufficiently small smooth area-preserving radial deformation gives rise to isolated eigenvalues. On the other hand, the discrete spectrum may be empty for general deformations. We also derive a related inequality for capacities associated with such surfaces.

In this note we prove that the essential spectrum of a Schrdinger operator with potential supported on a finite number of compact Lipschitz hypersurfaces is given by [0, +). We emphasize that the union of a family of Lipschitz hypersurfaces is in general not Lipschitz. ( 2013 WileyVCH Verlag GmbH & Co. KGaA, Weinheim)