相关论文: Group divisible designs with block size five: dire…
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…
The linked systems of symmetric group divisible designs of type II is introduced, and several examples are obtained from affine resolvable designs and mutually UFS Latin squares. Furthermore, an equivalence between such symmetric group…
Suppose that $B$ is a Brauer $p$-block with defect group $D$. If $B$ exactly contains 4 irreducible characters, then we show that $D$ has order 4 or 5, assuming the Alperin--McKay conjecture.
We give a strongly explicit construction of $\varepsilon$-approximate $k$-designs for the orthogonal group $\mathrm{O}(N)$ and the unitary group $\mathrm{U}(N)$, for $N=2^n$. Our designs are of cardinality $\mathrm{poly}(N^k/\varepsilon)$…
An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian. A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a symmetric divisible design. We establish conditions which…
In this paper we present the results from a program developed by the author that finds the unitals of the known 193 projective planes of order 25.. There are several planes for which we have not found any unital. One or more than one…
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.
Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…
Two-level factorial designs are widely used in industrial experiments. For processes involving \(n\) factors, the construction of designs comprising \(2^n\) and \(2^{n-p}\) factorials, arranged in blocks of size \(2^q\) is investigated. The…
In this paper, we classify connected amply regular graphs with diameter $d \geq 4$ and parameters $(v, k, \lambda, \mu)$ satisfying $\mu = \frac{k-1}{2}$, where $k\geq 5$ is odd. We prove that such a graph must be exactly one of the…
We classify six-dimensional Lie groups which admit a left-invariant half-flat SU(3)-structure and which split in a direct product of three-dimensional factors. Moreover, a complete list of those direct products is obtained which admit a…
It is clear that the full automorphism group of the $(15,8,4)$-design of points and hyperplane complements of ${\rm PG}(3,2)$ is ${\rm GL}(4,2)$. Using methods of point-line geometries, we determine the full automorphism groups of the…
A $2$-$(v,k,\lambda)$ design is additive (or strongly additive) if it is possible to embed it in a suitable abelian group $G$ in such a way that its block set is contained in (or coincides with) the set of all the zero-sum $k$-subsets of…
A $k$-regular graph is called a divisible design graph if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbours, and two vertices from…
We prove that any real Lie group of dimension \leq 5 admits a left invariant flat projective structure. We also prove that a real Lie group L of dimension \leq 5 admits a left invariant flat affine structure if and only if the Lie algebra…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
In this paper, we are interested in minimizing the sum of block sizes in a pairwise balanced design, where there are some constraints on the size of one block or the size of the largest block. For every positive integers n;m, where m ? n,…
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which…
Various ideas support the notion that the GUT gauge group might be a semi-simple direct-product group such as $SU(5) \times SU(5)$. The doublet-triplet splitting problem can be solved with a direct product group. String theory suggests that…
The generalized chain geometry over the local ring $K(\epsilon;\sigma)$ of twisted dual numbers, where $K$ is a finite field, is interpreted as a divisible design obtained from an imprimitive group action. Its combinatorial properties as…