ON SYSTEMS OF INDEPENDENT SETS

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86096417" target="_blank" >RIV/61989100:27240/15:86096417 - isvavai.cz</a>
Result on the web
<a href="http://www.degruyter.com/view/j/ms.2015.65.issue-1/issue-files/ms.2015.65.issue-1.xml" target="_blank" >http://www.degruyter.com/view/j/ms.2015.65.issue-1/issue-files/ms.2015.65.issue-1.xml</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
ON SYSTEMS OF INDEPENDENT SETS
Original language description
The classical probability that a randomly chosen number from the set {n is an element of N : n {= n(0)} belongs to a set A subset of N can be approximated for large number n(0) by the asymptotic density of the set A. We say that the events are independent if the probability of their intersection is equal to the product of their probabilities. By analogy we define the independence of sets. We say that the sets are independent if the asymptotic density of their intersection is equal to the product of their asymptotic densities. In the article is described a generalisation of one of the criteria of independence of sets and one interesting case in which sets are not independent. (C) 2015 Mathematical Institute Slovak Academy of Sciences
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)