Essential selfadjointness of singular magnetic Schrödinger operators on Riemannian manifolds

In this paper we extend the well-known Leinfelder–Simader theorem on the essential selfadjointness of singular Schrödinger operators to arbitrary complete Riemannian manifolds. This improves some earlier results of Shubin, Milatovic and others.

On the strong uniqueness of some finite dimensional Dirichlet operators

We prove essential self-adjointness of a class of Dirichlet operators in ℝn using the hyperbolic equation approach. This method allows one to prove essential self-adjointness under minimal conditions on the logarithmic derivative of the density and a condition of Muckenhoupt type on the density itself.

Toeplitz operators with distributional symbols on Bergman spaces

We study the boundedness and compactness of Toeplitz operators Ta on Bergman spaces , 1 < p < ∞. The novelty is that we allow distributional symbols. It turns out that the belonging of the symbol to a weighted Sobolev space of negative order is sufficient for the boundedness of Ta. We show the natural relation of the hyperbolic geometry of the disc and the order of the distribution. A corresponding sufficient condition for the compactness is also derived.

A note on the Fredholm properties of Toeplitz operators on weighted Bergman spaces with matrix-valued symbols

We characterize the essential spectra of Toeplitz operators Ta on weighted Bergman spaces with matrix-valued symbols; in particular we deal with two classes of symbols, the Douglas algebra C+H∞ and the Zhu class Q := L∞ ∩VMO∂ . In addition, for symbols in C+H∞ , we derive a formula for the index of Ta in terms of its symbol a in the scalar-valued case, while in the matrix-valued case we indicate that the standard reduction to the scalar-valued case fails to work analogously to the Hardy space case. Mathematics subject classification (2010): 47B35,

New results and open problems on Toeplitz operators in Bergman spaces

We discuss some of the recent progress in the field of Toeplitz operators acting on Bergman spaces of the unit disk, formulate some new results, and describe a list of open problems -- concerning boundedness, compactness and Fredholm properties -- which was presented at the conference "Recent Advances in Function Related Operator Theory'' in Puerto Rico in March 2010.

Toeplitz operators on Bergman spaces with locally integrable symbols

We study the boundedness of Toeplitz operators $T_a$ with locally integrable symbols on Bergman spaces $A^p(\mathbb{D})$, $1 < p < \infty$. Our main result gives a sufficient condition for the boundedness of $T_a$ in terms of some ``averages'' (related to hyperbolic rectangles) of its symbol. If the averages satisfy an ${o}$-type condition on the boundary of $\mathbb{D}$, we show that the corresponding Toeplitz operator is compact on $A^p$. Both conditions coincide with the known necessary conditions in the case of nonnegative symbols and $p=2$. We also show that Toeplitz operators with symbols of vanishing mean oscillation are Fredholm on $A^p$ provided that the averages are bounded away from zero, and derive an index formula for these operators.

Spectral theory of Toeplitz and Hankel operators on the Bergman space A1

The Fredholm properties of Toeplitz operators on the Bergman space A2 have been well-known for continuous symbols since the 1970s. We investigate the case p=1 with continuous symbols under a mild additional condition, namely that of the logarithmic vanishing mean oscillation in the Bergman metric. Most differences are related to boundedness properties of Toeplitz operators acting on Ap that arise when we no longer have 1operators on A1 were characterized completely very recently but only for bounded symbols. We also consider compactness of Hankel operators on A1.

Hankel operators on Fock spaces

We study Hankel operators on the weighted Fock spaces Fp. The boundedness and compactness of these operators are characterized in terms of BMO and VMO, respectively. Along the way, we also study Berezin transform and harmonic conjugates on the plane. Our results are analogous to Zhu's characterization of bounded and compact Hankel operators on Bergman spaces of the unit disk.

Parallel rule induction with information theoretic pre-pruning

In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to inducing classification rules, one is the divide and conquer approach, also known as the top down induction of decision trees; the other approach is called the separate and conquer approach. A considerable amount of work has been done on scaling up the divide and conquer approach. However, very little work has been conducted on scaling up the separate and conquer approach.In this work we describe a parallel framework that allows the parallelisation of a certain family of separate and conquer algorithms, the Prism family. Parallelisation helps the Prism family of algorithms to harvest additional computer resources in a network of computers in order to make the induction of classification rules scale better on large datasets. Our framework also incorporates a pre-pruning facility for parallel Prism algorithms.

Induction of modular classification rules: using Jmax-pruning

The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree structure. Classifiers induced by Prism algorithms achieve a comparable accuracy compared with decision trees and in some cases even outperform decision trees. Both kinds of algorithms tend to overfit on large and noisy datasets and this has led to the development of pruning methods. Pruning methods use various metrics to truncate decision trees or to eliminate whole rules or single rule terms from a Prism rule set. For decision trees many pre-pruning and postpruning methods exist, however for Prism algorithms only one pre-pruning method has been developed, J-pruning. Recent work with Prism algorithms examined J-pruning in the context of very large datasets and found that the current method does not use its full potential. This paper revisits the J-pruning method for the Prism family of algorithms and develops a new pruning method Jmax-pruning, discusses it in theoretical terms and evaluates it empirically.

Jmax-pruning: a facility for the information theoretic pruning of modular classification rules

The Prism family of algorithms induces modular classification rules in contrast to the Top Down Induction of Decision Trees (TDIDT) approach which induces classification rules in the intermediate form of a tree structure. Both approaches achieve a comparable classification accuracy. However in some cases Prism outperforms TDIDT. For both approaches pre-pruning facilities have been developed in order to prevent the induced classifiers from overfitting on noisy datasets, by cutting rule terms or whole rules or by truncating decision trees according to certain metrics. There have been many pre-pruning mechanisms developed for the TDIDT approach, but for the Prism family the only existing pre-pruning facility is J-pruning. J-pruning not only works on Prism algorithms but also on TDIDT. Although it has been shown that J-pruning produces good results, this work points out that J-pruning does not use its full potential. The original J-pruning facility is examined and the use of a new pre-pruning facility, called Jmax-pruning, is proposed and evaluated empirically. A possible pre-pruning facility for TDIDT based on Jmax-pruning is also discussed.

Femtosecond pulse shaping using differential evolutionary algorithm and wavelet operators

Evolutionary meta-algorithms for pulse shaping of broadband femtosecond duration laser pulses are proposed. The genetic algorithm searching the evolutionary landscape for desired pulse shapes consists of a population of waveforms (genes), each made from two concatenated vectors, specifying phases and magnitudes, respectively, over a range of frequencies. Frequency domain operators such as mutation, two-point crossover average crossover, polynomial phase mutation, creep and three-point smoothing as well as a time-domain crossover are combined to produce fitter offsprings at each iteration step. The algorithm applies roulette wheel selection; elitists and linear fitness scaling to the gene population. A differential evolution (DE) operator that provides a source of directed mutation and new wavelet operators are proposed. Using properly tuned parameters for DE, the meta-algorithm is used to solve a waveform matching problem. Tuning allows either a greedy directed search near the best known solution or a robust search across the entire parameter space.

Spectral theory of some non-selfadjoint linear differential operators

We give a characterisation of the spectral properties of linear differential operators with constant coefficients, acting on functions defined on a bounded interval, and determined by general linear boundary conditions. The boundary conditions may be such that the resulting operator is not selfadjoint. We associate the spectral properties of such an operator $S$ with the properties of the solution of a corresponding boundary value problem for the partial differential equation $\partial_t q \pm iSq=0$. Namely, we are able to establish an explicit correspondence between the properties of the family of eigenfunctions of the operator, and in particular whether this family is a basis, and the existence and properties of the unique solution of the associated boundary value problem. When such a unique solution exists, we consider its representation as a complex contour integral that is obtained using a transform method recently proposed by Fokas and one of the authors. The analyticity properties of the integrand in this representation are crucial for studying the spectral theory of the associated operator.