اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In 1963, Shrikhande and Raghavarao published a recursive construction for designs that starts with a resolvable design (the master design) and then uses a second design (the indexing design) to take certain unions of blocks in each parallel class of the master design. Several variations of this construction have been studied by different authors. We revisit this construction, concentrating on the case where the master design is a resolvable BIBD and the indexing design is a 3-design. We show that this construction yields a 3-design under certain circumstances. The resulting 3-designs have block size k = v/2 and they are resolvable. We also construct some previously unknown simple designs by this method.
قيم البحث
اقرأ أيضاً
Multi-access coded caching schemes from cross resolvable designs (CRD) have been reported recently cite{KNRarXiv}. To be able to compare coded caching schemes with different number of users and possibly with different number of caches a new metric ca
lled rate-per-user was introduced and it was shown that under this new metric the schemes from CRDs perform better than the Maddah-Ali-Niesen scheme in the large memory regime. In this paper a new class of CRDs is presented and it is shown that the multi-access coded caching schemes derived from these CRDs perform better than the Maddah-Ali-Niesen scheme in the entire memory regime. Comparison with other known multi-access coding schemes is also presented.
The purpose of this paper is to give explicit constructions of unitary $t$-designs in the unitary group $U(d)$ for all $t$ and $d$. It seems that the explicit constructions were so far known only for very special cases. Here explicit construction mea
ns that the entries of the unitary matrices are given by the values of elementary functions at the root of some given polynomials. We will discuss what are the best such unitary $4$-designs in $U(4)$ obtained by these methods. Indeed we give an inductive construction of designs on compact groups by using Gelfand pairs $(G,K)$. Note that $(U(n),U(m) times U(n-m))$ is a Gelfand pair. By using the zonal spherical functions for $(G,K)$, we can construct designs on $G$ from designs on $K$. We remark that our proofs use the representation theory of compact groups crucially. We also remark that this method can be applied to the orthogonal groups $O(d)$, and thus provides another explicit construction of spherical $t$-designs on the $d$ dimensional sphere $S^{d-1}$ by the induction on $d$.
Recently multi-access coded caching schemes with number of users different from the number of caches obtained from a special case of resolvable designs called Cross Resolvable Designs (CRDs) have been reported and a new performance metric called rate
-per-user has been introduced cite{KNRarXiv}. In this paper we present a generalization of this work resulting in multi-access coded caching schemes with improved rate-per-user.
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was obtained. Here, we
illustrate the method by investigating triangle decompositions: we give a simple proof that a triangle-divisible graph of large minimum degree has a triangle decomposition and prove a similar result for quasi-random host graphs.
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids and also f
rom sets to vector spaces. To achieve this, we introduce the characteristic polynomial of a $q$-polymatroid and outline several of its properties.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
