Related papers: The permutation group of Reed-Solomon codes over a…

In this paper, we introduce a new parameter of a code, referred to as the remoteness, which can be viewed as a dual to the covering radius. Indeed, the remoteness is the minimum radius needed for a single ball to cover all codewords. After…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and parts yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof…

Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…

In this paper we provide an algorithm to classify groups of points on abelian threefolds over finite fields. The classification is given in terms of the Weil polynomial of abelian varieties in a given $\mathbb{F}_q$-isogeny class. This work…

Over a field of characteristic 0, every ring of invariants of a finite group is Cohen-Macaulay. This is not true for fields of positive characteristic. We consider permutation representations and their invariant rings over fields…

The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…

We present a new killing-a-fly-with-a-sledgehammer proof of one of the oldest results in probability which says that the probability that a random permutation on $n$ elements has no fixed points tends to $e^{-1}$ as $n$ tends to infinity.…

Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…

Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$. The polynomial is said to be unbiased if the distribution of $f(x)$ for a uniform input $x \in \mathbb{F}^n$ is close to the uniform distribution over…

Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…

We determine all permutation polynomials over F_{q^2} of the form X^r A(X^{q-1}) where, for some Q which is a power of the characteristic of F_q, the integer r is congruent to Q+1 (mod q+1) and all terms of A(X) have degrees in {0, 1, Q,…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and let $G$ be a finite group. Then $G$ is said to be $\sigma $-full if $G$ has a Hall $\sigma _{i}$-subgroup for all $i$. A subgroup $A$ of $G$ is…

Let $G$ be a finite additive abelian group with exponent $n>1$, and let $a_1,\ldots,a_{n-1}\in G$. We show that there is a permutation $\sigma\in S_{n-1}$ such that all the elements $sa_{\sigma(s)}\ (s=1,\ldots,n-1)$ are nonzero if and only…

In this paper we take a deeper look at the self conjugate reciprocal (SCR) polynomials, which towards the end of the paper aid the construction of new classes of permutation polynomials of simpler forms over $\mathbb{F}_{q^{2}}$. The paper…

We consider the action of a permutation group $G$ of order $k$ on the tropical polynomial semiring in $n$ variables. We prove that the sub-semiring of invariant polynomials is finitely generated if and only if $G$ is generated by…

We study a one-parameter family of binomial-convolution operators acting on sequences. These operators form an additive semigroup with an explicit inverse, and they subsume iterated classical binomial transforms as a special case. We…

Given a finite group $G$, we introduce the \textit{permutability degree} of $G$, as $$pd(G)=\frac{1}{|G| \ |\mathcal{L}(G)|} {\underset{X \in \mathcal{L}(G)}\sum}|P_G(X)|,$$ where $\mathcal{L}(G)$ is the subgroup lattice of $G$ and $P_G(X)$…