中文
相关论文

相关论文: Diophantine approximation of polynomials over $\ma…

200 篇论文

Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…

数论 · 数学 2022-10-25 Wei Cao , Daqing Wan

Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q^*$ such that $F(a_1, a_2, \ldots, a_k)$ is a…

数论 · 数学 2025-05-09 Chi Hoi Yip , Semin Yoo

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper…

数论 · 数学 2014-07-29 Oliver Roche-Newton , Igor Shparlinski

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…

数论 · 数学 2019-08-15 Sam Porritt

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

We prove analogues of some classical results from Diophantine approximation and metric number theory (namely Dirichlet's theorem and the Duffin--Schaeffer theorem) in the setting of diagonal Diophantine approximation, i.e. approximating…

数论 · 数学 2016-10-27 Matthew Palmer

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

数论 · 数学 2016-05-25 Andreas Weingartner

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

数论 · 数学 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

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

It is well known that there exists a significant equivalence between the vector space $\mathbb{F}_{q}^n$ and the finite fields $\mathbb{F}_{q^n}$, and many scholars often view them as the same in most contexts. However, the precise…

数论 · 数学 2025-04-10 Pingzhi Yuan , Xuan Pang , Danyao Wu

We attach a ring of sequences to each number from a certain class of extremal real numbers, and we study the properties of this ring both from an analytic point of view by exhibiting elements with specific behaviors, and also from an…

数论 · 数学 2013-01-07 Damien Roy , Eric Villani

Consider a form $g(x_1,...,x_s)$ of degree $d$, having coefficients in the completion $F_q((1/t))$ of the field of fractions $F_q(t)$ associated to the finite field $F_q$. We establish that whenever $s>d^2$, then the form $g$ takes…

数论 · 数学 2015-07-03 Craig V. Spencer , Trevor D. Wooley

For an arbitrary $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ we study the problem of finding those $q$-polynomials $g$ over $\mathbb{F}_{q^n}$ for which the image sets of $f(x)/x$ and $g(x)/x$ coincide. For $n\leq 5$ we provide sufficient…

组合数学 · 数学 2020-09-17 Bence Csajbók , Giuseppe Marino , Olga Polverino

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

信息论 · 计算机科学 2013-08-28 Pingzhi Yuan , Cunsheng Ding

Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…

环与代数 · 数学 2026-01-15 Maithri K. , Vadiraja Bhatta G. R. , Indira K. P. , Prasanna Poojary

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

交换代数 · 数学 2008-06-10 Luis F. Caceres , Jose A. Velez-Marulanda

Let $\mathcal{R}$ be a finite valuation ring of order $q^r$. In this paper we generalize and improve several well-known results, which were studied over finite fields $\mathbb{F}_q$ and finite cyclic rings $\mathbb{Z}/p^r\mathbb{Z}$, in the…

组合数学 · 数学 2016-11-22 Pham Van Thang , Le Anh Vinh

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

数论 · 数学 2022-11-17 László Mérai , Igor E. Shparlinski , Arne Winterhof

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

组合数学 · 数学 2020-02-21 Zhang Zihan , Han Dongchun

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…

数论 · 数学 2015-03-19 Dijana Kreso , Robert F. Tichy
‹ 上一页 1 2 3 10 下一页 ›