Related papers: Higher-dimensional grid-imprimitive block-transiti…
This paper studies the problem of learning the large-scale Gaussian graphical models that are multivariate totally positive of order two ($\text{MTP}_2$). By introducing the concept of bridge, which commonly exists in large-scale sparse…
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…
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. 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…
The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…
We study vertex-quasiprimitive $2$-arc-transitive digraphs, reducing the problem of vertex-primitive $2$-arc-transitive digraphs to almost simple groups. This includes a complete classification of vertex-quasiprimitive $2$-arc-transitive…
A combinatorial block design $D$ is called $3$-pyramidal if there exists a subgroup $G$ of $\mbox{Aut}(D)$ fixing $3$ points and acting regularly on the other points. If this happens, we say that the design is $3$-pyramidal under $G$. In…
One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L. Teirlinck has shown that non-trivial…
Determining an upper bound on $s$ for finite vertex-primitive $s$-arc-transitive digraphs has received considerable attention dating back to a question of Praeger in 1990. It was shown by Giudici and Xia that the smallest upper bound on $s$…
Commutative rings of one-dimensional difference operators of rank l>1 and their deformations are effectively constructed. Our analytical constructions are based on the so-called ''Tyurin parameters'' for the stable framed holomorphic vector…
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…
There are several approaches to define an eigenvector decomposition of the finite Fourier Transform, which is in some sense unique, and at best resembles the eigenstates of the quantum harmonic oscillator. A solution given by Balian and…
A partial linear space is a point--line incidence structure such that each line is incident with at least two points and each pair of points is incident with at most one line. It is said to be proper if there exists at least one…
For nearly a century, mathematicians have been developing techniques for constructing abelian automorphism groups of combinatorial objects, and, conversely, constructing combinatorial objects from abelian groups. While abelian groups are a…
Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…
A finite transitive permutation group is said to be 3/2-transitive if all the nontrivial orbits of a point stabilizer have the same size greater than 1. Examples include the 2-transitive groups, Frobenius groups and several other less…
The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper we…
In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…
In this paper, we construct new families of flag-transitive linear spaces with $q^{2n}$ points and $q^{2}$ points on each line that admit a one-dimensional affine automorphism group. We achieve this by building a natural connection with…
Given any triplet of positive integers $n \geq 2$, $m$ and $k$ such that $n=m+k$, we exhibit a $C^1$ robustly transitive endomorphism of $\mathbb{T}^n$ with persistent critical points in the isotopy class of $F \times Id$, where $F$ is an…