中文
相关论文

相关论文: Sufficient condition for existence of special type…

200 篇论文

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

数论 · 数学 2025-10-10 Magdaléna Tinková , Pavlo Yatsyna

Let $q$ be a prime power, and let $r=nk+1$ be a prime such that $r\nmid q$, where $n$ and $k$ are positive integers. Under a simple condition on $q$, $r$ and $k$, a Gauss period of type $(n,k)$ is a normal element of $\Bbb F_{q^n}$ over…

数论 · 数学 2016-08-05 Xiang-dong Hou

We give a necessary and sufficient condition for a type of generalized power series to be algebraic over the ring of power series with coefficients in a finite field. This result extend a classical theorem of Huang-Stefanescu.

代数几何 · 数学 2019-05-21 V. M. Saavedra

We say a natural number~$n$ is abundant if $\sigma(n)>2n$, where $\sigma(n)$ denotes the sum of the divisors of~$n$. The aliquot parts of~$n$ are those divisors less than~$n$, and we say that an abundant number~$n$ is pseudoperfect if there…

数论 · 数学 2015-04-13 Douglas E. Iannucci

We find a formula for the number of permutation polynomials of degree q-2 over a finite field Fq, which has q elements, in terms of the permanent of a matrix. We write down an expression for the number of permutation polynomials of degree…

环与代数 · 数学 2013-12-18 Kwang-Yon Kim , Ryul Kim

Let $q$ be a power of a prime number $p$, $\mathbb F_q$ be a finite field with $q$ elements and $\mathcal{G}$ be a subgroup of $(\mathbb F_q,+)$ of order $p$. We give an existence criterion and an algorithm for computing maximally…

数论 · 数学 2020-11-25 Alex Samuel Bamunoba , Jonas Bergström

Let $q$ be a power of a prime number $p$, $k=\mathbb{F}_{q}(t)$ be the rational function field over finite field $\mathbb{F}_{q}$ and $K/k$ be a multi-cyclic extension of prime degree. In this paper we will give an exact formula for the…

数论 · 数学 2013-10-08 Su Hu , Yan Li

We conjecture that if $G$ is a finite primitive group and if $g$ is an element of $G$, then either the element $g$ has a cycle of length equal to its order, or for some $r,m$ and $k$, the group $G\leq S_m\wr S_r$, preserving a product…

群论 · 数学 2013-11-18 Michael Giudici , Cheryl E. Praeger , Pablo Spiga

In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.

交换代数 · 数学 2019-07-25 Mahmood Alizadeh

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 $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

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

数论 · 数学 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

Let $p$ be a prime number and let $K$ be a finite extension of the field $\mathbb{Q}_p$ of $p$-adic numbers. Let $N$ be a fully ramified, elementary abelian extension of $K$. Under a mild hypothesis on the extension $N/K$, we show that…

数论 · 数学 2007-05-23 Nigel P. Byott , G. Griffith Elder

In this work we show that every minimal code in a semisimple group algebra $\mathbb{F}_qG$ is essential if $G$ is a simple group. Since the alternating group $A_n$ is simple if $n=3$ or $n\geq 5$, we present some examples of minimal codes…

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

数论 · 数学 2015-10-06 Samrith Ram

Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial $f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)}$ over…

信息论 · 计算机科学 2017-10-04 Tao Bai , Yongbo Xia

We prove an analogue of the celebrated Hall-Higman theorem, which gives a lower bound for the degree of the minimal polynomial of any semisimple element of prime power order $p^{a}$ of a finite classical group in any nontrivial irreducible…

表示论 · 数学 2008-10-07 Pham Huu Tiep , Alexander E. Zalesskii

In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…

综合数学 · 数学 2021-06-29 Duggirala Meher Krishna , Duggirala Ravi

This paper provides two characterizations of the primitive roots of unity in quadratic cyclotomic extensions over arbitrary fields. Firstly, we introduce a mapping from $\mathbb{N}$ to $\mathbb{N}$ crucial for describing these roots,…

数论 · 数学 2024-07-30 Sophie Marques , Elizabeth Mrema

Let $q$ be a power of a prime number $p$. Let $k=\mathbb{F}_{q}(t)$ be the rational function field with constant field $\mathbb{F}_{q}$. Let $K=k(\alpha)$ be an Artin-Schreier extension of $k$. In this paper, we explicitly describe the…

数论 · 数学 2009-12-27 Su Hu , Yan Li