Intersection sets and blocking sets play an important role in contemporary finite geometry. There are cryptographic applications depending on their construction and combinatorial properties. This paper contributes to this topic by answering the question: how many circles of an inversive plane will b
β¦ LIBER β¦
On the cardinality of dense sets
β Scribed by Paul R Meyer
- Publisher
- Elsevier Science
- Year
- 1972
- Weight
- 125 KB
- Volume
- 75
- Category
- Article
- ISSN
- 1385-7258
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the Cardinality of Intersection Sets
β
Marcus Greferath; Cornelia RΓΆΓing
π
Article
π
2002
π
Elsevier Science
π
English
β 115 KB
Cardinality of fuzzy sets via bags
β
R.R. Yager
π
Article
π
1987
π
Elsevier Science
β 324 KB
On the cardinality of sets of sequences
β
Aimo TietΓ€vΓ€inen
π
Article
π
1992
π
Elsevier Science
π
English
β 372 KB
A linear programming approach is shown to yield an improvement over a bound due to Sidelnikov.
Continuous and Exact Sets of Specified C
β
Sherrie J. Nicol
π
Article
π
1989
π
John Wiley and Sons
π
English
β 831 KB
The Cardinality of the set of Dedekind F
β
Arthur L. Rubin; Jean E. Rubin
π
Article
π
1974
π
John Wiley and Sons
π
English
β 606 KB
The Cardinality of the Collection of Max
β
Shu-Chu Chang; Yeong-Nan Yeh
π
Article
π
1997
π
Elsevier Science
π
English
β 226 KB
An independent set or stable set of a graph G V, E is a subset S of the Ε½ . vertices set V in which no two are adjacent. Let G be the number of vertices in Ε½ . a stable set of maximum cardinality; G is called the stability number of G. Stability numbers of a graph have been well studied, but little