9,745 research outputs found

    Resolvability of infinite designs

    Get PDF
    In this paper we examine the resolvability of infinite designs. We show that in stark contrast to the finite case, resolvability for infinite designs is fairly commonplace. We prove that every t-(v,k,Λ) design with t finite, v infinite and k,λ<v is resolvable and, in fact, has α orthogonal resolutions for each α<v. We also show that, while a t-(v,k,Λ) design with t and λ finite, v infinite and k=v may or may not have a resolution, any resolution of such a design must have v parallel classes containing v blocks and at most λ−1 parallel classes containing fewer than v blocks. Further, a resolution into parallel classes of any specified sizes obeying these conditions is realisable in some design. When k<v and λ=v and when k=v and λ is infinite, we give various examples of resolvable and non-resolvable t-(v,k,Λ) designs

    Resolvable Mendelsohn designs and finite Frobenius groups

    Full text link
    We prove the existence and give constructions of a (p(k)−1)(p(k)-1)-fold perfect resolvable (v,k,1)(v, k, 1)-Mendelsohn design for any integers v>k≥2v > k \ge 2 with v≡1mod  kv \equiv 1 \mod k such that there exists a finite Frobenius group whose kernel KK has order vv and whose complement contains an element ϕ\phi of order kk, where p(k)p(k) is the least prime factor of kk. Such a design admits K⋊⟨ϕ⟩K \rtimes \langle \phi \rangle as a group of automorphisms and is perfect when kk is a prime. As an application we prove that for any integer v=p1e1…ptet≥3v = p_{1}^{e_1} \ldots p_{t}^{e_t} \ge 3 in prime factorization, and any prime kk dividing piei−1p_{i}^{e_i} - 1 for 1≤i≤t1 \le i \le t, there exists a resolvable perfect (v,k,1)(v, k, 1)-Mendelsohn design that admits a Frobenius group as a group of automorphisms. We also prove that, if kk is even and divides pi−1p_{i} - 1 for 1≤i≤t1 \le i \le t, then there are at least φ(k)t\varphi(k)^t resolvable (v,k,1)(v, k, 1)-Mendelsohn designs that admit a Frobenius group as a group of automorphisms, where φ\varphi is Euler's totient function.Comment: Final versio

    A few more Kirkman squares and doubly near resolvable BIBDs with block size 3

    Get PDF
    AbstractA Kirkman square with index λ, latinicity μ, block size k, and v points, KSk(v;μ,λ), is a t×t array (t=λ(v-1)/μ(k-1)) defined on a v-set V such that (1) every point of V is contained in precisely μ cells of each row and column, (2) each cell of the array is either empty or contains a k-subset of V, and (3) the collection of blocks obtained from the non-empty cells of the array is a (v,k,λ)-BIBD. In a series of papers, Lamken established the existence of the following designs: KS3(v;1,2) with at most six possible exceptions [E.R. Lamken, The existence of doubly resolvable (v,3,2)-BIBDs, J. Combin. Theory Ser. A 72 (1995) 50–76], KS3(v;2,4) with two possible exceptions [E.R. Lamken, The existence of KS3(v;2,4)s, Discrete Math. 186 (1998) 195–216], and doubly near resolvable (v,3,2)-BIBDs with at most eight possible exceptions [E.R. Lamken, The existence of doubly near resolvable (v,3,2)-BIBDs, J. Combin. Designs 2 (1994) 427–440]. In this paper, we construct designs for all of the open cases and complete the spectrum for these three types of designs. In addition, Colbourn, Lamken, Ling, and Mills established the spectrum of KS3(v;1,1) in 2002 with 23 possible exceptions. We construct designs for 11 of the 23 open cases

    Generalized packing designs

    Full text link
    Generalized tt-designs, which form a common generalization of objects such as tt-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of tt-designs, \emph{Discrete Math.}\ {\bf 309} (2009), 4835--4842]. In this paper, we define a related class of combinatorial designs which simultaneously generalize packing designs and packing arrays. We describe the sometimes surprising connections which these generalized designs have with various known classes of combinatorial designs, including Howell designs, partial Latin squares and several classes of triple systems, and also concepts such as resolvability and block colouring of ordinary designs and packings, and orthogonal resolutions and colourings. Moreover, we derive bounds on the size of a generalized packing design and construct optimal generalized packings in certain cases. In particular, we provide methods for constructing maximum generalized packings with t=2t=2 and block size k=3k=3 or 4.Comment: 38 pages, 2 figures, 5 tables, 2 appendices. Presented at 23rd British Combinatorial Conference, July 201

    Locality and Availability in Distributed Storage

    Full text link
    This paper studies the problem of code symbol availability: a code symbol is said to have (r,t)(r, t)-availability if it can be reconstructed from tt disjoint groups of other symbols, each of size at most rr. For example, 33-replication supports (1,2)(1, 2)-availability as each symbol can be read from its t=2t= 2 other (disjoint) replicas, i.e., r=1r=1. However, the rate of replication must vanish like 1t+1\frac{1}{t+1} as the availability increases. This paper shows that it is possible to construct codes that can support a scaling number of parallel reads while keeping the rate to be an arbitrarily high constant. It further shows that this is possible with the minimum distance arbitrarily close to the Singleton bound. This paper also presents a bound demonstrating a trade-off between minimum distance, availability and locality. Our codes match the aforementioned bound and their construction relies on combinatorial objects called resolvable designs. From a practical standpoint, our codes seem useful for distributed storage applications involving hot data, i.e., the information which is frequently accessed by multiple processes in parallel.Comment: Submitted to ISIT 201

    Resolvable designs with large blocks

    Full text link
    Resolvable designs with two blocks per replicate are studied from an optimality perspective. Because in practice the number of replicates is typically less than the number of treatments, arguments can be based on the dual of the information matrix and consequently given in terms of block concurrences. Equalizing block concurrences for given block sizes is often, but not always, the best strategy. Sufficient conditions are established for various strong optimalities and a detailed study of E-optimality is offered, including a characterization of the E-optimal class. Optimal designs are found to correspond to balanced arrays and an affine-like generalization.Comment: Published at http://dx.doi.org/10.1214/009053606000001253 in the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org
    • …
    corecore