Boolean 2-designs and the embedding of a 2-design in a group
| dc.creator | Caggegi, Andrea | |
| dc.creator | Di Bartolo, Alfonso | |
| dc.creator | Falcone, Giovanni | |
| dc.date | 2008-06-20 | |
| dc.date | 2008-07-03 | |
| dc.date.accessioned | 2026-07-07T09:47:59Z | |
| dc.date.available | 2026-07-07T09:47:59Z | |
| dc.description | We try to embed a t-design in a finite commutative group in such a way that the sum of the k points of a block is zero. We can compute the number of blocks of the boolean 2-design having all the non zero vectors of $(Z_2)^n$ as the set of points and the k-subsets of elements the sum of which is zero as blocks. | |
| dc.description | Extended abstract of a talk given at the conference Combinatorics 2008, Costermano (Italy) 22-28 June 2008. Removed Corollary 9 (false!) | |
| dc.identifier | https://arxiv.org/abs/0806.3433 | |
| dc.identifier | http://arxiv.org/abs/0806.3433 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/164048 | |
| dc.subject | Combinatorics | |
| dc.subject | 05B05, 05B25 | |
| dc.title | Boolean 2-designs and the embedding of a 2-design in a group | |
| dc.type | text |