English

A recursive construction for simple $t$-designs using resolution

Combinatorics 2016-12-07 v1

Abstract

This work presents a recursive construction for simple tt-designs using resolutions of the ingredient designs. The result extends a construction of tt-designs in our recent paper [39]. Essentially, the method in [39] describes the blocks of a constructed design as a collection of block unions from a number of appropriate pairs of disjoint ingredient designs. Now, if some pairs of these ingredient tt-designs have both a suitable ss-resolution, then we can define a distance mapping on their resolution classes. Using this mapping enables us to have more possibilities for forming blocks from those pairs. The method makes it possible for constructing many new simple tt-designs. We give some application results of the new construction.

Keywords

Cite

@article{arxiv.1612.01978,
  title  = {A recursive construction for simple $t$-designs using resolution},
  author = {Tran van Trung},
  journal= {arXiv preprint arXiv:1612.01978},
  year   = {2016}
}

Comments

19 pages. arXiv admin note: text overlap with arXiv:1602.06751

R2 v1 2026-06-22T17:15:18.927Z