Related papers: Quasi-symmetric designs on 56 points
A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points such that every two blocks intersect each other in $\lambda$ points (and $\lambda < v$ is a fixed number) and…
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…
This paper investigates $2$-$(v,5,\lambda)$ designs $\mathcal{D}$ admitting a block-transitive automorphism group $G$. We first prove that if $G$ is point-imprimitive, then $v$ must be one of 16, 21, or 81. We further provide a complete…
We consider $2$-designs which admit a group of automorphisms that is flag-transitive and leaves invariant a chain of nontrivial point-partitions. We build on our recent work on $2$-designs which are block-transitive but not necessarily…
A $(v, k, \lambda)$ symmetric design is said to have the symmetric difference property (SDP) if the symmetric difference of any three blocks is either a block or the complement of a block. Symmetric designs fulfilling this property have the…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
We consider nonconforming methods for symmetric elliptic problems and characterize their quasi-optimality in terms of suitable notions of stability and consistency. The quasi-optimality constant is determined and the possible impact of…
In this article, we study symmetric $(v, k, \lambda)$ designs admitting a flag-transitive and point-primitive automorphism group $G$ whose socle is a projective special unitary group of dimension at most five. We, in particular, determine…
A design is $G$-additive with $G$ an abelian group, if its points are in $G$ and each block is zero-sum in $G$. All the few known ``manageable" additive Steiner 2-designs are $\mathrm{EA}(q)$-additive for a suitable $q$, where…
Square lattice designs are often used in trials of new varieties of various agricultural crops. However, there are no square lattice designs for 36 varieties in blocks of size six for four or more replicates. Here we use three different…
More than $30$ years ago, Delandtsheer and Doyen showed that the automorphism group of a block-transitive $2$-design, with blocks of size $k$, could leave invariant a nontrivial point-partition, but only if the number of points was bounded…
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…
The crystal symmetry of a material dictates the type of topological band structures it may host, and therefore symmetry is the guiding principle to find topological materials. Here we introduce an alternative guiding principle, which we…
Quasi-polar spaces are sets of points having the same intersection numbers with respect to hyperplanes as classical polar spaces. Non-classical examples of quasi-quadrics have been constructed using a technique called pivoting [5]. We…
In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the $t$-adesign, which was coined by Cunsheng Ding in 2015. It is clear that $2$-adesigns are a kind of partially balanced…
This paper completes the classification of quasi-symmetric 2-$(64,24,46)$ designs of Blokhuis-Haemers type supported by the dual code $C^{\perp}$ of the binary linear code $C$ spanned by the lines of $AG(3,2^2)$ initiated in \cite{bgr-vdt}.…
In this paper, we give a partial solution to a new isomorphism problem about $2$-$(v,k,k-1)$ designs from disjoint difference families in finite fields and Galois rings. Our results are obtained by carefully calculating and bounding some…
A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points such that every two blocks intersect each other in $\lambda$ points (and $\lambda < v$ is a fixed number) and…
Orthogonal geometric constructions are the basis of many many quantum error-correcting codes (QEC), but strict orthogonality constraints limit design flexibility and resource efficiency. We introduce a quasi-orthogonal geometric framework…
Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known…