29 research outputs found
Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
AbstractIt is possible to find n partitions of an n-element set whose pairwise intersections are just all atoms of the partition lattice? Demetrovics, Füredi and Katona [4] verified this for all n ≡ 1 or 4 (mod 12) by constructing a series of special Mendelsohn Triple Systems. They conjectured that such triple systems exist for all n ≡ 1 (mod 3) and that the problem on the partitions has a solution for all n ⩾ 7. We prove that both conjectures are ture, except for finitely many n
Ramsey-nice families of graphs
For a finite family of fixed graphs let be
the smallest integer for which every -coloring of the edges of the
complete graph yields a monochromatic copy of some . We
say that is -nice if for every graph with
and for every -coloring of there exists a
monochromatic copy of some . It is easy to see that if
contains no forest, then it is not -nice for any . It seems
plausible to conjecture that a (weak) converse holds, namely, for any finite
family of graphs that contains at least one forest, and for all
(or at least for infinitely many values of ),
is -nice. We prove several (modest) results in support of this
conjecture, showing, in particular, that it holds for each of the three
families consisting of two connected graphs with 3 edges each and observing
that it holds for any family containing a forest with at most 2
edges. We also study some related problems and disprove a conjecture by
Aharoni, Charbit and Howard regarding the size of matchings in regular
3-partite 3-uniform hypergraphs.Comment: 20 pages, 2 figure
Applications of finite geometries to designs and codes
This dissertation concerns the intersection of three areas of discrete mathematics: finite geometries, design theory, and coding theory. The central theme is the power of finite geometry designs, which are constructed from the points and t-dimensional subspaces of a projective or affine geometry. We use these designs to construct and analyze combinatorial objects which inherit their best properties from these geometric structures.
A central question in the study of finite geometry designs is Hamada’s conjecture, which proposes that finite geometry designs are the unique designs with minimum p-rank among all designs with the same parameters. In this dissertation, we will examine several questions related to Hamada’s conjecture, including the existence of counterexamples. We will also study the applicability of certain decoding methods to known counterexamples.
We begin by constructing an infinite family of counterexamples to Hamada’s conjecture. These designs are the first infinite class of counterexamples for the affine case of Hamada’s conjecture. We further demonstrate how these designs, along with the projective polarity designs of Jungnickel and Tonchev, admit majority-logic decoding schemes. The codes obtained from these polarity designs attain error-correcting performance which is, in certain cases, equal to that of the finite geometry designs from which they are derived. This further demonstrates the highly geometric structure maintained by these designs.
Finite geometries also help us construct several types of quantum error-correcting codes. We use relatives of finite geometry designs to construct infinite families of q-ary quantum stabilizer codes. We also construct entanglement-assisted quantum error-correcting codes (EAQECCs) which admit a particularly efficient and effective error-correcting scheme, while also providing the first general method for constructing these quantum codes with known parameters and desirable properties. Finite geometry designs are used to give exceptional examples of these codes
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)