English
Related papers

Related papers: Divisor Structure of p-1 in Mersenne Prime Exponen…

200 papers

In this paper, we introduce the notion of spectral genus $\widetilde{p}_{g}$ of a germ of an isolated hypersurface singularity $(\mathbb{C}^{n+1}, 0) \to (\mathbb{C}, 0)$, defined as a sum of small exponents of monodromy eigenvalues. The…

Algebraic Geometry · Mathematics 2024-06-04 Dennis Eriksson , Gerard Freixas i Montplet

A Wolstenholme prime is a prime number $p \geq 5$ that divides the numerator of the Bernoulli number $B_{p-3}$. A number of equivalent definitions for Wolstenholme primes are known, mostly related to congruences of harmonic sums or binomial…

Number Theory · Mathematics 2023-11-02 Cid Reyes-Bustos , Naoya Yamaguchi , Yuka Yamaguchi

Let $p$ be an odd prime, and fix integers $m$ and $n$ such that $0<m<n\leq (p-1)(p-2)$. We give a $p$-local homotopy decomposition for the loop space of the complex Stiefel manifold $W_{n,m}$. Similar decompositions are given for the loop…

Algebraic Topology · Mathematics 2014-10-01 Piotr Beben

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

Number Theory · Mathematics 2024-09-04 Fernando Szechtman

The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomial configuration x+P_1(m), ..., x+P_k(m), where x,m are…

Number Theory · Mathematics 2019-06-14 Thai Hoang Le , Julia Wolf

In this paper, we show that if $p$ is a prime and $G$ is a $p$-solvable group, then $| G:O_p (G) |_p \le (b(G)^p/p)^{1/(p-1)}$ where $b(G)$ is the largest character degree of $G$. If $p$ is an odd prime that is not a Mersenne prime or if…

Group Theory · Mathematics 2011-11-16 Mark L. Lewis

The Mersenne primes are primes which can be written as some prime power of 2 minus 1. These primes were studied from antiquity in that their close connection with perfect numbers and even to present day in that their easiness for primality…

Number Theory · Mathematics 2022-08-09 Taekyun Kim , Dae san Kim

We analyze the probability that, for a fixed finite set of primes S, a random, monic, degree n polynomial f(x) with integer coefficients in a box of side B around 0 satisfies: (i) f(x) is irreducible over the rationals, with splitting field…

Number Theory · Mathematics 2015-08-12 Jeffrey C. Lagarias , Benjamin L. Weiss

This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical…

Number Theory · Mathematics 2013-10-11 Joel Beeren , David Harvey , Tim Trudgian

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

Information Theory · Computer Science 2019-11-19 Minjia Shi , Tor Helleseth , Patrick Sole

We consider second-order divergence form uniformly parabolic and elliptic PDEs with bounded and $VMO_{x}$ leading coefficients and possibly linearly growing lower-order coefficients. We look for solutions which are summable to the $p$th…

Analysis of PDEs · Mathematics 2009-09-30 N. V. Krylov

We consider any fixed $d\in\mathbb{Z}_{>0}$ number of second class particles in the asymmetric simple exclusion process (ASEP), constructed via a basic coupling of two ASEPs. We give the joint distribution of the positions of the second…

Probability · Mathematics 2026-04-21 Daniel Adams , Márton Balázs , Jessica Jay

For a prime $p$, let $c(p)$ denote the limiting fraction of $n\times n$ matrices over $\mathbb{F}_p$ whose determinant is a primitive root modulo $p$. The quantity $c(p)$ is a natural multiplicative deformation of the totient ratio…

Cryptography and Security · Computer Science 2026-05-08 Vipin Singh Sehrawat

Let $p$ be a prime number. Motivated by the local lifting problem for $(\mathbb{Z}/p\mathbb{Z})^n$ with $n>1$, we prove several new results on certain $\mathbb{F}_p$-vector spaces of logarithmic differential forms on the projective line in…

Number Theory · Mathematics 2026-01-06 Michel Matignon , Guillaume Pagot , Daniele Turchetti

We prove that the set of normalized differences between primes, defined as $S = \{(p-q)/(p+q) : p > q \text{ are primes}\}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative…

General Mathematics · Mathematics 2025-06-17 Paul Alexander Bilokon

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

Number Theory · Mathematics 2020-06-02 Olli Järviniemi

Let $N$ be a finite set, let $p \in (0,1)$, and let $N_p$ denote a random binomial subset of $N$ where every element of $N$ is taken to belong to the subset independently with probability $p$ . This defines a product measure $\mu_p$ on the…

Combinatorics · Mathematics 2014-09-25 Ehud Friedgut , Jeff Kahn , Clara Shikhelman

We consider questions in Galois cohomology which arise by considering mod $p$ Galois representations arising from automorphic forms. We consider a Galois cohomological analog for the standard heuristics about the distribution of Wieferich…

Number Theory · Mathematics 2018-06-12 Gebhard Boeckle , David-A. Guiraud , Sudesh Kalyanswamy , Chandrashekhar Khare

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

Number Theory · Mathematics 2007-05-23 Pieter Moree

We give several characterizations of Mersenne primes (Theorem 1.1) and of primes for which 2 is a primitive root (Theorem 1.2). These characterizations involve group algebras, circulant matrices, binomial coefficients, and bipartite graphs.

Number Theory · Mathematics 2015-06-15 Sunil K. Chebolu , Keir Lockridge , Gaywalee Yamskulna
‹ Prev 1 3 4 5 6 7 10 Next ›