Some local asymptotic laws for the Cauchy process on the line.
Okoroafor, A.Chukwuemeka (2007)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Displaying similar documents to “The closeness of the range of a probability on a certain system of random events -- an elementary proof.”
Some local asymptotic laws for the Cauchy process on the line.
Characterizing Frobenius semigroups by filtration.
Johnson, Inga, Powers, Sean, Starr, Colin, Trevelyan, Charles, Webster, Craig (2009)
Journal of Integer Sequences [electronic only]
Similarity:
On a linear Diophantine problem of Frobenius.
Tripathi, Amitabha (2006)
Integers
Similarity:
A curious identity involving binomial coefficients.
Sun, Zhiwei (2002)
Integers
Similarity:
Graph-based upper bounds for the probability of the union of events.
Veneziani, Pierangela (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A common generalization of some identities.
Zhang, Zhizheng, Wang, Jun (2005)
Integers
Similarity:
On variants of Conway and Conolly's meta-Fibonacci recursions.
Isgur, Abraham, Rahman, Mustazee (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Borel-Cantelli Lemma and moments
S. Amghibech (2006)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We present some extensions of the Borel-Cantelli Lemma in terms of moments. Our result can be viewed as a new improvement to the Borel-Cantelli Lemma. Our proofs are based on the expansion of moments of some partial sums by using Stirling numbers. We also give a comment concerning the results of Petrov V.V., , Statist. Probab. Lett. (2004), no. 3, 233–239.
A simple proof of the geometric-arithmetic mean inequality.
Uchida, Yasuharu (2008)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Regular Expression Quantifiers - m to n Occurrences
Michał Trybulec (2007)
Formalized Mathematics
Similarity:
This article includes proofs of several facts that are supplemental to the theorems proved in [10]. Next, it builds upon that theory to extend the framework for proving facts about formal languages in general and regular expression operators in particular. In this article, two quantifiers are defined and their properties are shown: m to n occurrences (or the union of a range of powers) and optional occurrence. Although optional occurrence is a special case of the previous operator (0...