No abstract uploaded!

For a fractal Schrodinger operator with a continuous potential and a coupling parameter, we obtain an analog of a semi-classical asymptotic formula for the number of bound states as the parameter tends to infinity. We also study Bohr's formula for Schrodinger operators on blowups of self-similar sets. For a Schrodinger operator defined by a fractal measure and a locally bounded potential that tends to infinity, we derive an analog of Bohr's formula under various assumptions. We demonstrate how these results can be applied to self-similar measures with overlaps, including the infinite Bernoulli convolution associated with the golden ratio, a family of convolutions of Cantor-type measures, and a family of measures that we call essentially of finite type.

No abstract uploaded!

The approach combines second and fourth order statistics to perform BSS of instantaneous mixtures. It applies for any number of receivers if they are as many as sources. It is a batch algorithm that uses non-Gaussianity and stationarity of source signals. It is linear algebra based direct method, reliable and robust, though large dimensions of sources may slow down the computation significantly. It is however limited to instantaneous mixtures.

In this paper, we try to clarify some of the questions related to a key concept in multivariate polynomial solving algorithm over a finite field: the degree of regularity. By the degree of regularity, here we refer to a concept first presented by Dubois and Gama, namely the lowest degree at which certain nontrivial degree drop of a polynomial system occurs. Currently, it is somehow commonly accepted that we can use this degree to estimate the complexity of solving a polynomial system, even though we do not have systematic empirical data or a theory to support such a claim. In this paper, we would like to clarify the situation with the help of experiments. We first define a concept of solving degree for a polynomial system. The key question we then need to clarify is the connection of solving degree and the degree of regularity with focus on quadratic systems. To exclude the cases that do not represent the general situation, we need to define when a system is degenerate and when it is irreducible. With extensive computer experiments, we show that the two concepts, the degree of regularity and the solving degree, are related for irreducible systems in the sense that the difference between the two degrees is indeed small, less than 3. But due to the limitation of our experiments, we speculate that this may not be the case for high degree cases.