Laplace operators on metric graphs are considered. It is proven that for compact graphs the spectrum of the Laplace operator determines the total length, the number of connected components, and the Euler characteristic. For a class of non-compact graphs the same characteristics are determined by the scattering data consisting of the scattering matrix and the discrete eigenvalues.

No abstract uploaded!

No abstract uploaded!

Let$M$be a ($n$−1)-dimensional manifold in$R$^{$n$}with non-vanishing Gaussian curvature. Using an estimate established in the early work of the author [4], we will improve the known result of Y. Domar on the weak spectral synthesis property by reducing the smoothness assumption upon the manifold$M$. Also as an application of the method, a uniqueness property for partial differential equations with constant coefficients will be proved, which for some specific cases recovers or improves Hörmander's general result.

In this paper, we present an experimental analysis of HFE Challenge 2 (144 bit) type systems. We generate scaled versions of the full challenge fixing and guessing some unknowns. We use the MXL_3 algorithm, an efficient algorithm for computing Gröbner basis, to solve these scaled versions. We review the MXL_3 strategy and introduce our experimental results.