Related papers: Group divisible designs with block size five

We classify all groups of order $p^5$ with non-trivial unramified Brauer groups. We show that if $p>3$, then there are precisely $\gcd (p-1,4)+\gcd (p-1,3)+1$ such groups.

In this paper, we present a method for constructing point primitive block transitive $t$-designs invariant under finite groups. Furthermore, we demonstrate that every point and block primitive $G$-invariant design can be generated using…

We compute the dimensions of $\operatorname{Ext}_G^n(V, W)$ for all irreducible $V$, $W$ lying in $r$-blocks of cyclic defect in the simple groups $\operatorname{Sz}(q)$, $\operatorname{PSU}_3(q)$ and $\operatorname{{}^2G}_2(q)$ in cross…

We construct some N=1 supersymmetric three-family SU(5) Grand Unified Models from type IIA orientifolds on $\IT^6/(\IZ_2\times \IZ_2)$ with D6-branes intersecting at general angles. These constructions are supersymmetric only for special…

We give explicit constructions for incomplete pairwise balanced designs IPBD$((v;w),K)$, or, equivalently, edge-decompositions of a difference of two cliques $K_v \setminus K_w$ into cliques whose sizes belong to the set $K$. Our…

This paper investigates block-transitive automorphism groups of t-(k^2,k,\lambda) designs. Let D be a non-trivial t-(k^2,k,\lambda) design, G \leq \Aut(D) be block-transitive with X\unlhd G\leq \Aut(X), where X = PSL(2,q)(q\geq4). Then q =…

In this paper, a family of five-weight reducible cyclic codes is presented. Furthermore, the weight distribution of these cyclic codes is determined, which follows from the determination of value distributions of certain exponential sums.

An injective coloring of a graph $G$ is an assignment of colors to the vertices of $G$ so that any two vertices with a common neighbor have distinct colors. A graph $G$ is injectively $k$-choosable if for any list assignment $L$, where…

The classification of all semiovals and blocking semiovals in $\mathrm{PG}(2,8)$ and in $\mathrm{PG}(2,9)$ of size less than $17$ is determined. Also, some information on the stabilizer groups and the intersection sizes with lines is given.

A $k$-regular graph on $v$ vertices is a {\em divisible design graph} if there exist integers $\lambda_1,\lambda_2,m,n$ such that the vertex set can be partitioned into $m$ classes of size $n$ and any two different vertices from the same…

Let $G=SL(2,5)$ be the special linear group of $2 \times 2$-matrices with coefficients in the field with $5$ elements. We show that the principal block over a splitting field $K$ of characteristic two of the group algebra $KG$ has a…

In this paper, we give a new method for constructing LCD codes. We employ group rings and a well known map that sends group ring elements to a subring of the $n \times n$ matrices to obtain LCD codes. Our construction method guarantees that…

The paper presents a subclass of the class of MD5-algebras and MD5-groups, i.e. five dimensional solvable Lie algebras and Lie groups such that their orbits in the co-adjoint representation (K-orbits) are orbits of zero or maximal…

In this article, we study $2$-designs with $\gcd(r,\lambda)=1$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type. We obtain four infinite families of such designs and…

A (k,d)-list assignment L of a graph G is a mapping that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at most d colors. A graph G is (k,d)-choosable if there exists an…

There are exactly 35 inequivalent (36, 15, 6) difference sets in nine groups. Eight of the nine groups have a normal Sylow 3-subgroup. We give a straightforward spread construction which explains the 32 inequivalent difference sets in these…

In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space…

Let $\mathcal{D}$ be a nontrivial $3$-$(v,k,1)$ design admitting a block-transitive group $G$ of automorphisms. A recent work of Gan and the second author asserts that $G$ is either affine or almost simple. In this paper, it is proved that…

We investigate block designs, under the A- and MV-criteria, when each treatment can have only one or two replications due to resource constraints, as can happen, for example, in early generation varietal trials. While these are commonly…

We show that any planar graph $G=(V,E)$ has a 5-coloring such that one color class contains at most $|V|/6$ vertices. In other words, there exists a partition of $V$ into five independent sets $\{V_1, \cdots, V_5\}$ such that $|V_5| \leq…