Related papers: Enumerations of (K_4-e)-designs with small orders

As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently…

In each characteristic $p\neq 2, 3$, it was shown in a previous work that the order of an automorphism of a K3 surface is bounded by 66, if finite. Here, it is shown that in each characteristic $p\neq 2, 3$ a K3 surface with a cyclic action…

We construct supplementary difference sets (SDS) with parameters $(59;28,22;21)$, $(69;31,27;24)$, $(75;36,29;28)$, $(77;34,31;27)$ and $(87;38,36;31)$. These SDSs give D-optimal designs (DO-designs) of two-circulant type of orders…

For positive integers $n$ and $k$ with $n \geq k$, an $(n,k,1)$-design is a pair $(V, \mathcal{B})$ where $V$ is a set of $n$ points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ called blocks such that each pair of points occur…

Let $n=2^k-1$ and $m=2^{k-2}$ for a certain $k\ge 3$. Consider the point-line geometry of $2m$-element subsets of an $n$-element set. Maximal singular subspaces of this geometry correspond to binary simplex codes of dimension $k$. For $k\ge…

We consider the problem of finding the minimal number of points required to intersect all lines in an affine space over the finite field of order 3. We also consider the problem of finding the minimal number of points required to intersect…

A maximal arc of degree k in a finite projective plane P of order q = ks is a set of (q-s+1)k points that meets every line of P in either k or 0 points. The collection of the nonempty intersections of a maximal arc with the lines of P is a…

Some fine gradings on the exceptional Lie algebras $\mathfrak{e}_6$, $\mathfrak{e}_7$ and $\mathfrak{e}_8$ are described. This list tries to be exhaustive.

The study of symmetric configurations $v_3$ with block size 3 has a long and rich history. In this paper we consider two colouring problems which arise naturally in the study of these structures. The first of these is weak colouring, in…

This paper provides triangular spherical designs for the complex unit sphere $\Omega^d$ by exploiting the natural correspondence between the complex unit sphere in $d$ dimensions and the real unit sphere in $2d-1$. The existence of…

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…

We give the first example of a mosaic of three combinatorial designs with distinct parameters $2$-$(13,3,1)$, $2$-$(13,4,2)$, and $2$-$(13,6,5)$. Furthermore, we give examples of mosaics of $2$-$(9,3,2)$ designs that are not resolvable,…

A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…

In this paper, we consider the existence of group divisible designs (GDDs) with block size $4$ and group sizes $4$ and $7$. We show that there exists a 4-GDD of type $4^t 7^s$ for all but a finite specified set of feasible values for $(t,…

We detail the enumeration of all two-intersection sets of the five-dimensional projective space over the field of order 3 that are invariant under an element of order 7, which include the examples of Hill (1973) and Gulliver (1996). Up to…

This paper is the second in a series of works on weak convergence of one-step schemes for solving stochastic differential equations (SDEs) with one-sided Lipschitz conditions. It is known that the super-linear coefficients may lead to a…

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find…

One of the best things about geometry is that it's cool! Geometry enables us to create incredible designs and astounding patterns. This article shows how to use a simple technique (iteration) to create designs that are both cool and…

The dual codes of the ternary linear codes of the residual designs of biplanes on 56 points are used to prove the nonexistence of quasi-symmetric 2-$(56,12,9)$ and 2-$(57,12,11)$ designs with intersection numbers 0 and 3, and the…

Kreck's modified surgery theory reduces the classification of closed, connected 4-manifolds, up to connect sum with some number of copies of $S^2\times S^2$, to a series of bordism questions. We implement this in the case of unorientable…