CONSTRUCTION OF SIMPLE 3-DESIGNS USING RESOLUTION
|
|
- Chastity Horton
- 6 years ago
- Views:
Transcription
1 CONSTRUCTION OF SIMPLE 3-DESIGNS USING RESOLUTION Tran van Trung Institut für Experimentelle Mathematik Universität Duisburg-Essen ALCOMA15 Kloster Banz, Germany March 15 20, 2015
2 OUTLINE Generic constructions Applications (1, σ)-resolvable 3-designs
3 Definition A t (v, k, λ)-design (X, B) is said to be (s, σ)-resolvable if its block set B can be partitioned into w classes π 1,..., π w such that (X, π i ) is a s (v, k, σ) design for all i = 1,..., w, where 1 s t. Each π i is called a resolution class
4 Definition A t (v, k, λ)-design (X, B) is said to be (s, σ)-resolvable if its block set B can be partitioned into w classes π 1,..., π w such that (X, π i ) is a s (v, k, σ) design for all i = 1,..., w, where 1 s t. Each π i is called a resolution class Definition Let D be a t (v, k, λ) design (D may have repeated blocks) admitting a (s, σ)-resolution with π 1,..., π w as resolution classes. Define a distance between any two classes π i and π j by d(π i, π j ) = min{ i j, w i j }.
5 n 1, integer. {k 1,..., k n, k n+1,..., k 2n } and k, integers, such that 2 k 1 <... < k n < k/2 and k i + k n+i = k for i = 1,..., n.
6 n 1, integer. {k 1,..., k n, k n+1,..., k 2n } and k, integers, such that 2 k 1 <... < k n < k/2 and k i + k n+i = k for i = 1,..., n. Assume there exist 2n 3-designs D i = (X, B i ) with parameters 3 (v, k i, λ (i) ) having a (1, σ (i) )-resolution such that w i = w n+i for all i = 1,..., n, where w j is the number of (1, σ (j) )-resolution classes of D j.
7 n 1, integer. {k 1,..., k n, k n+1,..., k 2n } and k, integers, such that 2 k 1 <... < k n < k/2 and k i + k n+i = k for i = 1,..., n. Assume there exist 2n 3-designs D i = (X, B i ) with parameters 3 (v, k i, λ (i) ) having a (1, σ (i) )-resolution such that w i = w n+i for all i = 1,..., n, where w j is the number of (1, σ (j) )-resolution classes of D j. Also assume that 1 For each pair (D i, D n+i ), 1 i n, either D i or D n+i has to be simple.
8 n 1, integer. {k 1,..., k n, k n+1,..., k 2n } and k, integers, such that 2 k 1 <... < k n < k/2 and k i + k n+i = k for i = 1,..., n. Assume there exist 2n 3-designs D i = (X, B i ) with parameters 3 (v, k i, λ (i) ) having a (1, σ (i) )-resolution such that w i = w n+i for all i = 1,..., n, where w j is the number of (1, σ (j) )-resolution classes of D j. Also assume that 1 For each pair (D i, D n+i ), 1 i n, either D i or D n+i has to be simple. 2 If a D j, j {i, n + i}, is not simple, then D j is a union of a j copies of a simple 3 (v, k j, α (j) ) design C j, wherein C j admits a (1, σ (j) )-resolution. Thus, λ (j) = a j α (j).
9 If D j is not simple, (i.e. D j is a union of a j copies of a simple 3 (v, k j, α (j) ) design C j, where P (j) = {π (j) 1,..., π(j) t } j is a (1, σ (j) )-resolution of C j ), then the corresponding (1, σ (j) )-resolution of D j is the concatenation of a j sets P (j). So, the w j = a j t j resolution classes of D j are of the form π (j) 1,..., π(j) t j, π (j) 1,..., π(j) t j,..., π (j) 1,..., π(j) t j
10 If D j is not simple, (i.e. D j is a union of a j copies of a simple 3 (v, k j, α (j) ) design C j, where P (j) = {π (j) 1,..., π(j) t } j is a (1, σ (j) )-resolution of C j ), then the corresponding (1, σ (j) )-resolution of D j is the concatenation of a j sets P (j). So, the w j = a j t j resolution classes of D j are of the form π (j) 1,..., π(j) t j, π (j) 1,..., π(j) t j,..., π (j) 1,..., π(j) t j If k 1 = 2, then D 1 is a union of a 1 copies of the trivial 2 (v, 2, 1) design i.e. D 1 is considered as a 3-design with λ (1) = 0.
11 If D j is not simple, (i.e. D j is a union of a j copies of a simple 3 (v, k j, α (j) ) design C j, where P (j) = {π (j) 1,..., π(j) t } j is a (1, σ (j) )-resolution of C j ), then the corresponding (1, σ (j) )-resolution of D j is the concatenation of a j sets P (j). So, the w j = a j t j resolution classes of D j are of the form π (j) 1,..., π(j) t j, π (j) 1,..., π(j) t j,..., π (j) 1,..., π(j) t j If k 1 = 2, then D 1 is a union of a 1 copies of the trivial 2 (v, 2, 1) design i.e. D 1 is considered as a 3-design with λ (1) = 0. If necessary, also assume that there exists a 3 (v, k, Λ) design D = (X, B).
12 Notation: π (l) 1,..., π(l) w l : the w l classes in a (1, σ (l) )-resolution of D l, l = 1,..., 2n. Recall that w n+h = w h. The distance defined on the classes of D l is then d (l) (π (l), π (l) ) = min{ i j, w i j l i j }. b (j) = σ (j) v/k : the number of blocks in each resolution class of of D j. u j = σ (j) : the number of blocks containing a point in each resolution class of of D j. λ (j) 2 = λ(j) (v 2)/(k j 2) : the number of blocks of D j containing two points.
13 Construction I Let D i = ( X, B i ) be a copy of D i defined on X such that X X =. Also let D = ( X, B) be a copy of D. Define blocks on the point set X X as follows: I. blocks of D and blocks of D; II. blocks of the form A B for any pair A π (h) and i B π (n+h) with ε j h d (h) (π (h), π (h) ) s i j h, ε h = 0, 1, for h = 1,..., n; III. blocks of the form à B for any pair à π(h) and i B π (n+h) with ε j h d (h) (π (h), π (h) ) s i j h, ε h = 0, 1, for h = 1,..., n. Denote z h := (2s h + 1 ε h ) for h = 1,..., n.
14 Verification: CASE k i 3 The blocks containing points a, b, c X (resp. ã, b, c X): Λ + n z h λ (h) b (n+h) + z h λ (n+h) b (h) h=1 The blocks containing points a, b, c with a, b X and c, X (resp. ã, b, c): n z h λ (h) 2 u n+h + z h λ (n+h) 2 u h h=1 The defined blocks will form a 3-design if Λ + n z h λ (h) b (n+h) + z h λ (n+h) b (h) = h=1 equivalently n h=1 z h λ (h) 2 u n+h + z h λ (n+h) 2 u h, n Λ = {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h. h=1
15 Verification: CASE K 1 = 2 The condition for which the defined blocks form a 3-designs becomes Λ = {a 1 u n+1 + λ (n+1) 2 u 1 λ (n+1) b (1) }z 1 n + {(λ (h) 2 u n+h + λ(n+h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h. h=2
16 Summary of Construction I (i) If k 1 = 2 and 0 = {a 1 u n+1 + λ (n+1) 2 u 1 λ (n+1) b (1) }z 1 n + {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h,(1) h=2 with 1 z h w h if both D h and D n+h are simple and 1 z h t h if D h or D n+h is non-simple, then there exists a 3 (2v, k, Θ) design with n Θ = {a 1 u n+1 + λ (n+1) 2 u 1 }z 1 + {(λ (h) 2 u h )}z h. h=2 (ii) If k 1 3 and n 0 = {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h, (2) h=1 with 1 z h w h if both D h and D n+h are simple and 1 z h t h if D h or D n+h is non-simple, then there exists a 3 (2v, k, Θ) design with n Θ = {(λ (h) 2 u h )}z h. h=1
17 Summary of Construction I (Cont.) (iii) If k 1 = 2 and 0 < {a 1 u n+1 + λ (n+1) 2 u 1 λ (n+1) b (1) }z 1 n + {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h,(3) h=2 with 1 z h w h if both D h and D n+h are simple and 1 z h t h if D h or D n+h is non-simple, further if there is a 3 (v, k, Λ) design having Λ = {a 1 u n+1 + λ (n+1) 2 u 1 λ (n+1) b (1) }z 1 n + {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h,(4) h=2 then there exists a 3 (2v, k, Θ) design with n Θ = {a 1 u n+1 + λ (n+1) 2 u 1 }z 1 + {(λ (h) 2 u h )}z h. h=2
18 Summary of Construction I (Cont.) (iv) If k 1 3 and 0 < n {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h, (5) h=1 with 1 z h w h if both D h and D n+h are simple and 1 z h t h if D h or D n+h is non-simple, further if there is a 3 (v, k, Λ) design having Λ = n {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h, (6) h=1 then there exists a 3 (2v, k, Θ) design with n Θ = {(λ (h) 2 u h )}z h. h=1
19 Construction II Construction II deals with the case k n = k/2. Take D n = D 2n. Blocks of types I, II, and III are as in Construction I for h = 1,..., n 1. Define a further type of blocks. IV. blocks of the form A B for any pair A π (n) i with ε n d (n) (π (n), π (n) ) s i j n, ε n = 0, 1. and B π (2n) j
20 Summary of Construction II (i) If k 1 = 2 and 0 = (a 1 u n+1 + λ (n+1) 2 u 1 λ (n+1) b (1) )z 1 + (λ (n) 2 u n λ (n) b (n) )z n n 1 + {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h,(7) h=2 with 1 z h w h if both D h and D n+h are simple and 1 z h t h if D h or D n+h is non-simple, then there exists a 3 (2v, k, Θ) design with Θ = (a 1 u n+1 + λ (n+1) 2 u 1 )z 1 + (λ (n) n 1 2 u n)z n + {(λ (h) 2 u h )}z h. h=2 (ii) If k 1 3 and 0 = (λ (n) 2 u n λ (n) b (n) )z n n 1 + {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h,(8) h=1 with 1 z h w h if both D h and D n+h are simple and 1 z h t h if D h or D n+h is non-simple, then there exists a 3 (2v, k, Θ) design with Θ = (λ (n) n 1 2 u n)z n + {(λ (h) 2 u h )}z h. h=1
21 Summary of Construction II (Cont.) (iii) If k 1 = 2 and 0 < (a 1 u n+1 + λ (n+1) 2 u 1 λ (n+1) b (1) )z 1 + (λ (n) 2 u n λ (n) b (n) )z n n 1 + {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h,(9) h=2 with 1 z h w h if both D h and D n+h are simple and 1 z h t h if D h or D n+h is non-simple, further if there is a 3 (v, k, Λ) design having Λ = (a 1 u n+1 + λ (n+1) 2 u 1 λ (n+1) b (1) )z 1 + (λ (n) 2 u n λ (n) b (n) )z n n 1 + {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h (10), h=2 then there exists a 3 (2v, k, Θ) design with Θ = (a 1 u n+1 + λ (n+1) 2 u 1 )z 1 + (λ (n) n 1 2 u n)z n + {(λ (h) 2 u h )}z h. h=2
22 Summary of Construction II (Cont.) (iv) If k 1 3 and 0 < (λ (n) 2 u n λ (n) b (n) )z n n 1 + {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h (11), h=1 with 1 z h w h if both D h and D n+h are simple and 1 z h t h if D h or D n+h is non-simple, further if there is a 3 (v, k, Λ) design having Λ = (λ (n) 2 u n λ (n) b (n) )z n n 1 + {(λ (h) 2 u h ) (λ (h) b (n+h) + λ (n+h) b (h) )}z h (12), h=1 then there exists a 3 (2v, k, Θ) design with Θ = (λ (n) n 1 2 u n)z n + {(λ (h) 2 u h )}z h. h=1
23 APPLICATIONS For applications of Constructions I and II we implicitly use the following result and observation. Baranyai-Theorem The trivial k (v, k, 1) design is (1,1)-resolvable (i.e. having a parallelism) if and only if k v. Block orbits If gcd(v, k) = 1, then the k (v, k, 1) design is (1, v)-resolvable. (The resolvable classes are the block orbits of a fixed point free automorphism of order v.)
24 APPLICATIONS F1 Construction II with n = 1. v, k : integers with v > k 3 and gcd(v, k) = 1. D 1 : the complete design 3 (v, k, ( v 3) k 3 ). Then λ (1) = ( v 3) (1) k 3, λ 2 = ( v 2 k 2), u1 = k, b (1) = v, and w 1 = ( v 1 k 1) /k. D: 3 (v, 2k, Λ). Construction II yields a simple 3-design 3 (2v, 2k, Θ) when it holds or (λ (1) 2 u 1 λ (1) b (1) )z 1 = Λ, with z 1 ( v 1 k 1) /k. Then ( ) v 3 z 1 = Λ/2 k 2 is an integer, Θ = λ (1) 2 u k(v 2)Λ 1z 1 = 2(v k).
25 APPLICATIONS F1 (Cont.) Take the complete design D: 3 (v, 2k, Λ) := 3 (v, 2k, ( v 3 2k 3) ). If ( ) ( ) v 3 v 3 z 1 = /2 2k 3 k 2 is an integer, with z 1 ( v 1 k 1) /k. Then there is a simple 3 (2v, 2k, Θ) design with ( ) k(v 2) v 3 Θ =. 2(v k) 2k 3
26 APPLICATIONS F1 Some special cases: k = 3, 4, 5. 1 There exists a simple 3 (2v, 6, Θ) design with ( ) 3(v 2) v 3 Θ =, 2(v 3) 3 for v 1, 4, 5, 8 mod There exists a simple 3 (2v, 8, Θ) design with ( ) 4(v 2) v 3 Θ =, 2(v 4) 5 for v 1, 5, 7, 11, 15, 17 mod There exists a simple 3 (2v, 10, Θ) design with ( ) 5(v 2) v 3 Θ =, 2(v 5) 7 for v 0, 1, 2, 6 mod 7, and v 0, 1, 6, 7 mod 8, and gcd(v, 5) = 1.
27 APPLICATIONS F2 Construction II with n = 2, k 1 = 2. v, k : integers with v > 2k, k 3, gcd(v, 2k) = 1 & gcd(v, k + 1) = 1. C 1 : 2 (v, 2, 1); α (1) = 0, α (1) 2 = 1, u 1 = 2, b (1) = v, t 1 = (v 1)/2, ( 1 a 1 = v 2 k(2k 1) 2k 2). D1 is a union of a 1 copies of C 1. D 3 : 2 (v, 2k, ( v 3 ) 2k 3 ); λ (3) = ( v 3 ) (3) 2k 3, λ 2 = ( v 2 2k 2), u3 = 2k, b (3) = v, w 3 = 1 ( v 1 2k 2k 1). D 2 : 2 (v, k + 1, ( v 3) k 2 ); λ (2) = ( v 3) (2) k 2, λ 2 = ( v 2 k 1), u2 = k + 1, b (2) = v, w 2 = 1 ( v 1 ) k+1 k.
28 APPLICATIONS F2 (Cont.) Set A := A 1 z 1 + A 2 z 2, where A 1 = (a 1 u 3 + λ (3) 2 u 1 λ (3) b (1) ), A 2 = (λ (2) 2 u 2 λ (2) b (2) ). Then ( ) v 3 v(4k 2 10k + 2) + 8k A 1 =, 2k 3 (2k 1)(2k 2) ( ) v 3 (v k 1) A 2 = 2. k 2 (k 1) For any integer z 1 with 1 z 1 w 1 we have A = 0 iff z 2 = A 1 z 1 /A 2 If z 2 is an integer with z 2 w 2,then there is a simple 3 (2v, 2(k + 1), Θ) design with ( ( ) ( )) ( ) 2k v 2 v 2 v 2 Θ = + 2 z k(2k 1) 2k 2 2k z k 1 2.
29 APPLICATIONS F2 (Cont.) An example: z 1 = 1. Then ( ) v k 2 z 2 = k k! 2.k(k + 1)... (2k 3) v(4k 2 10k + 2) + 8k. (2k 1)(2k 2) If z 2 is an integer and z 2 w 2, then there is a simple 3 (2v, 2(k + 1), Θ) design with ( ) ( ) 4k v 2 v 2 Θ = + (k + 1).z (2k 1) 2k 2 k 1 2.
30 APPLICATIONS F2 (Cont.) Two special cases: k = 3, 4 with z 1 = 1. 1 There exists a simple 3 (2v, 8, Θ) design with for all v 5, 17, 35, 47 mod 60. Θ = 7 v(v 2)(v 3)(v 5), 30 2 There exists a simple 3 (2v, 10, Θ) design with ( ) v 2 Θ = 81v /7(v 5), 6 for all v 7, 23, 63, 111, 167, 191, 223, 231, 247 mod 280.
31 APPLICATIONS F3 Some more examples 1 There exists a simple 3 (2v, 5, 3 4 (v 2)(v 3)) design when v 2 mod 6. 2 There exists a simple 3 (2v, 7, 48 5 ( v 2 ) 3 (11v 52)) design for all v 4, 76, 112, 148 mod There exists a simple 3 (2(2 f + 1), 5, 15(2 f 1) design for f odd. 4 There exists a simple 3 (2(2 f + 1), 6, (2 f 1).m) design with m = 5, 30, 35, 45, 50, 75, 80 and gcd(f, 6) = 1.
32 (1, σ)-resolvability For each pair (D i, D n+i ) define σ (i) = u i b (n+i) + u n+i b (i). For the pair (D n, D n ) in Construction II define σ (n) = u n b (n). Let m 1,..., m n be integers such that m i σ (i) = m j σ (j) := σ for i, j = 1,..., n. If a 3 (v, 2k, Λ) design D is required in the construction, it is assumed that D is (1, σ)-resolvable. Assume that the blocks constructed by using each pair (D i, D n+i ) can be partitioned into 1 (v, 2k, σ) designs. Then the designs obtained from Constructions I and II are (1, σ)-resolvable.
33 (1, σ)-resolvability Some examples The 3 (2v, 6, 1 4 (v 2)(v 4)(v 5)) designs in F1 are (1, 3v)-resolvable when v 1, 4, 5, 13, 20, 28, 29, 32 mod 36. The 3 (2v, 8, Θ) designs with Θ = 30 7 v(v 2)(v 3)(v 5), and v 5, 17, 35, 47 mod 60 in F2 are (1, 8v)-resolvable. The 3 (2v, 10, Θ) designs with Θ = 81v ( v 2) 6 /7(v 5), and v 7, 23, 63, 111, 167, 191, 223, 231, 247 mod 280 in F2 are (1, 10v)-resolvable, when 16 (v 7). The 3 (2v, 5, 3 4 (v 2)(v 4)) designs in F3 are (1, 5v)-resolvable, when v 2, 26, 104, 128 mod 150.
34 References Zs. Baranyai. On the factorization of the complete uniform hypergraph. In Proc. Erdös Colloquium, Keszthely, 1973, North-Holland, Amstersdam (1975), J. Bierbrauer. Some friends of Alltop s designs 4 (2 f + 1, 5, 5). J. Combin. Math. Combin. Comput. 36 (2001) J. Bierbrauer, TvT. Shadow and shade of designs 4 (2 f + 1, 6, 10) (1992) unpublished manuscript. M. Jimbo, Y. Kunihara, R. Laue, M. Sawa. Unifying some known infinite families of combinatorial 3-designs. J. Combin. Theory, Ser.A 118 (2011) R. Laue. Resolvable t-designs. Des. Codes Cryptogr. 32 (2004) TvT. Recursive constructions for 3-designs and resolvable 3-designs, J. Statist. Plann. Inference 95 (2001), TvT. Construction of 3-designs using parallelism, J. Geom. 67 (2000)
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L
More informationSquare 2-designs/1. 1 Definition
Square 2-designs Square 2-designs are variously known as symmetric designs, symmetric BIBDs, and projective designs. The definition does not imply any symmetry of the design, and the term projective designs,
More informationRoux-type Constructions for Covering Arrays of Strengths Three
Roux-type Constructions for Covering Arrays of Strengths Three and Four Charles J. Colbourn Computer Science and Engineering Arizona State University P.O. Box 878809, Tempe, AZ 85287, U.S.A. charles.colbourn@asu.edu
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 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 informationLinear independence, a unifying approach to shadow theorems
Linear independence, a unifying approach to shadow theorems by Peter Frankl, Rényi Institute, Budapest, Hungary Abstract The intersection shadow theorem of Katona is an important tool in extremal set theory.
More informationOn the security of a realization of cryptosystem MST 3
On the security of a realization of cryptosystem MST 3 Spyros S. Magliveras Department of Mathematical Sciences Center for Cryptology and Information Security Florida Atlantic University Boca Raton, FL
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 informationNew infinite families of Candelabra Systems with block size 6 and stem size 2
New infinite families of Candelabra Systems with block size 6 and stem size 2 Niranjan Balachandran Department of Mathematics The Ohio State University Columbus OH USA 4210 email:niranj@math.ohio-state.edu
More informationLarge Forbidden Configurations and Design Theory
Large Forbidden Configurations and Design Theory R.P. Anstee Mathematics Department The University of British Columbia Vancouver, B.C. Canada V6T 1Z2 Attila Sali Rényi Institute Budapest, Hungary September
More informationG-invariantly resolvable Steiner 2-designs which are 1-rotational over G
G-invariantly resolvable Steiner 2-designs which are 1-rotational over G Marco Buratti Fulvio Zuanni Abstract A 1-rotational (G, N, k, 1) difference family is a set of k-subsets (base blocks) of an additive
More informationProof of a Conjecture of Erdős on triangles in set-systems
Proof of a Conjecture of Erdős on triangles in set-systems Dhruv Mubayi Jacques Verstraëte November 11, 005 Abstract A triangle is a family of three sets A, B, C such that A B, B C, C A are each nonempty,
More informationSimple 3-(q + 1, 5, 3) designs admitting an automorphism group PSL(2, q) with q 1 (mod 4)
Simple -(q + 5 ) designs admitting an automorphism group PSL( q) with q (mod 4) Weixia Li School of Mathematical Sciences Qingdao University Qingdao 667 China Dameng Deng Department of Mathematics Shanghai
More informationColoring k-trees with forbidden monochrome or rainbow triangles
Coloring k-trees with forbidden monochrome or rainbow triangles Julian Allagan & Vitaly Voloshin Department of Mathematics, University of North Georgia, Watkinsville, Georgia email: julian.allagan@ung.edu
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationAN IMPROVED ERROR TERM FOR MINIMUM H-DECOMPOSITIONS OF GRAPHS. 1. Introduction We study edge decompositions of a graph G into disjoint copies of
AN IMPROVED ERROR TERM FOR MINIMUM H-DECOMPOSITIONS OF GRAPHS PETER ALLEN*, JULIA BÖTTCHER*, AND YURY PERSON Abstract. We consider partitions of the edge set of a graph G into copies of a fixed graph H
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 informationCIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 4, No. 4, pp. 643-660, December 2000 CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS Xuding Zhu Abstract. This paper proves that for any integer n 4 and any rational number
More informationTRIANGULAR NORMS WITH CONTINUOUS DIAGONALS
Tatra Mt. Math. Publ. 6 (999), 87 95 TRIANGULAR NORMS WITH CONTINUOUS DIAGONALS Josef Tkadlec ABSTRACT. It is an old open question whether a t-norm with a continuous diagonal must be continuous [7]. We
More informationOn Orthogonal Double Covers of Complete Bipartite Graphs by Disjoint Unions of Graph-Paths
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 3, March 2014, PP 281-288 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org On Orthogonal
More informationChoosability and fractional chromatic numbers
Choosability and fractional chromatic numbers Noga Alon Zs. Tuza M. Voigt This copy was printed on October 11, 1995 Abstract A graph G is (a, b)-choosable if for any assignment of a list of a colors to
More informationCombinatorial 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 informationMaximum Distance Separable Symbol-Pair Codes
2012 IEEE International Symposium on Information Theory Proceedings Maximum Distance Separable Symbol-Pair Codes Yeow Meng Chee, Han Mao Kiah, and Chengmin Wang School of Physical and Mathematical Sciences,
More informationDerived and Residual Subspace Designs
Derived and Residual Subspace Designs Michael Kiermaier, Reinhard Laue Universität Bayreuth, michael.kiermaier@uni-bayreuth.de, laue@uni-bayreuth.de Abstract A generalization of forming derived and residual
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationDEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS. George E. Andrews and Ken Ono. February 17, Introduction and Statement of Results
DEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS George E. Andrews and Ken Ono February 7, 2000.. Introduction and Statement of Results Dedekind s eta function ηz, defined by the infinite product ηz
More informationAn Algorithmic Hypergraph Regularity Lemma
An Algorithmic Hypergraph Regularity Lemma Brendan Nagle Vojtěch Rödl Mathias Schacht October 14, 2015 Abstract Szemerédi s Regularity Lemma [22, 23] is a powerful tool in graph theory. It asserts that
More informationarxiv: v1 [math.co] 28 Jan 2019
THE BROWN-ERDŐS-SÓS CONJECTURE IN FINITE ABELIAN GROUPS arxiv:191.9871v1 [math.co] 28 Jan 219 JÓZSEF SOLYMOSI AND CHING WONG Abstract. The Brown-Erdős-Sós conjecture, one of the central conjectures in
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 informationOn the generation of the coefficient field of a newform by a single Hecke eigenvalue
On the generation of the coefficient field of a newform by a single Hecke eigenvalue Koopa Tak-Lun Koo and William Stein and Gabor Wiese November 2, 27 Abstract Let f be a non-cm newform of weight k 2
More informationWhen does a formal finite-difference expansion become real? 1
When does a formal finite-difference expansion become real? 1 Edmund Y. M. Chiang a Shaoji Feng b a The Hong Kong University of Science & Technology b Chinese Academy of Sciences Computational Methods
More informationUNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA On d-graceful labelings Anita Pasotti Quaderni Elettronici del Seminario di Geometria Combinatoria 7E (Maggio 0) http://wwwmatuniromait/~combinat/quaderni Dipartimento
More informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More informationThe Hales-Jewett Theorem
The Hales-Jewett Theorem A.W. HALES & R.I. JEWETT 1963 Regularity and positional games Trans. Amer. Math. Soc. 106, 222-229 Hales-Jewett Theorem, SS04 p.1/35 Importance of HJT The Hales-Jewett theorem
More informationResearch Article New Partition Theoretic Interpretations of Rogers-Ramanujan Identities
International Combinatorics Volume 2012, Article ID 409505, 6 pages doi:10.1155/2012/409505 Research Article New Partition Theoretic Interpretations of Rogers-Ramanujan Identities A. K. Agarwal and M.
More informationOn a 3-Uniform Path-Hypergraph on 5 Vertices
Applied Mathematical Sciences, Vol. 10, 2016, no. 30, 1489-1500 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.512742 On a 3-Uniform Path-Hypergraph on 5 Vertices Paola Bonacini Department
More informationFrobenius groups, near-rings, and combinatorial designs (Life after Coolville)
Frobenius groups, near-rings, and combinatorial designs (Life after Coolville) A combinatorial design is an incidence structure of points and blocks. Blocks are simply sets of points, and we say a point
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 informationINDUCED CYCLES AND CHROMATIC NUMBER
INDUCED CYCLES AND CHROMATIC NUMBER A.D. SCOTT DEPARTMENT OF MATHEMATICS UNIVERSITY COLLEGE, GOWER STREET, LONDON WC1E 6BT Abstract. We prove that, for any pair of integers k, l 1, there exists an integer
More informationPatterns and minimal dynamics for graph maps
Patterns and minimal dynamics for graph maps Lluís Alsedà Departament de Matemàtiques Universitat Autònoma de Barcelona http://www.mat.uab.cat/ alseda XV Encuentro de Topología Castellò de la Plana, September
More informationRanks of Hadamard Matrices and Equivalence of Sylvester Hadamard and Pseudo-Noise Matrices
Operator Theory: Advances and Applications, Vol 1, 1 13 c 27 Birkhäuser Verlag Basel/Switzerland Ranks of Hadamard Matrices and Equivalence of Sylvester Hadamard and Pseudo-Noise Matrices Tom Bella, Vadim
More informationA PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY
A PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY I. HECKENBERGER AND J. SAWADA Abstract. A bound resembling Pascal s identity is presented for binary necklaces with fixed density using
More informationSets in Abelian groups with distinct sums of pairs
Journal of Number Theory 13 (007) 144 153 www.elsevier.com/locate/jnt Sets in Abelian groups with distinct sums of pairs Harri Haanpää a,,1,patricr.j.östergård b, a Department of Computer Science and Engineering,
More informationOrthogonal arrays of strength three from regular 3-wise balanced designs
Orthogonal arrays of strength three from regular 3-wise balanced designs Charles J. Colbourn Computer Science University of Vermont Burlington, Vermont 05405 D. L. Kreher Mathematical Sciences Michigan
More informationRANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY
RANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY Christian Ballot Université de Caen, Caen 14032, France e-mail: ballot@math.unicaen.edu Michele Elia Politecnico di Torino, Torino 10129,
More informationInfinite Series. Copyright Cengage Learning. All rights reserved.
Infinite Series Copyright Cengage Learning. All rights reserved. Sequences Copyright Cengage Learning. All rights reserved. Objectives List the terms of a sequence. Determine whether a sequence converges
More informationHamiltonian cycles in circulant digraphs with jumps 2, 3, c [We need a real title???]
Hamiltonian cycles in circulant digraphs with jumps,, c [We need a real title???] Abstract [We need an abstract???] 1 Introduction It is not known which circulant digraphs have hamiltonian cycles; this
More informationMultiply Erdős-Ko-Rado Theorem
arxiv:1712.09942v1 [math.co] 28 Dec 2017 Multiply Erdős-Ko-Rado Theorem Carl Feghali Department of Informatics, University of Bergen, Bergen, Norway feghali.carl@gmail.com December 29, 2017 Abstract A
More informationTiling on multipartite graphs
Tiling on multipartite graphs Ryan Martin Mathematics Department Iowa State University rymartin@iastate.edu SIAM Minisymposium on Graph Theory Joint Mathematics Meetings San Francisco, CA Ryan Martin (Iowa
More informationSTRICTLY ORDER PRIMAL ALGEBRAS
Acta Math. Univ. Comenianae Vol. LXIII, 2(1994), pp. 275 284 275 STRICTLY ORDER PRIMAL ALGEBRAS O. LÜDERS and D. SCHWEIGERT Partial orders and the clones of functions preserving them have been thoroughly
More informationA Hilton-Milner-type theorem and an intersection conjecture for signed sets
A Hilton-Milner-type theorem and an intersection conjecture for signed sets Peter Borg Department of Mathematics, University of Malta Msida MSD 2080, Malta p.borg.02@cantab.net Abstract A family A of sets
More informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler: Towards a flow theory for the dichromatic number Technical Report feu-dmo032.14 Contact: winfried.hochstaettler@fernuni-hagen.de FernUniversität
More informationarxiv: v1 [math.gm] 1 Oct 2015
A WINDOW TO THE CONVERGENCE OF A COLLATZ SEQUENCE arxiv:1510.0174v1 [math.gm] 1 Oct 015 Maya Mohsin Ahmed maya.ahmed@gmail.com Accepted: Abstract In this article, we reduce the unsolved problem of convergence
More informationA Diophantine System and a Problem on Cubic Fields
International Mathematical Forum, Vol. 6, 2011, no. 3, 141-146 A Diophantine System and a Problem on Cubic Fields Paul D. Lee Department of Mathematics and Statistics University of British Columbia Okanagan
More informationThe kappa function. [ a b. c d
The kappa function Masanobu KANEKO Masaaki YOSHIDA Abstract: The kappa function is introduced as the function κ satisfying Jκτ)) = λτ), where J and λ are the elliptic modular functions. A Fourier expansion
More informationSymmetric configurations for bipartite-graph codes
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria pp. 63-69 Symmetric configurations for bipartite-graph codes Alexander Davydov adav@iitp.ru
More informationA DEGREE VERSION OF THE HILTON MILNER THEOREM
A DEGREE VERSION OF THE HILTON MILNER THEOREM PETER FRANKL, JIE HAN, HAO HUANG, AND YI ZHAO Abstract An intersecting family of sets is trivial if all of its members share a common element Hilton and Milner
More informationNo CHARACTERIZING CONVEXITY OF GAMES USING MARGINAL VECTORS. By Bas van Velzen, Herbert Hamers, Henk Norde. February 2003 ISSN
No 003 CHARACTERIZING CONVEXITY OF GAMES USING MARGINAL VECTORS By Bas van Velzen, Herbert Hamers, Henk Norde February 003 ISSN 094-785 Characterizing convexity of games using marginal vectors Bas van
More information. Here the flats of H(2d 1, q 2 ) consist of all nonzero totally isotropic
NEW BOUNDS FOR PARTIAL SPREADS OF H(d 1, ) AND PARTIAL OVOIDS OF THE REE-TITS OCTAGON FERDINAND IHRINGER, PETER SIN, QING XIANG ( ) Abstract Our first result is that the size of a partial spread of H(,
More informationarxiv: v1 [math.co] 2 Dec 2013
What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every
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 informationLinear Algebra and its Applications
Linear Algebra and its Applications 431 (29) 188 195 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Lattices associated with
More informationTransversal designs and induced decompositions of graphs
arxiv:1501.03518v1 [math.co] 14 Jan 2015 Transversal designs and induced decompositions of graphs Csilla Bujtás 1 Zsolt Tuza 1,2 1 Department of Computer Science and Systems Technology University of Pannonia
More informationMarvin L. Sahs Mathematics Department, Illinois State University, Normal, Illinois Papa A. Sissokho.
#A70 INTEGERS 13 (2013) A ZERO-SUM THEOREM OVER Z Marvin L. Sahs Mathematics Department, Illinois State University, Normal, Illinois marvinsahs@gmail.com Papa A. Sissokho Mathematics Department, Illinois
More informationBlock intersection polynomials
Block intersection polynomials Peter J. Cameron and Leonard H. Soicher School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS, UK P.J.Cameron@qmul.ac.uk, L.H.Soicher@qmul.ac.uk
More informationTechnische Universität Ilmenau Institut für Mathematik
Technische Universität Ilmenau Institut für Mathematik Preprint No. M 0/08 A lower bound on independence in terms of degrees Harant, Jochen August 00 Impressum: Hrsg.: Leiter des Instituts für Mathematik
More informationA dyadic endomorphism which is Bernoulli but not standard
A dyadic endomorphism which is Bernoulli but not standard Christopher Hoffman Daniel Rudolph November 4, 2005 Abstract Any measure preserving endomorphism generates both a decreasing sequence of σ-algebras
More informationKLEIN-FOUR COVERS OF THE PROJECTIVE LINE IN CHARACTERISTIC TWO
ALBANIAN JOURNAL OF MATHEMATICS Volume 1, Number 1, Pages 3 11 ISSN 1930-135(electronic version) KLEIN-FOUR COVERS OF THE PROJECTIVE LINE IN CHARACTERISTIC TWO DARREN GLASS (Communicated by T. Shaska)
More informationOn Multiplicity-free Products of Schur P -functions. 1 Introduction
On Multiplicity-free Products of Schur P -functions Christine Bessenrodt Fakultät für Mathematik und Physik, Leibniz Universität Hannover, Welfengarten 3067 Hannover, Germany; bessen@math.uni-hannover.de
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationCombinatorial Designs: Balanced Incomplete Block Designs
Combinatorial Designs: Balanced Incomplete Block Designs Designs The theory of design of experiments came into being largely through the work of R.A.Fisher and F.Yates in the early 1930's. They were motivated
More informationThe Lefthanded Local Lemma characterizes chordal dependency graphs
The Lefthanded Local Lemma characterizes chordal dependency graphs Wesley Pegden March 30, 2012 Abstract Shearer gave a general theorem characterizing the family L of dependency graphs labeled with probabilities
More informationParameter inequalities for orthogonal arrays with mixed levels
Parameter inequalities for orthogonal arrays with mixed levels Wiebke S. Diestelkamp Department of Mathematics University of Dayton Dayton, OH 45469-2316 wiebke@udayton.edu Designs, Codes and Cryptography,
More informationList Decomposition of Graphs
List Decomposition of Graphs Yair Caro Raphael Yuster Abstract A family of graphs possesses the common gcd property if the greatest common divisor of the degree sequence of each graph in the family is
More informationCAYLEY NUMBERS WITH ARBITRARILY MANY DISTINCT PRIME FACTORS arxiv: v1 [math.co] 17 Sep 2015
CAYLEY NUMBERS WITH ARBITRARILY MANY DISTINCT PRIME FACTORS arxiv:1509.05221v1 [math.co] 17 Sep 2015 TED DOBSON AND PABLO SPIGA Abstract. A positive integer n is a Cayley number if every vertex-transitive
More informationConflict-Free Colorings of Rectangles Ranges
Conflict-Free Colorings of Rectangles Ranges Khaled Elbassioni Nabil H. Mustafa Max-Planck-Institut für Informatik, Saarbrücken, Germany felbassio, nmustafag@mpi-sb.mpg.de Abstract. Given the range space
More informationDecidability (What, stuff is unsolvable?)
University of Georgia Fall 2014 Outline Decidability Decidable Problems for Regular Languages Decidable Problems for Context Free Languages The Halting Problem Countable and Uncountable Sets Diagonalization
More informationGroups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems
Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)
More informationBalanced Nested Designs and Balanced n-ary Designs
Balanced Nested Designs and Balanced n-ary Designs Ryoh Fuji-Hara a, Shinji Kuriki b, Ying Miao a and Satoshi Shinohara c a Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki
More informationSimple 3-designs and PSL(2, q) with q 1 (mod 4)
Simple 3-designs and PSL(, q) with q 1 (mod 4) Niranjan Balachandran and Dijen Ray-Chaudhuri Department of Mathematics The Ohio State University Columbus, Ohio, USA email: niranj@math.ohio-state.edu, dijen@math.ohio-state.edu
More informationMatrix approximation and Tusnády s problem
European Journal of Combinatorics 28 (2007) 990 995 www.elsevier.com/locate/ejc Matrix approximation and Tusnády s problem Benjamin Doerr Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123
More informationOn NP-Completeness for Linear Machines
JOURNAL OF COMPLEXITY 13, 259 271 (1997) ARTICLE NO. CM970444 On NP-Completeness for Linear Machines Christine Gaßner* Institut für Mathematik und Informatik, Ernst-Moritz-Arndt-Universität, F.-L.-Jahn-Strasse
More information0-1 Laws for Fragments of SOL
0-1 Laws for Fragments of SOL Haggai Eran Iddo Bentov Project in Logical Methods in Combinatorics course Winter 2010 Outline 1 Introduction Introduction Prefix Classes Connection between the 0-1 Law and
More informationQuasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets Raphael Yuster 1 Department of Mathematics, University of Haifa, Haifa, Israel raphy@math.haifa.ac.il
More informationMath 430/530: Advanced Calculus I Chapter 1: Sequences
Math 430/530: Advanced Calculus I Chapter 1: Sequences Fall 2018 Sequences A sequence is just a list of real numbers a 1, a 2,... with a definite order. We write a = (a n ) n=1 for a sequence a with n
More informationLow Rank Co-Diagonal Matrices and Ramsey Graphs
Low Rank Co-Diagonal Matrices and Ramsey Graphs Vince Grolmusz Department of Computer Science Eötvös University, H-1053 Budapest HUNGARY E-mail: grolmusz@cs.elte.hu Submitted: March 7, 000. Accepted: March
More informationMinimum degree conditions for large subgraphs
Minimum degree conditions for large subgraphs Peter Allen 1 DIMAP University of Warwick Coventry, United Kingdom Julia Böttcher and Jan Hladký 2,3 Zentrum Mathematik Technische Universität München Garching
More informationA talk given at the University of California at Irvine on Jan. 19, 2006.
A talk given at the University of California at Irvine on Jan. 19, 2006. A SURVEY OF ZERO-SUM PROBLEMS ON ABELIAN GROUPS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093 People s
More informationCartesian product of hypergraphs: properties and algorithms
Cartesian product of hypergraphs: properties and algorithms Alain Bretto alain.bretto@info.unicaen.fr Yannick Silvestre yannick.silvestre@info.unicaen.fr Thierry Vallée vallee@pps.jussieu.fr Université
More informationLarge Cliques and Stable Sets in Undirected Graphs
Large Cliques and Stable Sets in Undirected Graphs Maria Chudnovsky Columbia University, New York NY 10027 May 4, 2014 Abstract The cochromatic number of a graph G is the minimum number of stable sets
More information120A LECTURE OUTLINES
120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication
More informationMaximal non-commuting subsets of groups
Maximal non-commuting subsets of groups Umut Işık March 29, 2005 Abstract Given a finite group G, we consider the problem of finding the maximal size nc(g) of subsets of G that have the property that no
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 018 MAT30 (Discrete Math) Mathematical Induction Fall 018 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More informationOn the Classification of Splitting (v, u c, ) BIBDs
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 18, No 5 Special Thematic Issue on Optimal Codes and Related Topics Sofia 2018 Print ISSN: 1311-9702; Online ISSN: 1314-4081
More informationOn equidistant constant weight codes
Discrete Applied Mathematics 128 (2003) 157 164 www.elsevier.com/locate/dam On equidistant constant weight codes Fang-Wei Fu a;1, Torleiv KlHve b; ;2, Yuan Luo c, Victor K. Wei b a Temasek Laboratories,
More informationPrimitive sets in a lattice
Primitive sets in a lattice Spyros. S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, FL 33431, U.S.A spyros@fau.unl.edu Tran van Trung Institute for Experimental
More informationHalf-arc-transitive graphs of arbitrary even valency greater than 2
arxiv:150502299v1 [mathco] 9 May 2015 Half-arc-transitive graphs of arbitrary even valency greater than 2 Marston DE Conder Department of Mathematics, University of Auckland, Private Bag 92019, Auckland
More information