We continue the investigation of a combinatorial problem concerning multisets of equivalence relations on a finite set. ## 1999 Academic Press We denote the least such d by $(r, n). It is easy to see [2] that $(r, 2)=2 r&2 when r is even, while $(r, 2) is undefined when r is odd. Some other values
โฆ LIBER โฆ
On a Combinatorial Problem from the Model Theory of Wreath Products, III
โ Scribed by Dan Saracino
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 354 KB
- Volume
- 89
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
โฆ Synopsis
We complete the solution of a combinatorial problem concerning multisets of equivalence relations on a finite set.
2000 Academic Press f o r r=4 108 for r=8.
๐ SIMILAR VOLUMES
On a Combinatorial Problem from the Mode
โ
Dan Saracino
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 133 KB
On a Combinatorial Problem from the Mode
โ
Dan Saracino
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 181 KB
We prove some conjectures concerning a combinatorial problem that arises in the model-theoretic investigation of wreath products. ## 1999 Academic Press We denote the least such d by $(r, n). The above problem arises in connection with the study of what is called the arity of a finite permutation