Related papers: Some new designs with prescribed automorphism grou…

We give a uniform construction of the finite simple groups $E_6(q)$, $F_4(q)$ and ${}^2E_6(q)$, which does not require any special treatment for characteristics 2 or 3, and in particular avoids any mention of quadratic Jordan algebras.…

Graphs with high symmetry or regularity are the main source for experimentally hard instances of the notoriously difficult graph isomorphism problem. In this paper, we study the computational complexity of isomorphism testing for line…

Designing a computational imaging system -- selecting operators, setting parameters, validating consistency -- requires weeks of specialist effort per modality, creating an expertise bottleneck that excludes the broader scientific community…

Given integers $d\ge 3$ and $N\ge 3$. Let $G$ be a finite abelian group acting faithfully and linearly on a smooth hypersurface of degree $d$ in the complex projective space $\mathbb{P}^{N-1}$. Suppose $G\subset PGL(N, \mathbb{C})$ can be…

We show that the automorphism groups of certain countable structures obtained using the Hrushovski amalgamation method are simple groups. The structures we consider are the 'uncollapsed' structures of infinite Morley rank obtained by the ab…

The two basic equations satisfied by the parameters of a block design define a three-dimensional affine variety $\mathcal{D}$ in $\mathbb{R}^{5}$. A point of $\mathcal{D}$ that is not in some sense trivial lies on four lines lying in…

We study automorphisms of the Hilbert scheme of $n$ points on a generic projective K3 surface $S$, for any $n \geq 2$. We show that the automorphism group of $S^{[n]}$ is either trivial or generated by a non-symplectic involution and we…

In this paper we provide a $4$-GDD of type $2^2 5^5$, thereby solving the existence question for the last remaining feasible type for a $4$-GDD with no more than $30$ points. We then show that $4$-GDDs of type $2^t 5^s$ exist for all but a…

In this paper we extend the construction of Giudici, Morgan and Zhou [arXiv:2110.07896] to give the first known examples of nonregular, $2$-closed permutation groups of rank greater than $4$ that are not the automorphism group of any…

We study the local symplectic algebra of curves with semigroups $(4,5,6,7)$, $(4,5,6)$ and $(4,5,7)$. We use the method of algebraic restrictions to parameterized curves as in \cite{D1}. A new discrete invariant for algebraic restrictions…

It is a simple fact that a group has a trivial automorphism group if and only if it is of order $1$ or $2$. We prove that the same holds for certain families of skew braces, and given any odd prime $p$, we construct a skew brace of order…

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. In 2014 Babai proved that the…

In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Gra{\ss}mannian into joins are discussed. This framework admits a generalization of large set recursion methods for block designs to…

Strong difference families are an interesting class of discrete structures which can be used to derive relative difference families. Relative difference families are closely related to $2$-designs, and have applications in constructions for…

We prove that an automorphism of order 3 of a putative binary self-dual [120, 60, 24] code C has no fixed points. Moreover, the order of the automorphism group of C divides 2^a.3.5.7.19.23.29 where a is a nonegative integer. Automorphisms…

We study linear systems of surfaces in $\mathbb{P}^3$ singular along general lines. Our purpose is to identify and classify special systems of such surfaces, i.e., those nonempty systems where the conditions imposed by the multiple lines…

We study the orthogonal quantum groups satisfying the ``easiness'' assumption axiomatized in our previous paper, with the construction of some new examples, and with some partial classification results. The conjectural conclusion is that…

It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. Babai conjectured that if a primitive…