从关联结构识别递归设计

Two recursive constructions of Amarra, Devillers and Praeger replace points by copies of a uniform design and produce natural wreath-product groups of automorphisms. We recover their defining partitions from the unlabelled incidence structures and determine the full automorphism groups, proving both of the authors' conjectures for arbitrary input 1-designs. The single-partition construction has exactly one exceptional family: two copies of a complete balanced bipartite graph. For the grid construction we also determine the full group in the two-row case, where independent permutations of the columns in each row enlarge the natural group. The proof uses the classical code generated by differences of block vectors. Its orthogonal space recovers fibers or grid columns; pair incidences handle the graph-input boundary. We compute the integer incidence quotients and all prime ranks of both constructions. The Smith normal form of the single-partition matrix gives parameter-free recovery of its input design. Fixed finite iterations inherit the group and isomorphism results.