中文
相关论文

相关论文: A Recursive Construction of Permutation Polynomial…

200 篇论文

We construct a new family of permutation group polynomials over finite fields of arbitrary characteristic, which are special types of bivariate local permutation polynomials. For this family, we explicitly construct their companion. We also…

组合数学 · 数学 2026-02-03 Sartaj Ul Hasan , Ramandeep Kaur , Hridesh Kumar

Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…

经典分析与常微分方程 · 数学 2020-08-18 Nikolai A. Krylov

We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyclotomic polynomials can be obtained…

数论 · 数学 2010-11-23 Liping Wang , Qiang Wang

Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the…

数论 · 数学 2010-06-04 Gennady Bachman

In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…

经典分析与常微分方程 · 数学 2025-07-01 Dan Dai , Mourad E. H. Ismail , Xiang-Sheng Wang

We give iterative constructions for irreducible polynomials over F_q of degree nt^r for all nonnegative integers r, starting from irreducible polynomials of degree n. The iterative constructions correspond modulo fractional linear…

数论 · 数学 2024-07-23 Alp Bassa , Ricardo Menares

The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [Commutative semifields from projection mappings, Designs, Codes and Cryptography, 61 (2011), 187--196]. We…

组合数学 · 数学 2016-03-02 Stephen M. Gagola , Joanne L. Hall

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

数论 · 数学 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

Irreducible trinomials of given degree n over $F_2$ do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we…

环与代数 · 数学 2014-01-30 Ryul Kim , Wolfram Koepf

By using Fourier transforms of two symmetric sequences of finite orthogonal polynomials, we introduce two new classes of finite orthogonal functions and obtain their orthogonality relations via Parseval's identity.

经典分析与常微分方程 · 数学 2015-03-17 Mohammad Masjed-Jamei , Wolfram Koepf

Let $\mathscr{R}_{e,m}$ denote a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 3,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…

信息论 · 计算机科学 2026-01-16 Monika Yadav , Anuradha Sharma

Given a polynomial \( H(x) \) over \(\mathbb{F}_{q^n}\), we study permutation polynomials of the form \( x + \gamma \mathrm{Tr}(H(x)) \) over \(\mathbb{F}_{q^n}\). Let \[P_H=\{\gamma\in \mathbb{F}_{q^n} : x+\gamma \mathrm{Tr}(H(x))~\text{is…

数论 · 数学 2025-07-02 Yangcheng Li , Xuan Pang , Pingzhi Yuan , Yuanpeng Zeng

A permutation is said to be \emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on $n$ letters that avoid or contain…

组合数学 · 数学 2007-05-23 T. Mansour

The paper is devoted to produce infinite sequences of $k$-normal polynomials $F_{u}(x)\in \mathbb{F}_{q}[x]$ of degrees $np^{u} ~ (u\geq 0)$, for a suitably chosen initial $k$-normal polynomial $F_{0}(x)\in \mathbb{F}_{q}[x]$ of degree $n$…

数论 · 数学 2016-10-19 Mahmood Alizadeh , Saeid Mehrabi

In this paper we construct planar polynomials of the type $f_{A,B}(x)=x(x^{q^2}+Ax^{q}+Bx)\in \mathbb{F}_{q^3}[x]$, with $A,B \in \mathbb{F}_{q}$. In particular we completely classify the pairs $(A,B)\in \mathbb{F}_{q}^2$ such that…

组合数学 · 数学 2020-05-11 Daniele Bartoli , Matteo Bonini

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

数论 · 数学 2023-07-18 Yuji Tsuno

Let $\mathbb{F}_{q}$ be the finite field of characteristic $p$ containing $q = p^{r}$ elements and $f(x)=ax^{n} + x^{m}$ a binomial with coefficients in this field. If some conditions on the gcd of $n-m$ an $q-1$ are satisfied then this…

数论 · 数学 2019-02-20 Mohamed Ayad , Belghaba Kacem , Omar Kihel

Let $q$ be an odd prime power and $D$ be the set of monic irreducible polynomials in $\mathbb F_q[x]$ which can be written as a composition of monic degree two polynomials. In this paper we prove that $D$ has a natural regular structure by…

数论 · 数学 2019-02-13 Andrea Ferraguti , Giacomo Micheli , Reto Schnyder

In this paper we use algebraic curves and other algebraic number theory methods to show the validity of a permutation polynomial conjecture regarding $f(X)=X^{q(p-1)+1} +\alpha X^{pq}+X^{q+p-1}$, on finite fields $\mathbb{F}_{q^2}, q=p^k$,…

数论 · 数学 2024-10-31 Daniele Bartoli , Mohit Pal , Pantelimon Stanica

Studying degenerate versions of various special polynomials have become an active area of research and yielded many interesting arithmetic and combinatorial results. Here we introduce a degenerate version of polylogarithm function, called…

数论 · 数学 2020-02-12 Taekyun Kim , Dae San Kim
‹ 上一页 1 8 9 10 下一页 ›