204 research outputs found
Colouring steiner quadruple systems
AbstractA Steiner quadruple system of order ν (briefly SQS(ν)) is a pair (X, B), where |X| = ν and B is a collection of 4-subsets of X, called blocks, such that each 3-subset of X is contained in a unique block of B. A SQS(ν) exists iff ν ≡ 2, 4 (mod 6) or ν = 0, 1 (the admissible integers). The chromatic number of (X, B) is the smallest m for which there is a map ϕ: X → Zm such that |ϕ(β)| ⩾ 2 for all β ϵ B. In this paper it is shown that for each m ⩾ 6 there exists νm such that for all admissible ν ⩾ νm there exists an m-chromatic SQS(ν). For m = 4, 5 the same statement is proved for admissible ν with the restriction that ν ≢ 2 (mod 12)
Computing the chromatic number of t-(v,k,[lambda]) designs
Colouring t-designs has previously been shown to be an NP-complete problem; heuristics and a practical algorithm for this problem were developed for this thesis; the algorithm was then employed to find the chromatic numbers of the sixteen non- isomorphic 2-(25, 4, 1) designs and the four cyclic 2-(19, 3, 1) designs. This thesis additionally examines the existing literature on colouring and finding chromatic numbers of t-designs
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
On the structure of the h-vector of a paving matroid.
We give two proofs that the h-vector of any paving matroid is a pure 0-sequence, thus answering in the affirmative a conjecture made by Stanley, for this particular class of matroids. We also investigate the problem of obtaining good lower bounds for the number of bases of a paving matroid given its rank and number of elements.The first author was supported by Conacyt of México Proyect8397
Bounding the Number of Hyperedges in Friendship -Hypergraphs
For , an -uniform hypergraph is called a friendship
-hypergraph if every set of vertices has a unique 'friend' - that
is, there exists a unique vertex with the property that for each
subset of size , the set is a hyperedge.
We show that for , the number of hyperedges in a friendship
-hypergraph is at least , and we
characterise those hypergraphs which achieve this bound. This generalises a
result given by Li and van Rees in the case when .
We also obtain a new upper bound on the number of hyperedges in a friendship
-hypergraph, which improves on a known bound given by Li, van Rees, Seo and
Singhi when .Comment: 14 page
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
- …