RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2010 Number 4(10), Pages 5–17 (Mi pdm250)

This article is cited in 4 papers

Theoretical Foundations of Applied Discrete Mathematics

The number of disordered covers of a finite set by subsets having fixed cardinalities

R. M. Ganopolsky

Tyumen State University, Tyumen, Russia

Abstract: This article describes a new type of combinatorial numbers which calculate amount of the covers of a finite set by subsets having fixed cardinalities – parameters of numbers. A series of relations and identities are proved for them. Some sums of these numbers are computed. Special cases of new combinatorial numbers with parameters satisfying certain relations are investigated. Several other applications of these numbers in discrete mathematics are shown.

Keywords: cover, finite set, combinatoric numbers.

UDC: 519.1



© Steklov Math. Inst. of RAS, 2026