Related papers: Linearized trinomials with maximum kernel

We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…

$2$-to-$1$ mappings over finite fields play an important role in symmetric cryptography, in particular in the constructions of APN functions, bent functions, semi-bent functions and so on. Very recently, Mesnager and Qu \cite{MQ2019}…

We prove a robust generalization of a Sylvester-Gallai type theorem for quadratic polynomials, generalizing the result in [S'20]. More precisely, given a parameter $0 < \delta \leq 1$ and a finite collection $\mathcal{F}$ of irreducible and…

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

The Krein-like $r$-functionals of the hypergeometric orthogonal polynomials $\{p_{n}(x) \}$ with kernel of the form $x^{s}[\omega(x)]^{\beta}p_{m_{1}}(x)\ldots p_{m_{r}}(x)$, being $\omega(x)$ the weight function on the interval…

In this paper, we investigate permutation polynomials over the finite field $\mathbb F_{q^n}$ with $q=2^m$, focusing on those in the form $\mathrm{Tr}(Ax^{q+1})+L(x)$, where $A\in\mathbb F_{q^n}^*$ and $L$ is a $2$-linear polynomial over…

Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…

Let L be a finite-dimensional semisimple Lie algebra with a non-degenerate invariant bilinear form, \sigma an elliptic automorphism of L leaving the form invariant, and A a \sigma-invariant reductive subalgebra of L, such that the…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we determine all permutation trinomials over $\mathbb{F}_{2^m}$ in Zieve's paper. We prove…

The famous T. Suffridge polynomials have many extremal properties: the maximality of coefficients when the leading coefficient is maximal; the zeros of the derivative are located on the unit circle; the maximum radius of stretching the unit…

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

In this paper, we further investigate the local criterion and present a class of permutation polynomials and their compositional inverses over $ \mathbb{F}_{q^2}$. Additionally, we demonstrate that linearized polynomial over…

Let $\ell$ be an odd prime, $q$ an odd prime power such that $q \not\equiv 0 \pmod \ell$, and $m$ the order of $q$ in $\F_\ell^\times$. We propose an explicit $L$-polynomial of hyperelliptic function field $K:=\F_q(T,…

In this paper we propose a new framework for analyzing the performance of preprocessing algorithms. Our framework builds on the notion of kernelization from parameterized complexity. However, as opposed to the original notion of…

In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…

The notion of a (polynomial) kernelization from parameterized complexity is a well-studied model for efficient preprocessing for hard computational problems. By now, it is quite well understood which parameterized problems do or…