中文
相关论文

相关论文: Determining Sidon Polynomials on Sidon Sets over $…

200 篇论文

We define and study when a polynomial mapping has a local or global time average. We conjecture that a polynomial f in the complex plane has a time average near a point z if and only if z is eventually mapped into a Siegel-disc of f. We…

复变函数 · 数学 2007-12-03 Han Peters

We prove that for any $\epsilon>0$ and any trigonometric polynomial $f$ with frequencies in the set $\{n^3: N \leq n\leq N+N^{2/3-\epsilon}\}$, one has $$ \|f\|_4 \ll \epsilon^{-1/4}\|f\|_2 $$ with implied constant being absolute. We also…

经典分析与常微分方程 · 数学 2024-03-12 Mikhail R. Gabdullin , Sergei V. Konyagin

A polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called \emph{monogenic} if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

数论 · 数学 2022-04-19 Joshua Harrington , Lenny Jones

We construct classes of permutation polynomials over F_{Q^2} by exhibiting classes of low-degree rational functions over F_{Q^2} which induce bijections on the set of (Q+1)-th roots of unity in F_{Q^2}. As a consequence, we prove two…

数论 · 数学 2013-10-08 Michael Zieve

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

数论 · 数学 2018-10-16 Oleksiy Klurman , Marc Munsch

Polynomial maps attached to polynomials of an Ore extension are naturally defi ned. In this setting we show the importance of pseudo-linear transformations and give some applications. In particular, factorizations of polynomials in an Ore…

环与代数 · 数学 2012-08-02 André Leroy

The characteristic polynomials of abelian varieties over the finite field $\mathbb{F}_q$ with $q=p^n$ elements have a lot of arithmetic and geometric information. They have been explicitly described for abelian varieties up to dimension 4,…

数论 · 数学 2021-09-02 Daiki Hayashida

We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.

数论 · 数学 2022-08-09 Wade Hindes , Reiyah Jacobs , Peter Ye

The probability for two monic polynomials of a positive degree n with coefficients in the finite field F_q to be relatively prime turns out to be identical with the probability for an n x n Hankel matrix over F_q to be nonsingular.…

组合数学 · 数学 2011-02-10 Mario Garcia Armas , Sudhir R. Ghorpade , Samrith Ram

We investigate monogenicity and prime splitting in extensions generated by roots of iterated quadratic polynomials. Let $f(x)\in\mathbb{Z}[x]$ be an irreducible, monic, quadratic polynomial, and write $f^n(x)$ for the $n^{\text{th}}$…

数论 · 数学 2024-06-07 Hanson Smith , Zack Wolske

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…

信息论 · 计算机科学 2019-07-09 Xiaogang Liu

In this paper we propose a way to construct classical type Sobolev orthogonal polynomials. We consider two families of hypergeometric polynomials: ${}_2 F_2(-n,1;q,r;x)$ and ${}_3 F_2(-n,n-1+a+b,1;a,c;x)$ ($a,b,c,q,r>0$, $n=0,1,...$), which…

经典分析与常微分方程 · 数学 2019-02-12 Sergey M. Zagorodnyuk

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

数论 · 数学 2020-06-09 Biswajit Koley , A. Satyanarayana Reddy

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

数论 · 数学 2015-02-11 Alexandra Shlapentokh

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

数论 · 数学 2012-10-03 Ayah Almousa , Melanie Matchett Wood

For each prime p other than 3, and each power q=p^k, we present two large classes of permutation polynomials over F_{q^2} of the form X^r B(X^{q-1}) which have at most five terms, where B(X) is a polynomial with coefficients in {1,-1}. The…

数论 · 数学 2025-01-09 Zhiguo Ding , Michael E. Zieve

Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…

群论 · 数学 2019-03-27 Sabina B. Pannek

In this paper we consider the generalized Catalan numbers F(s,n)= 1/((s-1)n+1) binom{sn}{n}. We find all $n$ such that for $p$ prime, p^q divides F(p^q,n), q>=1. As a byproduct we settle a question of Hough and the late Simion on the…

数论 · 数学 2007-05-23 Pantelimon Stanica

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

交换代数 · 数学 2012-10-09 Joost Berson

Let $q$ be a power of a prime $p$, let $\mathbb F_q$ be the finite field with $q$ elements and, for each nonconstant polynomial $F\in \mathbb F_{q}[X]$ and each integer $n\ge 1$, let $s_F(n)$ be the degree of the splitting field (over…

数论 · 数学 2025-08-13 Lucas Reis