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

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…

A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…

Let $\mathcal{D}$ be a block design admitting a locally transitive automorphism group $G$. We say that $\mathcal{D}$ is $G$-point-locally dihedral if the induced local action $G_x^{\mathcal{D}}$ is dihedral for each point $x$, and that…

We design an algorithm to find certain partial permutation representations of a finitely presented group $G$ (the bricks) that may be combined to a transitive permutation representation of $G$ (the mosaic) on the disjoint union.

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

Given a transitive permutation group G of degree n , we seek to determine whether or not G is primitive, and to find a system of blocks of imprimitivity in the case that G is imprimitive. An algorithm of Atkinson solves this problem in time…

Group action is a standard approach to obtain $t$-designs. In this approach, selecting a specific permutation group with a certain degree of transitivity or homogeneity and a proper set of base blocks is important for obtaining $t$-$(v, k,…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

Let $q$ be a prime power and $V\cong{\mathbb F}_q^n$. A $t$-$(n,k,\lambda)_q$ design, or simply a subspace design, is a pair ${\mathcal D}=(V,{\mathcal B})$, where ${\mathcal B}$ is a subset of the set of all $k$-dimensional subspaces of…

We prove finite generation of the algebras of invariants for a class of linear actions of suitable non-reductive groups on projective and affine varieties, and give a geometric construction for their GIT quotients.

In this paper, we show that when two systems of differential equations admitting a symmetry group are related by a point transformation it is always possible to generate invariant schemes, one for each system, that are also related by the…

In this article, we prove that for all pairs of primitive Pisot or uniform substitutions with the same dominating eigenvalue, there exists a finite set of block maps such that every block map between the corresponding subshifts is an…

We present a complete algebraic description of the field of first-order joint projective invariants for configurations of \( n \) points in the plane, under the natural diagonal action of the projective group \( PGL(3,\mathbb{R}) \). For \(…

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…

For any finite group G with a finite G-set X and a modular tensor category C we construct a part of the algebraic structure of an associated G-equivariant monoidal category: For any group element g in G we exhibit the module category…

In this paper, we consider the existence of group divisible designs (GDDs) with block size $4$ and group sizes $4$ and $7$. We show that there exists a 4-GDD of type $4^t 7^s$ for all but a finite specified set of feasible values for $(t,…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…

We view a design $\mathcal{D}$ as a set of $k$-subsets of a fixed set $X$ of $v$ points. A $k$-subset of $X$ is at distance $i$ from $\mathcal{D}$ if it intersects some $k$-set in $\mathcal{D}$ in $k-i$ points, and no subset in more than…

Let $\mathcal{D} = (\mathcal{P}, \mathcal{B})$ be a $2$-$(v, k, \lambda)$ design, and let $G$ be a half-flag-transitive automorphism group of ${\cal D}$. In this article, we first establish three sufficient conditions for $G$ to be…