No article text was recorded for this version.
combinatorial design construction (infinite combinatorial structure generation)
Version 1 of 110 papers22 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Latin Matchings and Ordered Designs OD(n−1, n, 2n−1)
- Blog: Almost designs and their links with balanced incomplete block designs
- Blog: Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract)
- Blog: Large sets of disjoint t-designs
- Blog: More results on large sets of Kirkman triple systems
- Blog: On amicable orthogonal designs of order 8
- Blog: Streamlining Local Search for Spatially Balanced Latin Squares
- Blog: Combinatorial t-designs from quadratic functions
- Blog: The subfield codes and subfield subcodes of a family of MDS codes
- Blog: Partial geometric designs from group actions
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_combinatorial_design_construction_infini_e93e9ede,
title = {combinatorial design construction (infinite combinatorial structure generation)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/combinatorial-design-construction-infinite-combinatorial-structure-generation/rdr_e93e9ede08574dafafdcf7f4c6745891},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_combinatorial_design_construction_infini_e93e9ede_v1,
title = {combinatorial design construction (infinite combinatorial structure generation)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/combinatorial-design-construction-infinite-combinatorial-structure-generation/rdr_e93e9ede08574dafafdcf7f4c6745891/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}