On Minimizing ||S−(AX−XB)||Pp

In this paper, we minimize the map Fp (X)= ||S−(AX−XB)||Pp , where the pair (A, B) has the property (F P )Cp , S ∈ Cp , X varies such that AX − XB ∈ Cp and Cp denotes the von Neumann-Schatten class.

Zero-Dimensionality and Serre Rings

2000 Mathematics Subject Classification: Primary 13A99; Secondary 13A15, 13B02, 13E05.

Applying A Normalized Compression Metric To The Measurement Of Dialect Distance

The paper discusses the application of a similarity metric based on compression to the measurement of the distance among Bulgarian dia- lects. The similarity metric is de ned on the basis of the notion of Kolmo- gorov complexity of a le (or binary string). The application of Kolmogorov complexity in practice is not possible because its calculation over a le is an undecidable problem. Thus, the actual similarity metric is based on a real life compressor which only approximates the Kolmogorov complexity. To use the metric for distance measurement of Bulgarian dialects we rst represent the dialectological data in such a way that the metric is applicable. We propose two such representations which are compared to a baseline distance between dialects. Then we conclude the paper with an outline of our future work.