No label defined (Q3708064)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3933135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3933135 |
Statements
1985
0 references
limit properties
0 references
subspace lattice
0 references
ranked posets
0 references
evolution of linear lattices
0 references
affine lattices
0 references
Poisson distribution
0 references
0.8539139628410339
0 references
0.8529403209686279
0 references
0.7397849559783936
0 references
0.7334843277931213
0 references
The study of the evolution of structures is tackled in this paper by the use of a general approach. With it, the possibility of deducing limit properties of the probability of interest, is opened. Denoting \(L^ n_ m\) as the elements of rank m of a subspace lattice of n-dimensional objects \(sh(A)=\{B\in L^ n_ m|\) \(B<A\}\) and by S random subsets of \(L^ n_ k\), the problem is fixed by the asymptotic behaviour of \(P=\Pr ob(\exists A\in L^ n_ m:\) sh(A)\(\subseteq S)\). P is the probability of interest. Theorem 1 fixes that, when \(n\to \infty\), \(P\to 0\) if a certain function of \(\alpha (n)=\Pr ob(X\in S)\) also tends to zero. If this function tends to infinity and the class \({\mathcal L}\) of ranked posets with rank equal to n, satisfies a fixed condition, then \(P\to 1\). This result is obtained in Theorem 2 and the third one establishes that if the given function of \(\alpha\) (n) tends to a positive constant R and \({\mathcal L}\) satisfies asymptotically certain conditions, the number of \(A\in L^ n_ m\) such that sh(A)\(\subseteq S\) is asymptotically Poisson distributed. These theorems are applied to the analysis of the evolution of linear lattices and of affine lattices. Four results are obtained. They establish the corresponding criteria for \(P\to 0\), \(P\to 1\) and for approximating it by a Poisson distribution. In Theorem 4 they are obtained for linear lattices and Theorem 5 proves the counterpart for affine lattices. The applicability of the main results to other combinatorial structures is pointed out.
0 references