English
Related papers

Related papers: On Gauss Periods

200 papers

For any finite Galois field extension $\mathsf{K}/\mathsf{F}$, with Galois group $G = \mathrm{Gal}(\mathsf{K}/\mathsf{F})$, there exists an element $\alpha \in \mathsf{K}$ whose orbit $G\cdot\alpha$ forms an $\mathsf{F}$-basis of…

Symbolic Computation · Computer Science 2020-12-24 Mark Giesbrecht , Armin Jamshidpey , Éric Schost

For the sequence defined by \[ a(n) = \frac{n^2 - n - 1}{\gcd\big(n^2 - n - 1,\, b(n-3) + n\,b(n-4)\big)} \] Where $b(n) = (n+2)\big(b(n-1) - b(n-2)\big),$ with initial conditions $b(-1) = 0$ and $b(0) = 1$, we find that $a(n)$ contains…

General Mathematics · Mathematics 2025-09-15 Mohammed Bouras

For $q=3^r$ ($r>0$), denote by $\mathbb{F}_q$ the finite field of order $q$ and for a positive integer $m\geq2$, let $\mathbb{F}_{q^m}$ be its extension field of degree $m$. We establish a sufficient condition for existence of a primitive…

Number Theory · Mathematics 2020-01-22 Himangshu Hazarika , Dhiren Kumar Basnet , Stephen D Cohen

Given $g\ge 1$, the number $n(g)$ of numerical semigroups $S \subset \N$ of genus $|\N \setminus S|$ equal to $g$ is the subject of challenging conjectures of Bras-Amor\'os. In this paper, we focus on the counting function $n(g,2)$ of…

Combinatorics · Mathematics 2012-09-17 Shalom Eliahou , Jorge Ramirez Alfonsin

Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $d_1, \ldots, d_k$ be positive integers. In this note we explore the number of solutions $(z_1, \ldots, z_k)\in\overline{\mathbb F}_q^k$ of the…

Number Theory · Mathematics 2020-09-29 Lucas Reis

Let $G$ be an almost simple group with socle $A_n$, the alternating group of degree $n$. We prove that there is a unit of order $pq$ in the integral group ring of $G$ if and only if there is an element of that order in $G$ provided $p$ and…

Group Theory · Mathematics 2017-06-27 Andreas Bächle , Mauricio Caicedo

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

Number Theory · Mathematics 2023-05-04 Dor Elboim , Ofir Gorodetsky

The $q$-Narayana numbers $N_q(n,k)$ and $q$-Catalan numbers $C_n(q)$ are respectively defined by $$ N_q(n,k)=\frac{1-q}{1-q^n}{n\brack k}{n\brack k-1}\quad\text{and}\quad C_n(q)=\frac{1-q}{1-q^{n+1}}{2n\brack n}, $$ where ${n\brack…

Number Theory · Mathematics 2017-03-02 Victor J. W. Guo , Qiang-Qiang Jiang

Given a circle of radius $r$ centered at the origin, the Gauss Circle Problem concerns counting the number of lattice points $C(r)$ within this circle. It is known that as $r$ grows large, the number of lattice points approaches $\pi r^2$,…

General Mathematics · Mathematics 2025-02-12 Thomas Ehrenborg

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

Number Theory · Mathematics 2015-06-26 P. Kurlberg , C. Pomerance

Given a prime number $q$ and a squarefree integer $C_1$, we develop a method to explicitly determine the tuples $(y, n, \alpha)$ for which the difference $y^n-q^\alpha$ has squarefree part equal to $C_1$. Our techniques include the…

Number Theory · Mathematics 2023-12-18 Pedro-José Cazorla García

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

General Mathematics · Mathematics 2015-04-03 N. A. Carella

The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…

Number Theory · Mathematics 2025-10-20 Johnathan Cai , Ryan Diehl , William Gasarch , Ian Kim , Rohan Sinha

This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…

General Mathematics · Mathematics 2021-04-15 N. A. Carella

Let $\mathbb F_q$ be a finite field with $q$ elements, $G$ a finite cyclic group of order $p^k$ and $p$ is an odd prime with ${\rm gcd}(q,p)=1$. In this article, we determine an explicit expression for the primitive idempotents of $\mathbb…

Rings and Algebras · Mathematics 2014-04-28 F. E. Brochero Martínez , C. R. Giraldo Vergara

We give a reduction formula for the Waring number $g(k,q)$ over a finite field $\mathbb{F}_q$. By exploiting the relation between $g(k,q)$ with the diameter of the generalized Paley graph $\Gamma(k,q)$ and by using the characterization due…

Number Theory · Mathematics 2022-06-07 Ricardo A. Podestá , Denis E. Videla

Let b be an odd integer such that b=+/-1 (mod 8) and let q be a prime with primitive root 2 such that q does not divide b. We show that if (p(k)) is a sequence of odd primes, with 0<=k<=q-2 such that p(k)=2p(k-1)+b for all 1<=k<=q-2, then…

Number Theory · Mathematics 2009-08-20 Douglas S. Stones

Let $q$ be an odd prime power and $n$ be a positive integer. Let $\ell\in \mathbb F_{q^n}[x]$ be a $q$-linearised $t$-scattered polynomial of linearized degree $r$. Let $d=\max\{t,r\}$ be an odd prime number. In this paper we show that…

Number Theory · Mathematics 2020-02-04 Andrea Ferraguti , Giacomo Micheli

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…

Number Theory · Mathematics 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any integer $r\ge1$ we prove that the number of odd $k$-perfect numbers with at most $r$ distinct prime factors is bounded by $k4^{r^3}$.

Number Theory · Mathematics 2011-02-23 Shi-Chao Chen , Hao Luo