8 research outputs found
Large Cross-free sets in Steiner triple systems
A {\em cross-free} set of size in a Steiner triple system
is three pairwise disjoint -element subsets such that
no intersects all the three -s. We conjecture that for
every admissible there is an STS with a cross-free set of size
which if true, is best possible. We prove this
conjecture for the case , constructing an STS containing a
cross-free set of size . We note that some of the -bichromatic STSs,
constructed by Colbourn, Dinitz and Rosa, have cross-free sets of size close to
(but cannot have size exactly ).
The constructed STS shows that equality is possible for in
the following result: in every -coloring of the blocks of any Steiner triple
system STS there is a monochromatic connected component of size at least
(we conjecture that equality holds for every
admissible ).
The analogue problem can be asked for -colorings as well, if r-1 \equiv
1,3 \mbox{ (mod 6)} and is a prime power, we show that the answer is the
same as in case of complete graphs: in every -coloring of the blocks of any
STS, there is a monochromatic connected component with at least points, and this is sharp for infinitely many .Comment: Journal of Combinatorial Designs, 201
Set-Codes with Small Intersections and Small Discrepancies
We are concerned with the problem of designing large families of subsets over
a common labeled ground set that have small pairwise intersections and the
property that the maximum discrepancy of the label values within each of the
sets is less than or equal to one. Our results, based on transversal designs,
factorizations of packings and Latin rectangles, show that by jointly
constructing the sets and labeling scheme, one can achieve optimal family sizes
for many parameter choices. Probabilistic arguments akin to those used for
pseudorandom generators lead to significantly suboptimal results when compared
to the proposed combinatorial methods. The design problem considered is
motivated by applications in molecular data storage and theoretical computer
science
Colouring 4-cycle systems with equitably coloured blocks
AbstractA colouring of a 4-cycle system (V,B) is a surjective mapping φ:V→Γ. The elements of Γ are colours and, for each i∈Γ, the set Ci=φ−1(i) is a colour class. If |Γ|=m, we have an m-colouring of (V,B). For every B∈B, let φ(B)={φ(x)|x∈B}. We say that a block B is equitably coloured if either |φ(B)∩Ci|=0 or |φ(B)∩Ci|=2 for every i∈Γ. Let F(n) be the set of integers m such that there exists an m-coloured 4-cycle system of order n with every block equitably coloured. We prove that: •minF(n)=3 for every n≡1(mod8), n⩾17, F(9)=∅,•{m|3⩽m⩽n+3116}⊆F(n), n≡1(mod16), n⩾17,•{m|3⩽m⩽n+2316}⊆F(n), n≡9(mod16), n⩾25,•for every sufficiently large n≡1(mod8), there is an integer m̄ such that maxF(n)⩽m̄. Moreover we show that maxF(n)=m̄ for infinite values of n
Steiner configurations ideals: Containment and colouring
Given a homogeneous ideal I ⊆ k[x0, …, xn ], the Containment problem studies the relation between symbolic and regular powers of I, that is, it asks for which pairs m, r ∈ N, I(m) ⊆ Ir holds. In the last years, several conjectures have been posed on this problem, creating an active area of current interests and ongoing investigations. In this paper, we investigated the Stable Harbourne Conjecture and the Stable Harbourne–Huneke Conjecture, and we show that they hold for the defining ideal of a Complement of a Steiner configuration of points in Pnk. We can also show that the ideal of a Complement of a Steiner Configuration of points has expected resurgence, that is, its resurgence is strictly less than its big height, and it also satisfies Chudnovsky and Demailly’s Conjectures. Moreover, given a hypergraph H, we also study the relation between its colourability and the failure of the containment problem for the cover ideal associated to H. We apply these results in the case that H is a Steiner System
Recommended from our members
Configurations and colouring problems in block designs
A Steiner triple system of order v (STS(v)) is called x-chromatic if x is the smallest number of colours needed to avoid monochromatic blocks. Amongst our results on colour class structures we show that every STS (19) is 3- or 4-chromatic, that every 3-chromatic STS(19) has an equitable 3-colouring (meaning that the colours are as uniformly distributed as possible), and that for all admissible v > 25 there exists a 3-chromatic STS(v) which does not admit an equitable 3-colouring. We obtain a formula for the number of independent sets in an STS(v) and use it to show that an STS(21) must contain eight independent points. This leads to a simple proof that every STS(21) is 3- or 4-chromatic. Substantially extending existing tabulations, we provide an enumeration of STS trades of up to 12 blocks, and as an application we show that any pair of STS(15)s must be 3-1-isomorphic. We prove a general theorem that enables us to obtain formulae for the frequencies of occurrence of configurations in triple systems. Some of these are used in our proof that for v > 25 no STS(u) has a 3-existentially closed block intersection graph. Of specific interest in connection with a conjecture of Erdos are 6-sparse and perfect Steiner triple systems, characterized by the avoidance of specific configurations. We describe two direct constructions that produce 6-sparse STS(v)s and we give a recursive construction that preserves 6-sparseness. Also we settle an old question concerning the occurrence of perfect block transitive Steiner triple systems. Finally, we consider Steiner 5(2,4, v) designs that are built from collections of Steiner triple systems. We solve a longstanding problem by constructing such systems with v = 61 (Zoe’s design) and v = 100 (the design of the century)
Bicoloring Steiner Triple Systems
A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the color classes. In this paper we give necessary conditions for the existence of a bicoloring with 3 color classes and give a multiplication theorem for Steiner triple systems with 3 color classes. We also examine bicolorings with more than 3 color classes. Math Subject Clasification: 05B07 1 Introduction Throughout this paper we use notation consistent with that found in [2]. Let D = (V; B) be a (v; k; )-design. A coloring of D is a mapping ' : V ! C. The elements of C are colors; if jCj = m, we have an m-coloring of D. For the electronic journal of combinatorics 6 (1999), #R25 2 each c 2 C, the set ' \Gamma1 (c) = fx : '(x) = cg is a color class. A coloring ' of D is weak (strong) if for all B 2 B, j '(B) j? 1 ('(B) = k, respectively), where '(B) = [ v2B '(v). Each color class in a weak or strong color..