Related papers: Fixed block configuration group divisible designs …

Motivated by a problem in complex dynamics, we examine the block structure of the natural action of monodromy groups on the tree of preimages of a generic point. We show that in many cases, including when the polynomial has prime power…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…

We determine the groups of minimal order in which all groups of order n can embedded for 1 < n < 16. We further determine the order of a minimal group in which all groups or order n or less can be embedded, also for 1 < n < 16.

By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of…

We construct two finite groups of size $2^{365}\cdot 3^{105}\cdot 7^{104}$: a solvable group $G$ and a non-solvable group $H$, such that for every integer $n$ the groups have the same number of elements of order $n$. This answers a question…

A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…

We study point-block incidence structures $(\mathcal{P},\mathcal{B})$ for which the point set $\mathcal{P}$ is an $m\times n$ grid. Cameron and the fourth author showed that each block $B$ may be viewed as a subgraph of a complete bipartite…

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…

Let G be a finite group, and let B be a non-nilpotent block of G with respect to an algebraically closed field of characteristic 2. Suppose that B has an elementary abelian defect group of order 16 and only one simple module. The main…

The obvious way to construct a GDD (group-divisible design) recursively is to use Wilson's Fundamental Construction for GDDs (WFC). Then a PBD (pairwise balanced design) is often obtained by adding a new point to each group of the GDD.…

Building on previous work by Caicedo and the second author, we develop a method that decides the existence of units of finite order in blocks of $\mathbb{Z}_p G$ of defect 1. This allows us to prove that if $p$ is a prime and $G$ is a…

A $\Bbbk$-configuration is a set of points $\mathbb{X}$ in $\mathbb{P}^2$ that satisfies a number of geometric conditions. Associated to a $\Bbbk$-configuration is a sequence $(d_1,\ldots,d_s)$ of positive integers, called its type, which…

In this paper we provide a generalization of the MPS construction of blocking sets of $PG(r,q^n)$ using subspaces of dimension $s\leq n-2$. By this construction, we determine a new non-planar example in $PG(3,q^6)$.

We describe a straightforward construction of the pseudo-split absolutely pseudo-simple groups of minimal type with irreducible root systems of type $BC_n$; these exist only in characteristic $2$. We also give a formula for the dimensions…

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 define a new type of Golomb ruler, which we term a resolvable Golomb ruler. These are Golomb rulers that satisfy an additional "resolvability" condition that allows them to generate resolvable symmetric configurations. The resulting…

Let $G$ be a finite 2-generated soluble group and suppose that $\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G$. If either $G^\prime$ is of odd order or $G^\prime$ is nilpotent, then there exists $b \in G$ with $\langle…

Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…

This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point…

We study the behavior of blocks in flat families of finite-dimensional algebras. In a general setting we construct a finite directed graph encoding a stratification of the base scheme according to the block structures of the fibers. This…