English
Related papers

Related papers: Further results on complete permutation monomials …

200 papers

$n$-cycle permutations with small $n$ have the advantage that their compositional inverses are efficient in terms of implementation. They can be also used in constructing Bent functions and designing codes. Since the AGW Criterion was…

Information Theory · Computer Science 2023-03-10 Tailin Niu , Kangquan Li , Longjiang Qu , Bing Sun

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

Number Theory · Mathematics 2007-05-23 N. A. Carella

Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation…

Information Theory · Computer Science 2019-06-18 Xiaogang Liu

We obtain some properties of a class $\mathcal{A}$ of $q$-hypergeometric orthogonal polynomials with $q=-1$, described by a uniform parametrization of the recurrence coefficients. We construct a class $\mathcal{C}$ of complementary $-1$…

Classical Analysis and ODEs · Mathematics 2025-10-03 Luis Verde-Star

Let $\mathbb{F}_q$ be a finite field of odd characteristic containing $q$ elements and integer $n\ge 1$. In this paper, the explicit factorization of $x^{2^nd}-1$ over $\mathbb{F}_q$ is obtained when $d$ is an odd divisor of $q+1$.

Combinatorics · Mathematics 2018-07-03 Manjit Singh

Over a field of characteristic two, we develop a theory of standard monomials for polynomial rings modulo a Frobenius power of the maximal ideal generated by all variables. As a result, we obtain a filtration by modular GL_n-representations…

Commutative Algebra · Mathematics 2023-11-10 Laura Casabella , Teresa Yu

We propose a conjectural explicit formula of generating series of a new type for Gromov--Witten invariants of $\mathbb{P}^1$ of all degrees in full genera.

Algebraic Geometry · Mathematics 2025-05-23 Boris Dubrovin , Di Yang

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Rings and Algebras · Mathematics 2008-10-03 F. Cedo , E. Jespers , J. Okninksi

In this paper, motivated by the work of Chapman, Vsemirnov and Sun et al., we investigate some arithmetic properties of the generalized Legendre matrices over finite fields. For example, letting $a_1,\cdots,a_{(q-1)/2}$ be all non-zero…

Number Theory · Mathematics 2024-04-02 Ning-Liu Wei , Yu-Bo Li , Hai-Liang Wu

In 2012, for any integer $n \ge 2$, Kedlaya constructed an infinite class of monic irreducible polynomials of degree $n$ with integer coefficients having squarefree discriminants. Such polynomials are necessarily monogenic. Further, by…

Number Theory · Mathematics 2025-06-23 Rupam Barman , Anuj Narode , Vinay Wagh

In this paper we study some generalized versions of a recent result due to Covert, Koh, and Pi (2015). More precisely, we prove that if a subset $\mathcal{E}$ in a regular variety satisfies $|\mathcal{E}|\gg…

Number Theory · Mathematics 2016-08-24 Pham Van Thang , Do Duy Hieu

The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…

Number Theory · Mathematics 2025-08-05 Xuan Pang , Yangcheng Li , Pingzhi Yuan , Yuanpeng Zeng

For a half-integral weight modular form $f = \sum_{n=1}^{\infty} a_f(n)n^{\frac{k-1}{2}} q^n$ of weight $k = l +\frac{1}{2}$ on $\Gamma_0(4)$ such that $a_f(n)$ ($n$ $\in$ $\mathbb{N}$) are real, we prove for a fixed suitable natural number…

Number Theory · Mathematics 2016-03-22 Srilakshmi Krishnamoorthy , M. Ram Murty

Denote by $\mathbb F_q$ the finite field of order $q$ and by $\mathbb F_{q^n}$ its extension of degree $n$. Some $a\in\mathbb F_{q^n}$ is called primitive if it generates the multiplicative group $\mathbb F_{q^n}^*$ and it is called…

Number Theory · Mathematics 2025-11-21 Theodoulos Garefalakis , Giorgos Kapetanakis

We give a classification of all irreducible completely pointed $U_q(\mathfrak{sl}_{n+1})$ modules over a characteristic zero field in which $q$ is not a root of unity. This generalizes the classification result of Benkart, Britten and…

Representation Theory · Mathematics 2020-06-09 V. Futorny , J. Hartwig , E. Wilson

In this work, we completely characterize (i) permutation binomials of the form $x^{{{2^n -1}\over {2^t-1}}+1}+ ax \in \mathbb{F}_{2^n}[x], n = 2^st, a \in \mathbb{F}_{2^{2t}}^{*}$, and (ii) permutation trinomials of the form…

Number Theory · Mathematics 2016-05-12 Srimanta Bhattacharya , Sumanta Sarkar

Assume that $X= {x_1,...,x_g}$ is a finite alphabet and $K$ is a field. We study monomial algebras $A= K <X> /(W)$, where $W$ is an antichain of Lyndon words in $X$ of arbitrary cardinality. We find a Poincar\'{e}-Birkhoff-Witt type basis…

Rings and Algebras · Mathematics 2016-09-30 Tatiana Gateva-Ivanova , Gunnar Fløystad

In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the…

Information Theory · Computer Science 2026-01-05 Eduardo Camps-Moreno , Jun Bo Lau , Hiram H. López , Welington Santos

Let $\mathbb{F}_q$ be the finite field of characteristic $p$ with $q$ elements and $\mathbb{F}_{q^n}$ its extension of degree $n$. The conjecture of Morgan and Mullen asserts the existence of primitive and completely normal elements (PCN…

Number Theory · Mathematics 2019-05-09 Theodoulos Garefalakis , Giorgos Kapetanakis

An almost perfect nonlinear (APN) function (necessarily a polynomial function) on a finite field $\mathbb{F}$ is called exceptional APN, if it is also APN on infinitely many extensions of $\mathbb{F}$. In this article we consider the most…

Information Theory · Computer Science 2012-07-25 Moises Delgado , Heeralal Janwa