Remember Me
Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:

OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, login, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Bulgarian Digital Mathematics Library at IMI-BAS
Institutional Repository
2602 Publications
More information
Detailed data provider information (OpenDOAR)


  • On the Holomorphic Extension of Solutions of Elliptic Pseudodifferential Equations

    Cappiello, Marco; Nicola, Fabio (2012)
    2010 Mathematics Subject Classification: 35B65, 35S05, 35A20. We derive analytic estimates and holomorphic extensions for the solutions of a class of elliptic pseudodifferential equations on Rd.

    Nadel's Subschemes of Fano Manifolds X with a Picard Group Pic(X) Isomorphic to Z

    Yotov, M. (1997)
    ∗The author supported by Contract NSFR MM 402/1994. In this paper we find a global sufficient condition for suitable subschemes of Fano manifolds to be Nadel’s subschemes. We apply this condition to one-dimensional subschemes of a projective space.

    Relationship between Extremal and Sum Processes Generated by the same Point Process

    Pancheva, E.; Mitov, I.; Volkovich, Z. (2009)
    2000 Mathematics Subject Classification: Primary 60G51, secondary 60G70, 60F17. We discuss weak limit theorems for a uniformly negligible triangular array (u.n.t.a.) in Z = [0, ∞) × [0, ∞)^d as well as for the associated with it sum and extremal processes on an open subset S . The complement of S turns out to be the explosion area of the limit Poisson point process. In order to prove our criterion for weak convergence of the sum processes we introduce and study sum processes o...

    A Bimodality Test in High Dimensions

    Palejev, Dean (2012)
    We present a test for identifying clusters in high dimensional data based on the k-means algorithm when the null hypothesis is spherical normal. We show that projection techniques used for evaluating validity of clusters may be misleading for such data. In particular, we demonstrate that increasingly well-separated clusters are identified as the dimensionality increases, when no such clusters exist. Furthermore, in a case of true bimodality, increasing the dimensionality ma...

    An Effective Method for Constructing Data Structures Solving an Array Maintenance Problem

    Toni, Adriana; Herranz, Angel; Castellanos, Juan (2008)
    In this paper a constructive method of data structures solving an array maintenance problem is offered. These data structures are defined in terms of a family of digraphs which have previously been defined, representing solutions for this problem. We present as well a prototype of the method in Haskell.
  • No data provider research data found
  • Latest Documents Timeline

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Document Types

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Funders in data provider publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Projects with most Publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark

Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok