Let (Z~a, <) be a finite partially ordered set with rank function. Then ff is the disjoint union of the classes ~k of elements of rank k and the order relation between elements in ~k and ~ak+ 1 can be represented by a matrix S k. We study partially ordered sets which satisfy linear recurrence relati
One class of partial sets
โ Scribed by S. S. Marchenkov
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1976
- Tongue
- English
- Weight
- 265 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In a previous paper, a certain class of discrete partially ordered sets was defined and a number of general properties of the sets was described. It was claimed that a kind of pre-geometry might be established on the basis of these definitions. To support this idea, it was asserted that a probabilit
Let G be a finite group of order v. A k-element subset D of G is called a (v, k, I, p)-partial difference set in G if the expressions gh-', for g and h in D with g # h, represent each nonidentity element contained in D exactly i times and represent each nonidentity element not contained in D exactly