At the age of almost three quarters of a century, quantum mechanics is by all accounts a mature theory. There were times when it seemed that it had borne its best fruit already and would give way to investigation of deeper levels of matter. Today this sounds like rash thinking. Modern experimental techniques have led to discoveries of numerous new quantum effects in solid state, optics and elsewhere. Quantum mechanics is thus gradually becoming a basis for many branches of applied physics, in this way entering our everyday life. While the dynamic laws of quantum mechanics are well known, a proper theoretical understanding requires methods which would allow us to de rive the abundance of observed quantum effects from the first principles. In many cases the rich structure hidden in the Schr6dinger equation can be revealed only using sophisticated tools. This constitutes a motivation to investigate rigorous methods which yield mathematically well-founded properties of quantum systems.

No abstract uploaded!

The problem is concerned about how large (e.g. the Hausdorff dimension) is Whitney's critical set contained in a given fractal. For this, we prove that the Moran arc, an arc containing a Moran set, is a Whitney's critical set. The excellent open set condition is defined, when the condition holds, the associated self-similar set contains a Whitney's critical subset of full dimension. As its application, the Sierpinski gasket and Koch curve have Whitney's critical subset of full dimension. Finally, we provide a self-similar tree which never contains any Whitney's critical set.

We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security properties and potential feasibility, where the compression functions are randomly chosen high-degree polynomials, and show that under some plausible assumptions, high-degree polynomials as compression functions has good properties. Next, we propose to improve on the efficiency of the system by using some specially designed polynomials generated by a small number of random parameters, where the security of the system would then relies on stronger assumptions, and we give empirical evidence for the validity of using such polynomials.

No abstract uploaded!