Related papers: The covering radius of permutation designs

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…

Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find…

The concept of a covering system was first introduced by Erd\H{o}s in 1950. Since their introduction, a lot of the research regarding covering systems has focused on the existence of covering systems with certain restrictions on the moduli.…

We establish upper and lower bounds on the dimension of the space spanned by the symmetric powers of the natural character of generalised symmetric groups. We adapt the methods of Savitt and Stanley from their paper `A note on the symmetric…

This paper explores the partition properties of roller coaster permutations, a class of permutations characterized by maximizing the number of alternating runs in all subsequences. We establish a connection between the structure of these…

We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n-1)/2$ adjacent transpositions. We show that, if we allow…

We investigate $p$-ary $t$-designs which are simultaneously designs for all $t$, which we call universal $p$-ary designs. Null universal designs are well understood due to Gordon James via the representation theory of the symmetric group.…

Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…

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…

A Euclidean $t$-design, as introduced by Neumaier and Seidel (1988), is a finite set ${\cal X} \subset \mathbb{R}^n$ with a weight function $w: {\cal X} \rightarrow \mathbb{R}^+$ for which $$\sum_{r \in R} W_r \overline{f}_{S_{r}} =…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the $t$-adesign, which was coined by Cunsheng Ding in 2015. It is clear that $2$-adesigns are a kind of partially balanced…

Butson matrices are complex Hadamard matrices with entries in the complex roots of unity of given order. There is an interesting code in phase space related to this matrix (Armario et al. 2023). We study the covering radius of Butson…

A set of permutations of $\{1,2,\dots,n\}$ is $t$-intersecting if any two permutations agree on at least $t$ inputs. A recent work by Kupavskii, in the spirit of the Erd\H{o}s-Ko-Rado Theorem, shows that for all $t\leq…

We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…

In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recently, we introduced Stirling permutation code and provided…

In this paper, we present a method for constructing point primitive block transitive $t$-designs invariant under finite groups. Furthermore, we demonstrate that every point and block primitive $G$-invariant design can be generated using…

The concept of spherical $t$-design, which is a finite subset of the unit sphere, was introduced by Delsarte-Goethals-Seidel (1977). The concept of Euclidean $t$-design, which is a two step generalization of spherical design in the sense…