Almost sure limit theorems for random allocationsAlmost sure limit
theorems are presented for random allocations. A general almost sure limit
Analog of theWeierstrass Theorem and the Blaschke Product for A(z)-analytic Functions(z)-analytic functions analogs of the Weierstrass
theorem and of the Blaschke
theorem are proved
Poisson Limit Theorems for Number of Given Value Cells in Non-Homogeneous Generalized Allocation Scheme. As corollary we obtain a Poisson limit
theorems for the number of given value cells from the first K cells
Partial measures in the extended real line. Analogs of the Jordan decomposition
theorem and the Radon-Nikodym
theorem are obtained.
Poisson Limit Theorems in an Allocation Scheme with an Even Number of Particles in Each CellPoisson Limit
Theorems in an Allocation Scheme with an Even Number of Particles in Each Cell
POISSON LIMIT THEOREMS IN ALLOCATION SCHEMES OF DISTINGUISHABLE PARTICLES variables, and our conditions coincide with the conditions of a classical Poisson limit
theorem. We obtain
Covering of nonlinear maps on a cone in neighborhoods of irregular pointsInverse function
theorems for smooth nonlinear maps defined on convex cones in Banach spaces in a
Theorems of the Alternative for Systems of Convex Inequalities are obtained in the form of a
theorem of the alternative. We revisit some results from the literature where
Almost sure limit theorems for the pearson statisticAlmost sure versions of limit
theorems by Kruglov for the Pearson χ2-statistic are obtained.