Refined Deterministic Algorithm for Biplane Construction
Ivica Martinjak,Mario Osvin Pavčević +1 more
- 30 Mar 2010
- Vol. 18, Iss: 1, pp 45-52
TL;DR: A way of constructing biplanes that uses “filters” in a step prior to an exhaustive computer search, with the objective to make the biplane construction more efficient.
read more
Abstract: This paper introduces a way of constructing biplanes that uses “filters” in a step prior to an exhaustive computer search, with the objective to make the biplane construction more efficient. The achieved deterministic algorithm classifies biplanes of order 7 and smaller. When performing the search using some additional presumptive conditions, two biplanes of order 9 (k=11) were constructed and a particular inner regularity in the biplane’s structure has been established.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Book
Combinatorial Designs: Constructions and Analysis
Douglas R. Stinson
- 17 Oct 2003
TL;DR: It is shown here how orthogonal Latin squares can be transformed into BIBDs using Hadamard matrices, and how different sets and automorphisms can be modified for different levels of integration.
Isomorph-Free Exhaustive Generation
TL;DR: A very general technique for generating families of combinatorial objects without isomorphs is described, which applies to almost any class of objects for which an inductive construction process exists.
541
•Book
Designs and their codes
Jr. E. F. Assmus
- 01 Jan 1992
TL;DR: The standard geometric codes are presented, followed by a list of recommended designs and some examples of how these designs might be implemented in the real world.
405