On invariant fields of vectors and covectors

Let ${\mathbb{F}}_q$ be the finite field of order q. Let G be one of the three groups $\mathrm{GL}(n,{\mathbb{F}}_q)$, $\mathrm{SL}(n,{\mathbb{F}}_q)$ or $\mathrm{U}(n,{\mathbb{F}}_q)$ and let W be the standard n-dimensional representation of G. For non-negative integers m and d we let $mW\oplus d{W}^{?}$ denote the representation of G given by the direct sum of m vectors and d covectors. We exhibit a minimal set of homogeneous invariant polynomials $\{{?}_1,{?}_2,\dots ,{?}_{(m+d)n}\}?{\mathbb{F}}_q{[mW\oplus d{W}^{?}]}^G$ such that ${\mathbb{F}}_q{(mW\oplus d{W}^{?})}^G={\mathbb{F}}_q({?}_1,{?}_2,\dots ,{?}_{(m+d)n})$ for all cases except when $md=0$ and $G=\mathrm{GL}(n,{\mathbb{F}}_q)$ or $\mathrm{SL}(n,{\mathbb{F}}_q)$.     

Highly nonlinear functions over finite fields

We consider a generalisation of a conjecture by Patterson and Wiedemann from 1983 on the Hamming distance of a function from ${\mathbb{F}}_q^n$ to ${\mathbb{F}}_q$ to the set of affine functions from ${\mathbb{F}}_q^n$ to ${\mathbb{F}}_q$. We prove the conjecture for each q such that the characteristic of ${\mathbb{F}}_q$ lies in a subset of the primes with density 1 and we prove the conjecture for all q by assuming the generalised Riemann hypothesis. Roughly speaking, we show the existence of functions for which the distance to the affine functions is maximised when n tends to infinity. This also determines the asymptotic behaviour of the covering radius of the $[q^n,n+1]$ Reed-Muller code over ${\mathbb{F}}_q$ and so answers a question raised by Leducq in 2013. Our results extend the case $q=2$, which was recently proved by the author and which corresponds to the original conjecture by Patterson and Wiedemann. Our proof combines evaluations of Gauss sums in the semiprimitive case, probabilistic arguments, and methods from discrepancy theory.     

Galois LCD codes over mixed alphabets

In this work we give a characterization of Galois Linear Complementary Dual codes and Galois-invariant codes over mixed alphabets of finite chain rings, which leads to the study of the Gray image of ${\mathbb{F}}_p{\mathbb{F}}_p[\theta ]$-linear codes, where $p\in \{2;3\}$ and $\theta \ne {\theta }^2=0$ that provides LCD codes over ${\mathbb{F}}_p$.     

Invariant polynomials on truncated multicurrent algebras

We construct invariant polynomials on truncated multicurrent algebras, which are Lie algebras of the form $\mathfrak{g}{?}_{\mathbb{F}}\mathbb{F}[t_1,\dots ,t_{?}]/I$, where $\mathfrak{g}$ is a finite-dimensional Lie algebra over a field $\mathbb{F}$ of characteristic zero, and I is a finite-codimensional ideal of $\mathbb{F}[t_1,\dots ,t_{?}]$ generated by monomials. In particular, when $\mathfrak{g}$ is semisimple and $\mathbb{F}$ is algebraically closed, we construct a set of algebraically independent generators for the algebra of invariant polynomials. In addition, we describe a transversal slice to the space of regular orbits in $\mathfrak{g}{?}_{\mathbb{F}}\mathbb{F}[t_1,\dots ,t_{?}]/I$. As an application of our main result, we show that the center of the universal enveloping algebra of $\mathfrak{g}{?}_{\mathbb{F}}\mathbb{F}[t_1,\dots ,t_{?}]/I$ acts trivially on all irreducible finite-dimensional representations provided I has codimension at least two.     

Perfect squares representing the number of rational points on elliptic curves over finite field extensions

Let q be a perfect power of a prime number p and $E({\mathbb{F}}_q)$ be an elliptic curve over ${\mathbb{F}}_q$ given by the equation $y^2=x^3+Ax+B$. For a positive integer n we denote by $\mathrm{\#}E({\mathbb{F}}_{q^n})$ the number of rational points on E (including infinity) over the extension ${\mathbb{F}}_{q^n}$. Under a mild technical condition, we show that the sequence ${\{\mathrm{\#}E({\mathbb{F}}_{q^n})\}}_{n>0}$ contains at most 10²⁰⁰ perfect squares. If the mild condition is not satisfied, then $\mathrm{\#}E({\mathbb{F}}_{q^n})$ is a perfect square for infinitely many n including all the multiples of 12. Our proof uses a quantitative version of the Subspace Theorem. We also find all the perfect squares for all such sequences in the range $q<50$ and $n\le 1000$.     

Realization of PBW-deformations of type An quantum groups via multiple Ore extensions

The notion of multiple Ore extension is introduced as a natural generalization of Ore extensions and double Ore extensions. For a PBW-deformation ${\mathfrak{B}}_q(\mathfrak{sl}(n+1,\mathbb{C}))$ of type ${\mathbb{A}}_n$ quantum group, we explicitly obtain the commutation relations of its root vectors, then show that it can be realized via a series of multiple Ore extensions, which we call a ladder Ore extension of type $(1,2,?,n)$. Moreover, we analyze the quantum algebras ${\mathfrak{B}}_q(\mathfrak{g})$ with $\mathfrak{g}$ of type ${\mathbb{D}}_4$, ${\mathbb{B}}_2$ and ${\mathbb{G}}_2$ and give some examples and counterexamples that can be realized by a ladder Ore extension.     

A note on character sums in function fields

We give an improvement on a character sum estimate in ${\mathbb{F}}_q[t]$ and answer a question of Shparlinski.     

Quantum MDS codes with new length and large minimum distance

According to the well-known CSS construction, constructing quantum MDS codes are extensively investigated via Hermitian self-orthogonal generalized Reed-Solomon (GRS) codes. In this paper, given two Hermitian self-orthogonal GRS codes $GR{S}_{k_1}(A,{\mathit{v}}_A)$ and $GR{S}_{k_2}(B,{\mathit{v}}_B)$, we propose a sufficient condition to ensure that $GR{S}_k(A\cup B,{\mathit{v}}_{A\cup B})$ is still a Hermitian self-orthogonal code. Consequently, we first present a new general construction of infinitely families of quantum MDS codes from known ones. Moreover, applying the trace function and norm function over finite fields, we give another two new constructions of quantum MDS codes with flexible parameters. It turns out that the forms of the lengths of our quantum MDS codes are quite different from previous known results in the literature. Meanwhile, the minimum distances of all the q-ary quantum MDS codes are bigger than $q/2+1$.     

The estimated number of irreducible binomials

Let ${\mathbb{F}}_q$ be the finite field with q elements, and T a positive integer. In this article, we find an asymptotic formula for the total number of monic irreducible binomials in ${\mathbb{F}}_q[x]$ of degree less or equal to T, when T is large enough. We also show explicit lower and upper bounds for the number of binomials in the case when T is small.