On the probability that subset sequences are minimal

DOI10.1016/S0012-365X(99)00112-0MaRDI QIDQ1817583zbMATH OpenOpenAlexWikidataFDO

Authors Dung Le, Anthony J. Macula

Publication date 27 June 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00112-0

zbMATH Keywords

\(k\)-setsprobabilityrepresentativesequence of sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40) Extremal combinatorics (05D99)

Review text

Let \([n]= \{1,2,\dots, n\}\) and let \(\omega= (\omega(i))^p_{i= 1}\) be a \(p\)-sequence of \(k\)-sets of \([n]\). If there is an element \(x_i\) in \(\omega(i)\) which is not in any other \(\omega(j)\) with \(j\neq i\), then \(x_i\) is called a representative of \(\omega(i)\). Further, if every entry of \(\omega\) has \(t\) representatives, then \(\omega\) is called \((n,p,k,t)\)-minimal. The authors give a lower bound for the probability that \(\omega\) is \((n,p,k,t)\)-minimal.

Recommendations

• Probabilities for Intersecting Systems and Random Subsets of Finite Sets
• scientific article; zbMATH DE number 822743
• Minimal completely separating systems of \(k\)-sets
• Random minimal coverings of sets
• Representatives for Finite Sets

Cited in

(2)

• On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence
• On sets not belonging to algebras

This page was built for publication: On the probability that subset sequences are minimal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817583)