The Discounted Limit Theorems

The large deviation theorems, exponential inequalities and a non-uniform estimate of the Berry–Esséen theorem in a discounted version are proved.Dedicated to Professor Vytautas Statulevičius on the occasion of his 75th birthday.     

Note on nonuniform estimate for compound poisson approximations to 2-runs

We obtain nonuniform estimates depending on the interval length for Poisson and compound Poisson approximations to 2-runs. We calculate exact constants for the estimates in the Wasserstein metric.     

Joint discrete limit theorems in the space of analytic functions for general Dirichlet series

We prove joint discrete limit theorems in the sense of weak convergence of probability measures in the space of analytic functions for general Dirichlet series.__________Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 1, pp. 104–116, January–March, 2005.Translated by R. Macaitien     

Discrete limit theorems for general Dirichlet series. III

Here we prove a limit theorem in the sense of the weak convergence of probability measures in the space of meromorphic functions for a general Dirichlet series. The explicit form of the limit measure in this theorem is given. Partially supported by Lithuanian Foundation of Studies and Science     

A sharp inequality for the variance with respect to the Ewens sampling formula

Lithuanian Mathematical Journal - We examine the variance of a linear statistic defined on the symmetric group endowed with the Ewens probability. Despite the dependence of the summands, it can be...     

Solvability of a mathematical model of dissociative adsorption and associative desorption type

A mathematical model of dissociative adsorption and associative desorption for diatomic molecules is generalized. The model is described by a coupled system of parabolic and ordinary differential equations. The existence and uniqueness theorem of the classical solution is proved.     

Some decidable classes of formulas of pure hybrid logic

We consider the formulas of pure hybrid logic without occurrences of a satisfaction operator. We describe a couple of formula derivation tactics in sequent calculus and prove the decidability of two classes of formulas. Decidable classes are obtained by setting restrictions on nominal occurrences in the formulas. Published in Lietuvos Matematikos Rinkinys, Vol. 44, No. 4, pp. 563–572, October–December, 2007.     

Decidability of Some Classes of Modal Logic

We describe a modal sequential calculus some modal rules of which do not contain duplications of the main formula. We also prove its equivalence to the modal calculus S4 and the decidability of some classes of formulas containing only oneplace predicate variables.