Related papers: A characterization of exceptional pseudocyclic ass…
Given a prime $p$, we construct a permutation group containing at least $p^{p-2}$ non-conjugated regular elementary abelian subgroups of order $p^3$. This gives the first example of a permutation group with exponentially many non-conjugated…
The projective general linear group $\mathrm{PGL}_2(\mathrm{GF}(2^m))$ acts as a $3$-transitive permutation group on the set of points of the projective line. The first objective of this paper is to prove that all linear codes over…
We define a notion of super-transitivity for \`etale algebra objects $A \in \mathcal{C}(\mathfrak{sl}_N, k)$. This definition is a direct analogue of the notion of super-transitivity for subfactors, and measures at what depth the first…
Ellis and the third author showed, verifying a conjecture of Frankl, that any $3$-wise intersecting family of subsets of $\{1,2,\dots,n\}$ admitting a transitive automorphism group has cardinality $o(2^n)$, while a construction of Frankl…
In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize…
This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…
We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
We completely determine the autotopism group of the (as of now) largest family of commutative semifields found by G\"olo\u{g}lu and K\"olsch. Since this family of semifields generally does not have large nuclei, this process is considerably…
Reductive W-algebras which are generated by bosonic fields of spin-1, a single spin-2 field and fermionic fields of spin-3/2 are classified. Three new cases are found: a `symplectic' family of superconformal algebras which are extended by…
We study finite groups arising from configurations of pairwise skew lines in $\mathbb{P}^3_K$. To such a configuration ${L}$ one associates a group $G_{L}\subset \mathrm{PGL}_2(K)$ acting on each line, and we investigate which finite…
In this paper, we provide a complete classification of $2$-$(v,k,2)$ design admitting a flag-transitive automorphism group of affine type with the only exception of the semilinear $1$-dimensional group. Alongside this analysis we provide a…
An irreducible character $\chi$ of an association scheme is called nonlinear if the multiplicity of $\chi$ is greater than $1$. The main result of this paper gives a characterization of commutative association schemes with at most two…
We consider the Siegel modular variety of genus 2 and a p-integral model of it for a good prime p>2, which parametrizes principally polarized abelian varieties of dimension two with a level structure. We consider cycles on this model which…
For all Frobenius groups and a large class of finite multiply transitive permutation groups, we show that the corresponding group-subgroup subfactors are completely characterized by their principal graphs. The class includes all the sharply…
We say that a group G acts infinitely transitively on a set X if for every integer m the induced diagonal action of G is transitive on the cartesian mth power of X with the diagonals removed. We describe three classes of affine algebraic…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allow many problems that are NP-hard on arbitrary graphs to be…
A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. For a prime p, we call a bi-Cayley graph over a metacyclic p-group a bi-p-metacirculant.…
The \emph{intersection density} of a transitive permutation group $G\leq \operatorname{Sym}(\Omega)$ is the ratio between the largest size of a subset of $G$ in which any two agree on at least one element of $\Omega$, and the order of a…