Constructing t-designs with prescribed automorphism groups
|
|
- MargaretMargaret Barnett
- 5 years ago
- Views:
Transcription
1 Constructing t-designs with prescribed automorphism groups 2 Mario Osvin Pavčević University of Zagreb Croatia mario.pavcevic@fer.hr /37
2 Dear organizers, thank you very much for the invitation! 2 2/37
3 Dear organizers, thank you very much for the invitation! 2 This talk emerged unter the influence of my colleagues to whom I owe big thanks and want to mention in particular my close collaborators from the University of Zagreb, Croatia: Vedran Krčadinac Ivica Martinjak Anamari Nakić as well as the colleagues from the University of, Germany: Reinhard Laue Axel Kohnert Alfred Wassermann 2/37
4 Definition. A t-(v, k, λ) design D is a pair (P, B), consisting of a v-element set of points P and a collection B of its k-element subsets called blocks, such that each t-element subset of P is contained in exactly λ blocks. 2 3/37
5 Definition. A t-(v, k, λ) design D is a pair (P, B), consisting of a v-element set of points P and a collection B of its k-element subsets called blocks, such that each t-element subset of P is contained in exactly λ blocks. Every t-design is also an s-design, for all s t, with parameters ) v s = v, k s = k, λ s = λ ( v s t s ( k s t s ) 2 3/37
6 Definition. A t-(v, k, λ) design D is a pair (P, B), consisting of a v-element set of points P and a collection B of its k-element subsets called blocks, such that each t-element subset of P is contained in exactly λ blocks. Every t-design is also an s-design, for all s t, with parameters ) v s = v, k s = k, λ s = λ In particular, each point is contained in r = λ = λ ( v t ( k t ( v s t s ( k s t s blocks and since the empty set is contained in every block, the number of blocks equals to ( v t) ) ) b = λ = λ ( k. t) ) 2 3/37
7 Examples. 2-(7, 3, ) design P = {,, 2, 3, 4, 5, 6} B = {{, 2, 3}, {,, 4}, {, 2, 5}, {, 3, 6}, {, 5, 6}, {2, 4, 6}, {3, 4, 5}} 2 4/37
8 Examples. 2-(7, 3, ) design 2 P = {,, 2, 3, 4, 5, 6} B = {{, 2, 3}, {,, 4}, {, 2, 5}, {, 3, 6}, {, 5, 6}, {2, 4, 6}, {3, 4, 5}} 4/37 J I
9 3-(8, 4, ) design P = {,, 2, 3, 4, 5, 6, 7} B = {{, 2, 3, 7}, {,, 4, 7}, {, 2, 5, 7}, {, 3, 6, 7}, {, 5, 6, 7}, {2, 4, 6, 7}, {3, 4, 5, 7}, {, 4, 5, 6}, {2, 3, 5, 6}, {, 3, 4, 6}, {, 2, 4, 5}, {, 2, 3, 4}, {,, 3, 5}, {,, 2, 6}} 2 5/37
10 3-(8, 4, ) design P = {,, 2, 3, 4, 5, 6, 7} B = {{, 2, 3, 7}, {,, 4, 7}, {, 5, 6, 7}, {, 4, 5, 6}, {2, 3, 5, 6}, {, 2, 3, 4}, 2 {, 2, 5, 7}, {2, 4, 6, 7}, {, 3, 4, 6}, {,, 3, 5}, {, 3, 6, 7}, {3, 4, 5, 7}, {, 2, 4, 5}, {,, 2, 6}} 5/37 J I
11 Besides as a list of blocks, a t-design can be represented by a - matrix M = [m ij ] called incidence matrix. If we denote the points of D by P = {p, p 2,..., p v } and the blocks of D by B = {B, B 2,..., B v }, then the entries of the incidence matrix are defined by {, if pi B m ij = j, otherwise 2 6/37
12 Besides as a list of blocks, a t-design can be represented by a - matrix M = [mij ] called incidence matrix. If we denote the points of D by P = {p, p2,..., pv } and the blocks of D by B = {B, B2,..., Bv }, then the entries of the incidence matrix are defined by, if pi Bj mij =, otherwise 2 M = 6/37 J I
13 2 7/37 J I
14 For the sake of simplicity, rename the vertices of the cube: 2 8/37 J I
15 Goal: construct t-(v, k, λ) designs effectively 2 9/37
16 Goal: construct t-(v, k, λ) designs effectively 2 Reasons: existence question (hard) enumeration problem (hard) get an example with given parameters quickly (not so hard) 9/37
17 Goal: construct t-(v, k, λ) designs effectively 2 Reasons: existence question (hard) enumeration problem (hard) get an example with given parameters quickly (not so hard) We use the deterministic approach (generating all, classification), adding some constraints. 9/37
18 Goal: construct t-(v, k, λ) designs effectively 2 Reasons: existence question (hard) enumeration problem (hard) get an example with given parameters quickly (not so hard) We use the deterministic approach (generating all, classification), adding some constraints. In this way, the constructed structures will be even more regular. 9/37
19 Goal: construct t-(v, k, λ) designs effectively 2 Reasons: existence question (hard) enumeration problem (hard) get an example with given parameters quickly (not so hard) We use the deterministic approach (generating all, classification), adding some constraints. In this way, the constructed structures will be even more regular. 9/37 We shall consider two (similar) types of constraints: tactical decompositions automorphisms
20 What is a tactical decomposition? 2 /37
21 What is a tactical decomposition? 2 M = /37 J I
22 What is a tactical decomposition? 2 M = Suppose that there is a partition /37 P = P t P2 t t Pm and B = B t B2 t t Bn, so that every submatrix Mij of M, consisting of rows of Pi and columns of Bj (i =,..., m; j =,..., n) has a constant number of s in each row and column. We shall call such a decomposition of the incidence matrix a tactical decomposition. J I
23 Two tactical decompositions are trivial in case of a t-(v, k, λ) design: the whole M itself (m = n = ) m = v and n = b (each entry alone) So, we look for non-trivial tactical decompositions! 2 /37
24 Two tactical decompositions are trivial in case of a t-(v, k, λ) design: the whole M itself (m = n = ) m = v and n = b (each entry alone) So, we look for non-trivial tactical decompositions! 2 Denote by Further denote by ρ ij = the number of s in each row of M ij κ ij = the number of s in each column of M ij. p = {B B p B}, for any p P and B = {p P p B}, for any B B, then we can formulate the coefficients ρ ij and κ ij as ρ ij = p B j, p P i κ ij = B P i, B B j. /37
25 In one of our previous examples 2 2/37 J I
26 In one of our previous examples 2 these coefficients are: 2 2 [ρij ] = 2 2 [κij ] = /37 J I
27 Find necessary conditions which a TD of a t-(v, k, λ) has to fulfil! Count the total number of s in M ij in two ways. 2 3/37
28 Find necessary conditions which a TD of a t-(v, k, λ) has to fulfil! Count the total number of s in M ij in two ways. You get: P i ρ ij = B j κ ij. () 2 3/37
29 Find necessary conditions which a TD of a t-(v, k, λ) has to fulfil! Count the total number of s in M ij in two ways. You get: P i ρ ij = B j κ ij. () 2 3/37 Interprete it as a double counting of {(p, B) p P i, B B j, p B}.
30 Take any point p P i. Look at the following set of triples: {(p, q, B) q P l, p B, q B} 2 4/37
31 Take any point p P i. Look at the following set of triples: {(p, q, B) q P l, p B, q B} 2 4/37
32 Take any point p P i. Look at the following set of triples: {(p, q, B) q P l, p B, q B} 2 A double counting gives here the following equation: n ρ ij κ lj = p q = I know that! q P l j= 4/37
33 The generalized version of this formula is n ρ ij κ l jκ l2 j κ ls j = q P l j= p q q 2 q s, (2) q 2 P l2 q s P ls 2 which one gets by taking a fixed point p P i and counting the set {(p, q, q 2,..., q s, B) q P l,..., q s P ls, p B, q B,..., q s B} in two different ways, for any appropriate integer s. 5/37
34 The generalized version of this formula is n ρ ij κ l jκ l2 j κ ls j = q P l j= p q q 2 q s, (2) q 2 P l2 q s P ls 2 which one gets by taking a fixed point p P i and counting the set {(p, q, q 2,..., q s, B) q P l,..., q s P ls, p B, q B,..., q s B} in two different ways, for any appropriate integer s. 5/37 Good news: The right-hand side of (2) can be easily calculated in case of a t-design, for all s t.
35 Are these equations all that I know about ρ ij and κ ij? 2 6/37
36 Are these equations all that I know about ρ ij and κ ij? Add the trivial conditions n ρ ij = r, i, and j= m κ ij = k, j. (3) i= 2 6/37
37 Are these equations all that I know about ρ ij and κ ij? Add the trivial conditions n ρ ij = r, i, and j= m κ ij = k, j. (3) i= 2 Together with (2), which can be rewritten via () only in terms of ρ ij, that s it! q P l P i ρ ij = B j κ ij n ρ ij κ l jκ l2 j κ ls j = j= p q q 2 q s q 2 P l2 q s P ls 6/37
38 Another example of a tactical decomposition of a 3-(8, 4, ) design: 2 7/37 J I
39 What is an automorphism of a design? 2 8/37
40 What is an automorphism of a design? A well-known notion: a permutation of points which preserves the blocks. 2 ϕ = (,, 2, 3)(4, 5, 6, 7) is an automorphism. hϕi is an automorphism group, a subgroup of the full automorphism group AutD. Point orbits P = {,, 2, 3} t {4, 5, 6, 7} partition P Block orbits B = {{,, 2, 3}} t {{4, 5, 6, 7}} t other 4 sides t {{, 2, 4, 6}, {, 3, 5, 7}} t other 4 diag. par. edges t 2 indep. sets partition B 8/37 J I
41 Proposition Rows and columns of an incidence matrix M of a t- (v, k, λ) design D corresponding to the point and block orbits obtained under an action of an automorphism group G AutD form a tactical decomposition. 2 9/37
42 Proposition Rows and columns of an incidence matrix M of a t- (v, k, λ) design D corresponding to the point and block orbits obtained under an action of an automorphism group G AutD form a tactical decomposition. Remark Not every tactical decomposition of a t-(v, k, λ) design comes from an action of an automorphism group of it! Our next constructions shall prove it. 2 9/37
43 Proposition Rows and columns of an incidence matrix M of a t- (v, k, λ) design D corresponding to the point and block orbits obtained under an action of an automorphism group G AutD form a tactical decomposition. Remark Not every tactical decomposition of a t-(v, k, λ) design comes from an action of an automorphism group of it! Our next constructions shall prove it. There are (at least) two known different approaches how to construct designs with the additional constraint that an automorphism group acts on it: Finding all candidates for tactical decomposition matrices [ρ ij ] and blowing them up to incidence matrices. (in addition: using this method, find designs with tactical decompositions which are not orbits) Finding the Kramer-Mesner matrix and solving the linear system of equations. (in addition: improve the method by implementing the knowledge coming from the tactical decomposition matrices) 2 9/37
44 Blowing up TDM s and getting designs without any automorphisms 2 2/37
45 Blowing up TDM s and getting designs without any automorphisms General construction procedure. Prescribe a group G. 2. Prescribe its action on points and blocks. 3. Classify all tactical decomposition matrix candidates, e.g. matrices [ρ ij ] fulfilling the equations () (3). 4. Try to construct incidence matrices of the designs, consistent with achieved TD matrices, by forgetting the group action at this stage, expanding each entry of the TD-matrix to its full size in an incidence matrix. 2 2/37
46 Blowing up TDM s and getting designs without any automorphisms General construction procedure. Prescribe a group G. 2. Prescribe its action on points and blocks. 3. Classify all tactical decomposition matrix candidates, e.g. matrices [ρ ij ] fulfilling the equations () (3). 4. Try to construct incidence matrices of the designs, consistent with achieved TD matrices, by forgetting the group action at this stage, expanding each entry of the TD-matrix to its full size in an incidence matrix. Since there is a computer program, written by V. Krčadinac, which solves the step 3 above quite general (for any t-design) we shall concentrate on step 4 - changing the coefficient ρ ij by a matrix with ρ ij s in each row and κ ij s in each column. 2 2/37
47 Assume now that a cyclic group of order p, p prime, acts on a design. Then P i, B j {, p} The only interesting (non-unique) case for step 4 is 2 P i = B j = p. 2/37
48 Assume now that a cyclic group of order p, p prime, acts on a design. Then P i, B j {, p} The only interesting (non-unique) case for step 4 is 2 P i = B j = p. Note that Alltop s lemma gives immediately ρ ij = κ ij. Hence, the problem in to replace the coefficient ρ ij by a p p matrix M ij posessing ρ ij s in each row and each column, taking care of the design properties. 2/37
49 Assume now that a cyclic group of order p, p prime, acts on a design. Then P i, B j {, p} The only interesting (non-unique) case for step 4 is 2 P i = B j = p. Note that Alltop s lemma gives immediately ρ ij = κ ij. Hence, the problem in to replace the coefficient ρ ij by a p p matrix M ij posessing ρ ij s in each row and each column, taking care of the design properties. If you take M ij to be cyclic, you preserve the group action, and have exactly ( ) p 2/37 possibilities. ρ ij
50 If you want to forget the cyclic action, the number of possibilities becomes quite large very soon. 2 22/37
51 If you want to forget the cyclic action, the number of possibilities becomes quite large very soon. Throw a look at the table: 2 p ρ ij Cyc ij All ij /37
52 In case p = 2: can t avoid the cyclic action! 2 23/37
53 In case p = 2: can t avoid the cyclic action! In case p 5: the number of possibilities is quite large for an exhaustive search and comparison with the cyclic case. 2 23/37
54 In case p = 2: can t avoid the cyclic action! In case p 5: the number of possibilities is quite large for an exhaustive search and comparison with the cyclic case. So, the convenient and interesting case is p = 3. Here, the number of possibilites in non-unique cases have doubled, and we can speak of the cyclic and anti-cyclic matrices of order 3 as replacements for ρ ij, if ρ ij {, 2}, e.g. if ρ ij =, then cyclic possibilities:, anti-cyclic possibilities:,,, 2 23/37
55 Results for symmetric (36, 5, 6) designs The number of fixed points (and blocks) F {, 3, 6, 9}. 2 F TDM s /37
56 Results for symmetric (36, 5, 6) designs The number of fixed points (and blocks) F {, 3, 6, 9}. 2 F TDM s An exhaustive search of step 4 in the cyclic case gives F TDM s niso /37
57 Theorem There are exactly 46 symmetric designs with parameters (36, 5, 6) admitting an action of an automorphism of order /37
58 Theorem There are exactly 46 symmetric designs with parameters (36, 5, 6) admitting an action of an automorphism of order 3. 2 Here is a complete list of the automorphism group orders and their frequencies among all constructed designs. Aut(D) niso Aut(D) niso Aut(D) niso Aut(D) niso 2 25/37
59 A (not quite exhaustive) search of step 4 in the cyclic + anti-cyclic case gives F niso Cyc niso All all This search was not exhaustive in case F = ; the number of structures is quite large and we had to stop it. Altogether, the following statement concludes this search: Proposition There are at least symmetric designs with parameters (36, 5, 6) and of them don t admit any non-trivial automorphisms. 2 26/37
60 Results for symmetric (4, 6, 6) designs The number of fixed points (and blocks) F {5, }. 2 27/37
61 Results for symmetric (4, 6, 6) designs The number of fixed points (and blocks) F {5, }. 2 Outcome of step 3: F TDM s /37
62 Results for symmetric (4, 6, 6) designs The number of fixed points (and blocks) F {5, }. Outcome of step 3: F TDM s An exhaustive search of step 4 in the cyclic case gives F TDM s niso /37
63 Results for symmetric (4, 6, 6) designs The number of fixed points (and blocks) F {5, }. Outcome of step 3: F TDM s An exhaustive search of step 4 in the cyclic case gives F TDM s niso Theorem There are exactly symmetric designs with parameters (4, 6, 6) admitting an action of an automorphism of order /37
64 The following table gives a concise overview of the described results for the cyclic case. Aut(D) F = F = 5 all /37
65 The following table gives a concise overview of the described results for the cyclic case. Aut(D) F = F = 5 all An exhaustive search in step 4 in the cyclic + anti-cyclic case gives F niso Cyc niso All all /37
66 Altogether, the following statement concludes this search: Proposition There are at least 4448 symmetric designs with parameters (4, 6, 6) and 959 of them don t admit any non-trivial automorphisms. 2 29/37
67 Altogether, the following statement concludes this search: Proposition There are at least 4448 symmetric designs with parameters (4, 6, 6) and 959 of them don t admit any non-trivial automorphisms. We conclude this search with an informative table on the number of non-isomorphic (4, 6, 6) designs admitting only a tactical decomposition with partition sizes and 3 and their automorphism group orders. Aut(D) F = F = 5 all /37
68 Kramer-Mesner approach improved by TDM knowledge 2 3/37
69 Kramer-Mesner approach improved by TDM knowledge 2 G = group of permutations of {, 2,..., v} 3/37
70 Kramer-Mesner approach improved by TDM knowledge 2 G = group of permutations of {, 2,..., v} T, T 2,..., T m orbits on t-subsets of {,..., v} K, K 2,..., K n orbits on k-subsets of {,..., v} 3/37
71 Kramer-Mesner approach improved by TDM knowledge 2 G = group of permutations of {, 2,..., v} T, T 2,..., T m orbits on t-subsets of {,..., v} K, K 2,..., K n orbits on k-subsets of {,..., v} a ij = { K K j T K }, T T i (does not depend on choice!) A G tk = [a ij ] Kramer-Mesner matrix 3/37
72 Kramer-Mesner approach improved by TDM knowledge 2 G = group of permutations of {, 2,..., v} T, T 2,..., T m orbits on t-subsets of {,..., v} K, K 2,..., K n orbits on k-subsets of {,..., v} a ij = { K K j T K }, T T i (does not depend on choice!) A G tk = [a ij ] Kramer-Mesner matrix Theorem. A simple t-(v, k, λ) design with G as a group of automorphisms exists if and only if the system of linear equations A G tk x = λj has a {, }-solution. The main problem when applying: the size of this linear system! 3/37
73 Main idea: Incorporate the knowledge that gives you the tactical decomposition matrix when building the Kramer-Mesner matrix, to reduce the number of columns! 2 3/37
74 Main idea: Incorporate the knowledge that gives you the tactical decomposition matrix when building the Kramer-Mesner matrix, to reduce the number of columns! Example Have a look at the parameters 2-(7, 3, ) 2 Define the point set to be P = {,, 2, 3, 4, 5, 6} If we assume G to be trivial, its all orbits are of cardinality. Therefore, there are ( ( 7 2) orbits on the 2-element subsets of P and 7 ) 3 orbits on the 3-element subsets of P. We need to solve the system A 23 x = λj. KM-attempt: solve this 2 35 system! 3/37
75 Main idea: Incorporate the knowledge that gives you the tactical decomposition matrix when building the Kramer-Mesner matrix, to reduce the number of columns! Example Have a look at the parameters 2-(7, 3, ) 2 Define the point set to be P = {,, 2, 3, 4, 5, 6} If we assume G to be trivial, its all orbits are of cardinality. Therefore, there are ( ( 7 2) orbits on the 2-element subsets of P and 7 ) 3 orbits on the 3-element subsets of P. We need to solve the system A 23 x = λj. KM-attempt: solve this 2 35 system! Assume now G = ()(, 2, 3)(4, 5, 6) Now, A G 23 becomes a 7 3 matrix. KM-attempt: solve this 7 3 system! 3/37
76 What improvement gives our idea? 2 32/37
77 What improvement gives our idea? A G 3 : /37
78 What improvement gives our idea? A G 3 : Note: only those k-orbits with columns in A G k identical to a column of a TDM can be taken into further consideration - we have an additional necessary condition! Hence, eliminate the other k-orbits. 32/37 Plain KM A G KM + TD A G extra equations
79 Example Parameters 3-(8, 4, ) P = {,, 2, 3, 4, 5, 6, 7} G = h(,, 2, 3)(4, 5, 6, 7)} 2 33/37 J I
80 Example Parameters 3-(8, 4, ) P = {,, 2, 3, 4, 5, 6, 7} G = h(,, 2, 3)(4, 5, 6, 7)} Plain KM: a 4 2 linear system. 2 33/37 J I
81 Example Parameters 3-(8, 4, ) P = {,, 2, 3, 4, 5, 6, 7} G = h(,, 2, 3)(4, 5, 6, 7)} 2 Plain KM: a 4 2 linear system. KM + TD: the action of G on blocks is not given, hence you have to check all possibilities. Only two lead to TD matrices: Block orbits [2, 4, 4, 4] The system of size additional equations Solution exists! (Which one is that?) Block orbits [,, 2, 2, 4, 4] The system of size additional equations Solution exists! 33/37 J I
82 Example Parameters 2-(28, 4, ) P = {,, 2,..., 27} G = ρ = (,, 2, 3, 4, 5, 6)(7, 8, 9,,, 2, 3) (4, 5, 6, 7, 8, 9, 2)(2, 22, 23, 24, 25, 26, 27), σ = (, 6)(2, 5)(3, 4)(8, 3)(9, 2)(, ) (5, 2)(6, 9)(7, 8)(22, 27)(23, 26)(24, 25) So, I have chosen the dihedral group of order 4 to act on points in [7, 7, 7, 7]. 2 34/37
83 Example Parameters 2-(28, 4, ) P = {,, 2,..., 27} G = ρ = (,, 2, 3, 4, 5, 6)(7, 8, 9,,, 2, 3) (4, 5, 6, 7, 8, 9, 2)(2, 22, 23, 24, 25, 26, 27), σ = (, 6)(2, 5)(3, 4)(8, 3)(9, 2)(, ) (5, 2)(6, 9)(7, 8)(22, 27)(23, 26)(24, 25) So, I have chosen the dihedral group of order 4 to act on points in [7, 7, 7, 7]. Plain KM: a linear system. 2 34/37
84 Example Parameters 2-(28, 4, ) P = {,, 2,..., 27} G = ρ = (,, 2, 3, 4, 5, 6)(7, 8, 9,,, 2, 3) (4, 5, 6, 7, 8, 9, 2)(2, 22, 23, 24, 25, 26, 27), σ = (, 6)(2, 5)(3, 4)(8, 3)(9, 2)(, ) (5, 2)(6, 9)(7, 8)(22, 27)(23, 26)(24, 25) So, I have chosen the dihedral group of order 4 to act on points in [7, 7, 7, 7]. Plain KM: a linear system. KM + TD: the action of G on blocks can be different, but only in orbits of sizes 7 and 4 TD matrices exist only in 3 cases: Block orbits: [7, 7, 7, 7, 7, 4, 4] Number of TDM s: The system contradictory 2 34/37
85 Block orbits: [7, 7, 7, 7, 7, 7, 7, 4] Number of TDM s: 6 System sizes:,,,,, Solution exists! Block orbits: [7, 7, 7, 7, 7, 7, 7, 7, 7] Number of TDM s: 7 System sizes:,,, 45 36, 44 34, 45 36, Solution exists for TDM s no. 5 and 7! 2 35/37
86 Block orbits: [7, 7, 7, 7, 7, 7, 7, 4] Number of TDM s: 6 System sizes:,,,,, Solution exists! Block orbits: [7, 7, 7, 7, 7, 7, 7, 7, 7] Number of TDM s: 7 System sizes:,,, 45 36, 44 34, 45 36, Solution exists for TDM s no. 5 and 7! Comparison: Plain KM: linear system of size KM + TD: 5 linear systems of sizes: 44 97, 45 36, 44 34, 45 36, /37
87 Example Parameters 2-(65, 5, ) Choice of an automorphism group: the non-abelian group of order 39, acting on points in orbits of length [3, 3, 3, 3, 3]. 2 36/37
88 Example Parameters 2-(65, 5, ) Choice of an automorphism group: the non-abelian group of order 39, acting on points in orbits of length [3, 3, 3, 3, 3]. 2 Plain KM: I couldn t compute the KM-matrix in reasonable time! (Probably my fault, as it usually is the case...) 36/37
89 Example Parameters 2-(65, 5, ) Choice of an automorphism group: the non-abelian group of order 39, acting on points in orbits of length [3, 3, 3, 3, 3]. 2 Plain KM: I couldn t compute the KM-matrix in reasonable time! (Probably my fault, as it usually is the case...) KM + TD: the action of G on blocks can be different, but only in orbits of sizes 3 and 39. Here we shall take the usually hardest case - as many long orbits as possible. 36/37
90 Example Parameters 2-(65, 5, ) Choice of an automorphism group: the non-abelian group of order 39, acting on points in orbits of length [3, 3, 3, 3, 3]. 2 Plain KM: I couldn t compute the KM-matrix in reasonable time! (Probably my fault, as it usually is the case...) KM + TD: the action of G on blocks can be different, but only in orbits of sizes 3 and 39. Here we shall take the usually hardest case - as many long orbits as possible. Take the block orbits to be [3, 39, 39, 39, 39, 39]. Number of TDM s: System size: (How doable!?!) 36/37
91 Example Parameters 2-(65, 5, ) Choice of an automorphism group: the non-abelian group of order 39, acting on points in orbits of length [3, 3, 3, 3, 3]. 2 Plain KM: I couldn t compute the KM-matrix in reasonable time! (Probably my fault, as it usually is the case...) KM + TD: the action of G on blocks can be different, but only in orbits of sizes 3 and 39. Here we shall take the usually hardest case - as many long orbits as possible. Take the block orbits to be [3, 39, 39, 39, 39, 39]. Number of TDM s: System size: (How doable!?!) Solutions exist. There are 482 solution vectors as outcomes of the linear system solver. Only 263 designs are non-isomorphic. For 262 the group G of order 39 is the full automorphism group and in one case AutD = /37
92 Final comments 2 We use GAP as the background for all the computations. Hence, we have to add the limitations of GAP to our own limitations. 37/37
93 Final comments 2 We use GAP as the background for all the computations. Hence, we have to add the limitations of GAP to our own limitations. Even with limitations, I hope to be able to run something for you, if you give me a limited problem, at any time of this conference, or after it. 37/37
94 Final comments 2 We use GAP as the background for all the computations. Hence, we have to add the limitations of GAP to our own limitations. Even with limitations, I hope to be able to run something for you, if you give me a limited problem, at any time of this conference, or after it. Thank you very much for you attention! 37/37
Combinatorial Designs Man versus Machine
Combinatorial Designs Man versus Machine Anamari Nakić Department of Energy and Power Systems Faculty of Electrical Engineering and Computing University of Zagreb Zagreb 2015 1 / 47 The theory of combinatrial
More informationSOME NEW SYMMETRIC DESIGNS FOR (256,120,56)
GLASNIK MATEMATICKI Vol. 34(54)(1999),123-128 SOME NEW SYMMETRIC DESIGNS FOR (256,120,56) MARIO-OSVIN PAVCEVIC University of Zagreb, Croatia ABSTRACT. We prove the existence of two symmetric designs with
More informationSTEINER 2-DESIGNS S(2, 4, 28) WITH NONTRIVIAL AUTOMORPHISMS. Vedran Krčadinac Department of Mathematics, University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 37(57)(2002), 259 268 STEINER 2-DESIGNS S(2, 4, 28) WITH NONTRIVIAL AUTOMORPHISMS Vedran Krčadinac Department of Mathematics, University of Zagreb, Croatia Abstract. In this article
More informationCONSTRUCTION OF (SOMETIMES) OPTIMAL LINEAR CODES
CONSTRUCTION OF (SOMETIMES) OPTIMAL LINEAR CODES MICHAEL BRAUN, AXEL KOHNERT AND ALFRED WASSERMANN 1. INTRODUCTION For the purpose of error correcting linear codes over a finite field GF (q) and fixed
More informationOn some incidence structures constructed from groups and related codes
On some incidence structures constructed from groups and related codes Dean Crnković Department of Mathematics University of Rijeka Croatia Algebraic Combinatorics and Applications The first annual Kliakhandler
More informationFundamentals of Coding For Network Coding
Fundamentals of Coding For Network Coding Marcus Greferath and Angeles Vazquez-Castro Aalto University School of Sciences, Finland Autonomous University of Barcelona, Spain marcus.greferath@aalto.fi and
More informationSOME SYMMETRIC (47,23,11) DESIGNS. Dean Crnković and Sanja Rukavina Faculty of Philosophy, Rijeka, Croatia
GLASNIK MATEMATIČKI Vol. 38(58)(2003), 1 9 SOME SYMMETRIC (47,23,11) DESIGNS Dean Crnković and Sanja Rukavina Faculty of Philosophy, Rijeka, Croatia Abstract. Up to isomorphism there are precisely fifty-four
More informationTHE ORDER OF THE AUTOMORPHISM GROUP OF A BINARY q-analog OF THE FANO PLANE IS AT MOST TWO
THE ORDER OF THE AUTOMORPHISM GROUP OF A BINARY -ANALOG OF THE FANO PLANE IS AT MOST TWO MICHAEL KIERMAIER, SASCHA KURZ, AND ALFRED WASSERMANN Abstract. It is shown that the automorphism group of a binary
More informationDesigns over the binary field from the complete monomial group
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 67(3) (2017), Pages 470 475 Designs over the binary field from the complete monomial group Michael Braun Faculty of Computer Science University of Applied Sciences
More informationThe Simple 7-(33,8,10)-Designs with Automorphism Group PΓL(2,32)
The Simple 7-(33,8,10)-Designs with Automorphism Group PΓL(2,32) Alfred Wassermann Abstract Lattice basis reduction in combination with an efficient backtracking algorithm is used to find all (4 996 426)
More informationk-subsets of V: Finding a collection which forms a t-design is equivalent to the problem of solving a system of diophantine equations, as mentioned ab
Simple 6- and 7-designs on 19 to 33 points Anton Betten 1, Reinhard Laue, Alfred Wassermann Universitat Bayreuth, Lehrstuhl II fur Mathematik, Lehrstuhl fur Mathematik und ihre Didaktik, D-95440 Bayreuth
More informationSYMMETRIC (66,26,10) DESIGNS HAVING F rob 55 AUTOMORPHISM GROUP AS AN. Dean Crnković and Sanja Rukavina Faculty of Philosophy in Rijeka, Croatia
GLASNIK MATEMATIČKI Vol. 35(55)(2000), 271 281 SYMMETRIC (66,26,10) DESIGNS HAVING F rob 55 AUTOMORPHISM GROUP AS AN Dean Crnković and Sanja Rukavina Faculty of Philosophy in Rijeka, Croatia Abstract.
More informationIsomorphisms between pattern classes
Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationZero sum partition of Abelian groups into sets of the same order and its applications
Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,
More informationMathematical Department, University of Bayreuth, D Bayreuth
,, {6 () c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. A Steiner 5-Design on 36 Points ANTON BETTEN anton.betten@uni-bayreuth.de REINHARD LAUE reinhard.laue@uni-bayreuth.de ALFRED
More informationSome New Large Sets of Geometric Designs
Spyros S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, Florida, U.S.A. First annual Kliakhandler Conference Algebraic Combinatorics and Applications Houghton,
More informationAbstract. the aid of a computer. The smallest parameter set found is 7-(24; 8; 4): for determining the isomorphism types. Further designs are derived
Some simple 7-designs A. Betten R. Laue A. Wassermann Abstract Some simple 7-designs with small parameters are constructed with the aid of a computer. The smallest parameter set found is 7-(24; 8; 4):
More informationSelf-complementary strongly regular graphs revisited
Self-complementary strongly regular graphs revisited Ferenc Szöllősi (joint work in part with Patric Östergård) szoferi@gmail.com Department of Communications and Networking, Aalto University Talk at CoCoA15
More informationGROUPS OF ORDER p 3 KEITH CONRAD
GROUPS OF ORDER p 3 KEITH CONRAD For any prime p, we want to describe the groups of order p 3 up to isomorphism. From the cyclic decomposition of finite abelian groups, there are three abelian groups of
More informationSome notes on Coxeter groups
Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three
More informationNew arcs in projective Hjelmslev planes over Galois rings
New arcs in projective Hjelmslev planes over Galois rings Michael Kiermaier and Axel Kohnert ABSTRACT. It is known that some good linear codes over a finite ring (R-linear codes) arise from interesting
More informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More informationPermutation groups/1. 1 Automorphism groups, permutation groups, abstract
Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.
More informationQuiz 2 Practice Problems
Quiz 2 Practice Problems Math 332, Spring 2010 Isomorphisms and Automorphisms 1. Let C be the group of complex numbers under the operation of addition, and define a function ϕ: C C by ϕ(a + bi) = a bi.
More informationSymmetric bowtie decompositions of the complete graph
Symmetric bowtie decompositions of the complete graph Simona Bonvicini Dipartimento di Scienze e Metodi dell Ingegneria Via Amendola, Pad. Morselli, 4100 Reggio Emilia, Italy simona.bonvicini@unimore.it
More informationmake some group constructions. The resulting group is then prescribed as an automorphism group of the desired designs. Any such design is a collection
New t-designs and large sets of t-designs Anton Betten 1, Reinhard Laue, Alfred Wassermann Mathematical Department, University of Bayreuth, D-95440 Bayreuth, Germany Abstract Recent results in the search
More informationMA441: Algebraic Structures I. Lecture 26
MA441: Algebraic Structures I Lecture 26 10 December 2003 1 (page 179) Example 13: A 4 has no subgroup of order 6. BWOC, suppose H < A 4 has order 6. Then H A 4, since it has index 2. Thus A 4 /H has order
More informationUSING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS
USING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS JOSH ABBOTT AND TREVOR MCGUIRE Abstract. Let F 3 be the field with 3 elements and consider the k- dimensional affine space, F k 3, over F 3. A line of
More informationEXERCISE SHEET 2 WITH SOLUTIONS
EXERCISE SHEET 2 WITH SOLUTIONS Some solutions are sketches only. If you want more details, ask me! (E35) Show that, for any prime power q, PG 2 (q) is an abstract projective plane. Answer. If < u > and
More informationDUAL LINEAR SPACES GENERATED BY A NON-DESARGUESIAN CONFIGURATION
DUAL LINEAR SPACES GENERATED BY A NON-DESARGUESIAN CONFIGURATION J.B. NATION AND JIAJIA Y.G. SEFFROOD Abstract. We describe a method to try to construct non-desarguesian projective planes of a given finite
More information6 Cosets & Factor Groups
6 Cosets & Factor Groups The course becomes markedly more abstract at this point. Our primary goal is to break apart a group into subsets such that the set of subsets inherits a natural group structure.
More informationFINITE ABELIAN GROUPS Amin Witno
WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every
More information11 Block Designs. Linear Spaces. Designs. By convention, we shall
11 Block Designs Linear Spaces In this section we consider incidence structures I = (V, B, ). always let v = V and b = B. By convention, we shall Linear Space: We say that an incidence structure (V, B,
More informationAutomorphisms of strongly regular graphs and PDS in Abelian groups
Automorphisms of strongly regular graphs and PDS in Abelian groups Zeying Wang Department of Mathematical Sciences Michigan Technological University Joint work with Stefaan De Winter and Ellen Kamischke
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationBefore you begin read these instructions carefully.
MATHEMATICAL TRIPOS Part IA Tuesday, 4 June, 2013 1:30 pm to 4:30 pm PAPER 3 Before you begin read these instructions carefully. The examination paper is divided into two sections. Each question in Section
More information1 p mr. r, where p 1 < p 2 < < p r are primes, reduces then to the problem of finding, for i = 1,...,r, all possible partitions (p e 1
Theorem 2.9 (The Fundamental Theorem for finite abelian groups). Let G be a finite abelian group. G can be written as an internal direct sum of non-trival cyclic groups of prime power order. Furthermore
More informationMATH 251, Handout on Sylow, Direct Products, and Finite Abelian Groups
MATH 251, Handout on Sylow, Direct Products, and Finite Abelian Groups 1. Let G be a group with 56 elements. Show that G always has a normal subgroup. Solution: Our candidates for normal subgroup are the
More informationNormal Subgroups and Quotient Groups
Normal Subgroups and Quotient Groups 3-20-2014 A subgroup H < G is normal if ghg 1 H for all g G. Notation: H G. Every subgroup of an abelian group is normal. Every subgroup of index 2 is normal. If H
More informationCombining the cycle index and the Tutte polynomial?
Combining the cycle index and the Tutte polynomial? Peter J. Cameron University of St Andrews Combinatorics Seminar University of Vienna 23 March 2017 Selections Students often meet the following table
More informationCZ-GROUPS. Kristijan Tabak and Mario Osvin Pavčević Rochester Institute of Technology and University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 51(71)(2016), 345 358 CZ-GROUPS Kristijan Tabak and Mario Osvin Pavčević Rochester Institute of Technology and University of Zagreb, Croatia Abstract. We describe some aspects
More informationSOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM
More informationLarge sets of t designs from groups
Large sets of t designs from groups Spyros S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, Florida 33431-0991 Dedicated to Alex Rosa on the occasion of his 70th
More informationx y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2
5. Finitely Generated Modules over a PID We want to give a complete classification of finitely generated modules over a PID. ecall that a finitely generated module is a quotient of n, a free module. Let
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationLecture 7: Semidefinite programming
CS 766/QIC 820 Theory of Quantum Information (Fall 2011) Lecture 7: Semidefinite programming This lecture is on semidefinite programming, which is a powerful technique from both an analytic and computational
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationChapter 3. Introducing Groups
Chapter 3 Introducing Groups We need a super-mathematics in which the operations are as unknown as the quantities they operate on, and a super-mathematician who does not know what he is doing when he performs
More informationLecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG)
Lecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG) Warm up: 1. Let n 1500. Find all sequences n 1 n 2... n s 2 satisfying n i 1 and n 1 n s n (where s can vary from sequence to
More informationTutorial on Groups of finite Morley rank
Tutorial on Groups of finite Morley rank adeloro@math.rutgers.edu Manchester, 14-18 July 2008 First tutorial Groups of finite Morley rank first arose in a very model-theoretic context, the study of ℵ 1
More informationTHE TRANSITIVE AND CO TRANSITIVE BLOCKING SETS IN P 2 (F q )
Volume 3, Number 1, Pages 47 51 ISSN 1715-0868 THE TRANSITIVE AND CO TRANSITIVE BLOCKING SETS IN P 2 (F q ) ANTONIO COSSIDENTE AND MARIALUISA J. DE RESMINI Dedicated to the centenary of the birth of Ferenc
More informationCS 468: Computational Topology Group Theory Fall b c b a b a c b a c b c c b a
Q: What s purple and commutes? A: An abelian grape! Anonymous Group Theory Last lecture, we learned about a combinatorial method for characterizing spaces: using simplicial complexes as triangulations
More informationTables of elliptic curves over number fields
Tables of elliptic curves over number fields John Cremona University of Warwick 10 March 2014 Overview 1 Why make tables? What is a table? 2 Simple enumeration 3 Using modularity 4 Curves with prescribed
More informationMath 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I.
Math 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I. 24. We basically know already that groups of order p 2 are abelian. Indeed, p-groups have non-trivial
More informationOn star forest ascending subgraph decomposition
On star forest ascending subgraph decomposition Josep M. Aroca and Anna Lladó Department of Mathematics, Univ. Politècnica de Catalunya Barcelona, Spain josep.m.aroca@upc.edu,aina.llado@upc.edu Submitted:
More informationTHE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p. Mario Huicochea CINNMA, Querétaro, México
#A8 INTEGERS 15A (2015) THE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p Mario Huicochea CINNMA, Querétaro, México dym@cimat.mx Amanda Montejano UNAM Facultad de Ciencias
More informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin University of Queensland 5 November 2012 Outline 1 Hadamard matrices 2 Symmetric designs 3 Hadamard matrices and difference sets 4 Two-transitivity
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationGalois Groups of CM Fields in Degrees 24, 28, and 30
Lehigh University Lehigh Preserve Theses and Dissertations 2017 Galois Groups of CM Fields in Degrees 24, 28, and 30 Alexander P. Borselli Lehigh University Follow this and additional works at: http://preserve.lehigh.edu/etd
More informationClassifying classes of structures in model theory
Classifying classes of structures in model theory Saharon Shelah The Hebrew University of Jerusalem, Israel, and Rutgers University, NJ, USA ECM 2012 Saharon Shelah (HUJI and Rutgers) Classifying classes
More informationProbabilistic construction of t-designs over finite fields
Probabilistic construction of t-designs over finite fields Shachar Lovett (UCSD) Based on joint works with Arman Fazeli (UCSD), Greg Kuperberg (UC Davis), Ron Peled (Tel Aviv) and Alex Vardy (UCSD) Gent
More informationClass Equation & Conjugacy in Groups
Subject: ALEBRA - V Lesson: Class Equation & Conjugacy in roups Lesson Developer: Shweta andhi Department / College: Department of Mathematics, Miranda House, University of Delhi Institute of Lifelong
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on
More information9. Finite fields. 1. Uniqueness
9. Finite fields 9.1 Uniqueness 9.2 Frobenius automorphisms 9.3 Counting irreducibles 1. Uniqueness Among other things, the following result justifies speaking of the field with p n elements (for prime
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationHadamard matrices, difference sets and doubly transitive permutation groups
Hadamard matrices, difference sets and doubly transitive permutation groups Padraig Ó Catháin University of Queensland 13 November 2012 Outline 1 Hadamard matrices 2 Symmetric designs 3 Hadamard matrices
More informationMath 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9
Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Section 0. Sets and Relations Subset of a set, B A, B A (Definition 0.1). Cartesian product of sets A B ( Defintion 0.4). Relation (Defintion 0.7). Function,
More informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
More informationEnumeration of MOLS of small order
Enumeration of MOLS of small order arxiv:1406.3681v2 [math.co] 13 Oct 2014 Judith Egan and Ian M. Wanless School of Mathematical Sciences Monash University VIC 3800 Australia {judith.egan, ian.wanless}@monash.edu
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationENTRY GROUP THEORY. [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld.
ENTRY GROUP THEORY [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld Group theory [Group theory] is studies algebraic objects called groups.
More informationStab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1.
1. Group Theory II In this section we consider groups operating on sets. This is not particularly new. For example, the permutation group S n acts on the subset N n = {1, 2,...,n} of N. Also the group
More informationElliptic Curves Spring 2013 Problem Set #5 Due: 03/19/2013
18.783 Elliptic Curves Spring 2013 Problem Set #5 Due: 03/19/2013 Description These problems are related to the material covered in Lectures 9-10. As usual the first person to spot each non-trivial typo/error
More informationOn the table of marks of a direct product of finite groups
Provided by the author(s) and NUI Galway in accordance with publisher policies. Please cite the published version when available. Title On the table of marks of a direct product of finite groups Author(s)
More informationHow to count - an exposition of Polya s theory of enumeration
How to count - an exposition of Polya s theory of enumeration Shriya Anand Published in Resonance, September 2002 P.19-35. Shriya Anand is a BA Honours Mathematics III year student from St. Stephens College,
More informationBASIC GROUP THEORY : G G G,
BASIC GROUP THEORY 18.904 1. Definitions Definition 1.1. A group (G, ) is a set G with a binary operation : G G G, and a unit e G, possessing the following properties. (1) Unital: for g G, we have g e
More informationPrimitive 2-factorizations of the complete graph
Discrete Mathematics 308 (2008) 175 179 www.elsevier.com/locate/disc Primitive 2-factorizations of the complete graph Giuseppe Mazzuoccolo,1 Dipartimento di Matematica, Università di Modena e Reggio Emilia,
More informationOn designs and Steiner systems over finite fields
On designs and Steiner systems over finite fields Alfred Wassermann Department of Mathematics, Universität Bayreuth, Germany Special Days on Combinatorial Construction Using Finite Fields, Linz 2013 Outline
More informationFinite geometry codes, generalized Hadamard matrices, and Hamada and Assmus conjectures p. 1/2
Finite geometry codes, generalized Hadamard matrices, and Hamada and Assmus conjectures Vladimir D. Tonchev a Department of Mathematical Sciences Michigan Technological University Houghton, Michigan 49931,
More informationComputational aspects of finite p-groups
Computational aspects of finite p-groups Heiko Dietrich School of Mathematical Sciences Monash University Clayton VIC 3800, Australia 5th 14th November 2016 International Centre for Theoretical Sciences
More informationQUIVERS AND LATTICES.
QUIVERS AND LATTICES. KEVIN MCGERTY We will discuss two classification results in quite different areas which turn out to have the same answer. This note is an slightly expanded version of the talk given
More informationCommutative nilpotent rings and Hopf Galois structures
Commutative nilpotent rings and Hopf Galois structures Lindsay Childs Exeter, June, 2015 Lindsay Childs Commutative nilpotent rings and Hopf Galois structures Exeter, June, 2015 1 / 1 Hopf Galois structures
More informationFundamental Theorem of Finite Abelian Groups
Monica Agana Boise State University September 1, 2015 Theorem (Fundamental Theorem of Finite Abelian Groups) Every finite Abelian group is a direct product of cyclic groups of prime-power order. The number
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin National University of Ireland, Galway 14 March 2012 Outline 1 (Finite) Projective planes 2 Symmetric Designs 3 Difference sets 4 Doubly transitive
More informationCounting Colorings Cleverly
Counting Colorings Cleverly by Zev Chonoles How many ways are there to color a shape? Of course, the answer depends on the number of colors we re allowed to use. More fundamentally, the answer depends
More informationCentralizers of Finite Subgroups in Simple Locally Finite Groups
Centralizers of Finite Subgroups in Simple Locally Finite Groups Kıvanc. Ersoy 1 Simple Locally Finite Groups A group G is called locally finite if every finitely generated subgroup of G is finite. In
More informationMath 4377/6308 Advanced Linear Algebra
1.3 Subspaces Math 4377/6308 Advanced Linear Algebra 1.3 Subspaces Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377 Jiwen He, University of Houston
More informationA Dynamic Programming Approach to Counting Hamiltonian Cycles in Bipartite Graphs
A Dynamic Programming Approach to Counting Hamiltonian Cycles in Bipartite Graphs Patric R. J. Östergård Department of Communications and Networking Aalto University School of Electrical Engineering P.O.
More informationAlgebraic aspects of Hadamard matrices
Algebraic aspects of Hadamard matrices Padraig Ó Catháin University of Queensland 22 February 2013 Overview Difference set Relative difference set Symmetric Design Hadamard matrix Overview 1 Hadamard matrices
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More informationSection I.6. Symmetric, Alternating, and Dihedral Groups
I.6. Symmetric, alternating, and Dihedral Groups 1 Section I.6. Symmetric, Alternating, and Dihedral Groups Note. In this section, we conclude our survey of the group theoretic topics which are covered
More informationLecture 4: Orbits. Rajat Mittal. IIT Kanpur
Lecture 4: Orbits Rajat Mittal IIT Kanpur In the beginning of the course we asked a question. How many different necklaces can we form using 2 black beads and 10 white beads? In the question, the numbers
More informationLectures - XXIII and XXIV Coproducts and Pushouts
Lectures - XXIII and XXIV Coproducts and Pushouts We now discuss further categorical constructions that are essential for the formulation of the Seifert Van Kampen theorem. We first discuss the notion
More informationEnumerative Combinatorics 7: Group actions
Enumerative Combinatorics 7: Group actions Peter J. Cameron Autumn 2013 How many ways can you colour the faces of a cube with three colours? Clearly the answer is 3 6 = 729. But what if we regard two colourings
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei
More informationWe begin with some definitions which apply to sets in general, not just groups.
Chapter 8 Cosets In this chapter, we develop new tools which will allow us to extend to every finite group some of the results we already know for cyclic groups. More specifically, we will be able to generalize
More informationSteiner triple and quadruple systems of low 2-rank
Steiner triple and quadruple systems of low 2-rank Vladimir D. Tonchev Department of Mathematical Sciences Michigan Technological University Houghton, MI 49931, USA tonchev@mtu.edu, www.math.mtu.edu/ tonchev
More information