On a combinatorial problem from the model theory of wreath products. III

DOI10.1006/jcta.1999.2995zbMath0940.03050OpenAlexW2913150233MaRDI QIDQ1971617

Dan Saracino

Publication date: 24 July 2000

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.2995

zbMATH Keywords

equivalence relationswreath products

Mathematics Subject Classification ID

Partitions of sets (05A18) Model-theoretic algebra (03C60) Extensions, wreath products, and other compositions of groups (20E22)

Related Items (2)

A reduction theorem for primitive binary permutation groups ⋮ On the relational complexity of a finite permutation group

Cites Work

• On a combinatorial problem from the model theory of wreath products. I
• On a combinatorial problem from the model theory of wreath products. II
• Arities of permutation groups: Wreath products and \(k\)-sets

This page was built for publication: On a combinatorial problem from the model theory of wreath products. III