Related papers: On point and block primitive designs invariant und…

We explicitly construct a finite number of discrete components in the restriction of complementary series representations of rank one semisimple groups $G$ to rank one subgroups $G_1$. For this we use the realizations of complementary…

Let $G$ be an irreducible imprimitive subgroup of $\operatorname{GL}_n(\mathbb{F})$, where $\mathbb{F}$ is a field. Any system of imprimitivity for $G$ can be refined to a nonrefinable system of imprimitivity, and we consider the question…

In recent years a new class of symmetric-key primitives over $\mathbb{F}_p$ that are essential to Multi-Party Computation and Zero-Knowledge Proofs based protocols have emerged. Towards improving the efficiency of such primitives, a number…

Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…

The classification of flag-transitive generalised quadrangles is a long-standing open problem at the interface of finite geometry and permutation group theory. Given that all known flag-transitive generalised quadrangles are also…

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

In this article, we investigate $2$-$(v,k,\lambda)$ designs with $\gcd(r,\lambda)=1$ admitting flag-transitive automorphism groups $G$. We prove that if $G$ is an almost simple group, then such a design belongs to one of the seven infinite…

It is known that the notion of a transitive subgroup of a permutation group $G$ extends naturally to subsets of $G$. We consider subsets of the general linear group $\operatorname{GL}(n,q)$ acting transitively on flag-like structures, which…

We study quantum moment maps of $G$-invariant star products, which are a quantum analogue of the moment map for classical Hamiltonian systems. Introducing an integral representation, we show that any quantum moment map for a $G$-invariant…

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…

Our aim is to describe the theory of Cartesian decompositions preserved by some member of a large family of finite transitive permutation groups called innatelytransitive groups.

In this paper we construct structures from Mathieu group $M_{11}$. We classify transitive $t$-designs with 11, 12 and 22 points admitting a transitive action of Mathieu group $M_{11}$. Thereby we proved the existence of designs with…

We conjecture that if $G$ is a finite primitive group and if $g$ is an element of $G$, then either the element $g$ has a cycle of length equal to its order, or for some $r,m$ and $k$, the group $G\leq S_m\wr S_r$, preserving a product…

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…

We propose the method for obtaining invariants of arbitrary representations of Lie groups that reduces this problem to known problems of linear algebra. The basis of this method is the idea of a special extension of the representation…

Optimal block designs in small blocks are explored when the treatments have a natural ordering and interest lies in comparing consecutive pairs of treatments. We first develop an approximate theory which leads to a convenient multiplicative…

Invariants withstand transformations and, therefore, represent the essence of objects or phenomena. In mathematics, transformations often constitute a group action. Since the 19th century, studying the structure of various types of…

Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate…

We present a recursive construction of a (2t + 1)-wise uniform set of permutations on 2n objects using a (2t + 1) - (2n, n, \cdot) combinatorial design, a t-wise uniform set of permutations on n objects and a (2t+1)-wise uniform set of…

We classify all infinite primitive permutation groups possessing a finite point stabilizer, thus extending the seminal Aschbacher-O'Nan-Scott Theorem to all primitive permutation groups with finite point stabilizers.