中文
相关论文

相关论文: Prime power order circulant determinants

200 篇论文

We prove that more than nine percent of the central values $L(\frac{1}{2},\chi_p)$ are non-zero, where $p\equiv 1 \pmod{8}$ ranges over primes and $\chi_p$ is the real primitive Dirichlet character of conductor $p$. Previously, it was not…

数论 · 数学 2018-09-27 Siegfred Baluyot , Kyle Pratt

A finite group G is exceptional if it has a quotient Q whose minimal faithful permutation degree is greater than that of G. We say that Q is a distinguished quotient. The smallest examples of exceptional p-groups have order p^5. For an odd…

群论 · 数学 2014-08-08 John R. Britnell , Neil Saunders , Tony Skyner

We introduce a modification of Pillai's prime map: the prime-power map. This map fixes $1$, divides its argument by $p$ if it is a prime-power $p^k$, otherwise subtracts from its argument the largest prime-power not exceeding it. We study…

动力系统 · 数学 2020-08-05 Steven , Jonathan Hoseana

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

数论 · 数学 2018-04-10 Romeo Mestrovic

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

数论 · 数学 2013-01-08 William D. Banks , Greg Martin

Let $d\ge4$ and $c\in(-d,d)$ be relatively prime integers. We show that for any sufficiently large integer $n$ (in particular $n>24310$ suffices for $4\le d\le 36$), the smallest prime $p\equiv c\pmod d$ with $p\ge(2dn-c)/(d-1)$ is the…

数论 · 数学 2015-10-23 Zhi-Wei Sun

Two methods, structural (constructive) and multiplier (analytical), of exact enumeration of undirected and directed circulant graphs of orders 27 and 125 are elaborated and represented in detail here together with intermediate and final…

组合数学 · 数学 2018-04-10 Victoria Gatt , Mikhail Klin , Josef Lauri , Valery Liskovets

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

数论 · 数学 2016-09-02 Jie Wu , Ping Xi

We present a characterisation of groups $G$ of order $p^7$, $p$ prime, in which not all elements of the commutator subgroup $\gamma_2(G)$ of $G$ are commutators in $G$. On the way we obtain several structural results on groups of order…

群论 · 数学 2021-06-15 Rahul Kaushik , Manoj K. Yadav

For a pair of distinct non-CM newforms of weights at least 2, having rational integral Fourier coefficients $a_{1}(n)$ and $a_{2}(n)$, under GRH, we obtain an estimate for the set of primes $p$ such that $$ \omega(a_1(p)-a_2(p)) \le […

数论 · 数学 2023-12-20 Arvind Kumar , Moni Kumari

Let $P_{r}$ denote an integer with at most $r$ prime factors counted with multiplicity. In this paper we prove that for some $\lambda < \frac{1}{12}$, the inequality $\{\sqrt{p}\}<p^{-\lambda}$ has infinitely many solutions in primes $p$…

数论 · 数学 2025-10-14 Runbo Li

We show that for a subset $A$ of the cyclic group of prime order $p>3$, if the sumset $A+A-2A$ is not the whole group, then $|A|\le \frac27\,p$. Besides combinatorial arguments, we utilize a general technique involving linear programming.

数论 · 数学 2025-10-21 Vsevolod Lev , Máté Matolcsi , Péter Pál Pach , Dániel Varga

We describe a primality test for number $M=(2p)^{2^n}+1$ with odd prime $p$ and positive integer $n$. And we also give the special primality criteria for all odd primes $p$ not exceeding 19. All these primality tests run in polynomial time…

数论 · 数学 2013-07-09 Yingpu Deng , Dandan Huang

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

数论 · 数学 2024-06-11 Michael Hellus , Anton Rechenauer , Rolf Waldi

The Noether number of a representation is the largest degree of an element in a minimal homogeneous generating set for the corresponding ring of invariants. We compute the Noether number for an arbitrary representation of a cyclic group of…

交换代数 · 数学 2007-05-23 P. Fleischmann , M. Sezer , R. J. Shank , C. F. Woodcock

We study the discriminants of the minimal polynomials $\mathcal{P}_n$ of the Ramanujan $t_n$ class invariants, which are defined for positive integers $n\equiv11\pmod{24}$. The historical precedent for doing so comes from Gross and Zagier,…

数论 · 数学 2022-10-04 Sarth Chavan

We study congruences for Eisenstein series on $\mathrm{SL}_2(\mathbb{Z})$ modulo $p^2$, where $p \geq 5$ is prime. It is classically known that all Eisenstein series of weight at least $4$ are determined modulo $p^2$ by those of weight at…

数论 · 数学 2025-02-25 Scott Ahlgren , Michael Hanson , Martin Raum , Olav K. Richter

We characterize the finite groups of minimal order that admit an irreducible complex character of degree $p$ or $p^2$, where $p$ is a prime.

群论 · 数学 2025-08-04 Asier Arranz

We find the minimal non-trivial integer variable group determinant for any dihedral group of order less than $3.79\times 10^{47}$. We think of this as the Lind-Lehmer problem for the dihedral group. We give a complete description of the…

数论 · 数学 2018-02-22 Ton Boerkoel , Christopher Pinner

We show that if $A$ is a subset of a group of prime order $p$ such that $|2A|<2.7652|A|$ and $|A|<1.25\cdot10^{-6}p$, then $A$ is contained in an arithmetic progression with at most $|2A|-|A|+1$ terms, and $2A$ contains an arithmetic…

数论 · 数学 2023-02-17 Vsevolod F. Lev , Oriol Serra