Geodesic
On the enumeration of uniquely reducible double designs
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

Voir la notice de l'article provenant de la source Episciences

A double $2$-$(v,k,2 \lambda)$ design is a design which is reducible into two $2$-$(v,k,\lambda)$ designs. It is called uniquely reducible if it has, up to equivalence, only one reduction. We present properties of uniquely reducible double designs which show that their total number can be determined if only the designs with non-trivial automorphisms are classified with respect to their automorphism group. As an application, after proving that a reducible $2$-$(21,5,2)$ design is uniquely reducible, we establish that the number of all reducible $2$-$(21,5,2)$ designs is $1 746 461 307$. 
@article{DMTCS_2005_special_250_a25,
     author = {Fack, Veerle and Topalova, Svetlana and Winne, Joost},
     title = {On the enumeration of uniquely reducible double designs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3416},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3416/}
}
TY  - JOUR
AU  - Fack, Veerle
AU  - Topalova, Svetlana
AU  - Winne, Joost
TI  - On the enumeration of uniquely reducible double designs
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3416/
DO  - 10.46298/dmtcs.3416
LA  - en
ID  - DMTCS_2005_special_250_a25
ER  - 
%0 Journal Article
%A Fack, Veerle
%A Topalova, Svetlana
%A Winne, Joost
%T On the enumeration of uniquely reducible double designs
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3416/
%R 10.46298/dmtcs.3416
%G en
%F DMTCS_2005_special_250_a25
Fack, Veerle; Topalova, Svetlana; Winne, Joost. On the enumeration of uniquely reducible double designs. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3416. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3416/

Cité par Sources :