English
Related papers

Related papers: The St\'ephanois theorem with only prime isogenies

200 papers

We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…

Number Theory · Mathematics 2025-07-01 Alexandru Pascadi

Let $f$ be an irreducible polynomial of prime degree $p\geq 5$ over $\QQ$, with precisely $k$ pairs of complex roots. Using a result of Jens H\"{o}chsmann (1999), we show that if $p\geq 4k+1$ then $\Gal(f/\QQ)$ is isomorphic to $A_{p}$ or…

Number Theory · Mathematics 2007-09-19 Oz Ben-Shimol

We prove an extension of the Bourgain-Sarnak-Ziegler theorem and then apply it to bound certain polynomial exponential sums with modular coefficients.

Number Theory · Mathematics 2020-03-23 Mattia Cafferata , Alberto Perelli , Alessandro Zaccagnini

We give a bound on the primes dividing the denominators of invariants of Picard curves of genus 3 with complex multiplication. Unlike earlier bounds in genus 2 and 3, our bound is based not on bad reduction of curves, but on a very explicit…

Number Theory · Mathematics 2018-09-18 Pınar Kılıçer , Elisa Lorenzo García , Marco Streng

Let $p$ be an odd prime, and $\mathbf{Q}_{p^f}$ the unramified extension of $\mathbf{Q}_p$ of degree $f$. In this paper, we reduce the problem of constructing strongly divisible modules for $2$-dimensional semi-stable non-crystalline…

Number Theory · Mathematics 2025-05-27 Seongjae Han , Chol Park

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…

Number Theory · Mathematics 2023-03-10 Steven Brown

We revisit the proof of the de Moivre--Laplace theorem, which is the ancestor of the central limit theorem for the binomial distribution. Our goal is to provide a proof that can be reasonably presented to undergraduate students within a…

Probability · Mathematics 2025-12-30 Raphaël Cerf

Given two CM elliptic curves over a number field and a natural number $m$, we establish a polynomial lower bound (in terms of $m$) for the number of rational primes $p$ such that the reductions of these elliptic curves modulo a prime above…

Number Theory · Mathematics 2025-03-12 Edgar Assing , Yingkun Li , Tian Wang , Jiacheng Xia

We give several new moduli interpretations of the fibers of certain Shimura varieties over several prime numbers. As a consequence (of our theorem 9.1) one obtains that for every prescribed odd prime characteristic $p$ every bounded…

Algebraic Geometry · Mathematics 2022-07-19 Oliver Bültel

It is known that prime numbers occupy specific geometrical patterns or moduli when numbers from one to infinity are distributed around polygons having sides that are integer multiple of number 6. In this paper, we will show that not only…

General Mathematics · Mathematics 2019-03-29 Robert E. Grant , Talal Ghannam

Let $f$ be a polynomial of degree $d>1$ in $n$ variables over $\mathbb{Z}$. Let $f_d$ be the homogeneous part of degree $d$ of $f$ and $s$ be the dimension of the critical locus of $f_d$. In this paper, we prove Igusa's conjecture for…

Number Theory · Mathematics 2021-11-24 Kien Huu Nguyen

Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…

Representation Theory · Mathematics 2018-08-07 Alex Dugas

We examine canonical bases for weakly holomorphic modular forms of weight $0$ and level $p = 2, 3, 5, 7, 13$ with poles only at the cusp at $\infty$. We show that many of the Fourier coefficients for elements of these canonical bases are…

Number Theory · Mathematics 2014-04-04 Paul Jenkins , DJ Thornton

We continue the study in [21] of the linearizability near an indif- ferent fixed point of a power series f, defined over a field of prime characteristic p. It is known since the work of Herman and Yoccoz [13] in 1981 that Siegel's…

Dynamical Systems · Mathematics 2011-11-09 Karl-Olof Lindahl

Let $G$ be a simple, simply connected algebraic group over an algebraically closed field of prime characteristic $p>0$. Recent work of Kildetoft and Nakano and of Sobaje has shown close connections between two long-standing conjectures of…

Representation Theory · Mathematics 2018-07-13 Christopher P. Bendel , Daniel K. Nakano , Cornelius Pillen , Paul Sobaje

In this article, we ask whether the Igusa zeta function of a restricted power series over $\mathbb{Q}_p$ can be determined solely from the terms of degree at most $D$. That is, we ask whether the truncated polynomial $f_D$, consisting of…

Number Theory · Mathematics 2025-04-25 Leonie Dausy

Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…

Rings and Algebras · Mathematics 2016-01-12 Eva Bayer-Fluckiger , Uriya A. First

This paper is a continuation of \cite{zhang}, in which we established the wellposedness result and a comparison theorem for a class of one dimensional Forward-Backward SDEs. In this paper we extend the wellposedness result to high…

Probability · Mathematics 2017-08-22 Jianfeng Zhang

Let f1, ..., fs be a polynomial family in Q[X1,..., Xn] (with s less than n) of degree bounded by D. Suppose that f1, ..., fs generates a radical ideal, and defines a smooth algebraic variety V. Consider a projection P. We prove that the…

Symbolic Computation · Computer Science 2007-05-23 Mohab Safey El Din , Philippe Trebuchet

In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…

Computational Complexity · Computer Science 2015-02-16 Albert Atserias
‹ Prev 1 4 5 6 7 8 10 Next ›