Representations and Positive Definite Functions on Hypergroups

Some relationships between representations of a hypergroup X, its algebras, and positive definite functions on X are studied. Also, various types of convergence of positive definite functions on X are discussed.

Improving the Lexicon of Positive/Negative Words and Bigrams for Sentiment Analysis

Report published in the Proceedings of the National Conference on "Education in the Information Society", Plovdiv, May, 2013

On some Extremal Problems of Landau

2000 Mathematics Subject Classification: Primary: 42A05. Secondary: 42A82, 11N05.

An Intelligent System for Investigations and Provision of Safety for Complex Constructions

Methodology of computer-aided investigation and provision of safety for complex constructions and a prototype of the intelligent applied system, which implements it, are considered. The methodology is determined by the model of the object under scrutiny, by the structure and functions of investigation of safety as well as by a set of research methods. The methods are based on the technologies of object-oriented databases, expert systems and on the mathematical modeling. The intelligent system’s prototype represents component software, which provides for support of decision making in the process of safety investigations and investigation of the cause of failure. Support of decision making is executed by analogy, by determined search for the precedents (cases) with respect to predicted (on the stage of design) and observed (on the stage of exploitation) parameters of the damage, destruction and malfunction of a complex hazardous construction.

Rough Maximal Oscillatory Singular Integral Operators

2000 Mathematics Subject Classification: Primary 42B20; Secondary 42B15, 42B25

A Brief Story about the Operators of the Generalized Fractional Calculus

2000 Mathematics Subject Classification: 26A33, 33C60, 44A20

Quasi-Monte Carlo Methods for some Linear Algebra Problems. Convergence and Complexity

We present quasi-Monte Carlo analogs of Monte Carlo methods for some linear algebra problems: solving systems of linear equations, computing extreme eigenvalues, and matrix inversion. Reformulating the problems as solving integral equations with a special kernels and domains permits us to analyze the quasi-Monte Carlo methods with bounds from numerical integration. Standard Monte Carlo methods for integration provide a convergence rate of O(N^(−1/2)) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting convergence rate for numerical integration as good as O((logN)^k)N^(−1)). We have shown theoretically and through numerical tests that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the considered Monte Carlo methods. We also analyze the complexity of considered quasi-Monte Carlo algorithms and compare them to the complexity of the analogous Monte Carlo and deterministic algorithms.

Marginal Densities of the Wishart Distribution

2010 Mathematics Subject Classification: 62H10.

Averaging operators and set-valued maps

MSC 2010: 54C35, 54C60.