English
Related papers

Related papers: Factoring Hecke polynomials modulo a prime

200 papers

The behaviour of Hecke polynomials modulo p has been the subject of some study. In this note we show that, if p is a prime, the set of integers N such that the Hecke polynomials T^{N,\chi}_{l,k} for all primes l, all weights k>1 and all…

Number Theory · Mathematics 2009-05-28 L. J. P. Kilford , Gabor Wiese

Let T_{n,k}(X) be the characteristic polynomial of the n-th Hecke operator acting on the space of cusp forms of weight k for the full modular group. We show that if there exists n>1 such that T_{n,k}(X) is irreducible and has the full…

Number Theory · Mathematics 2020-06-01 Paloma Bengoechea

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

Number Theory · Mathematics 2007-05-23 Roland Bacher

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

Computational Complexity · Computer Science 2019-02-27 Ashish Dwivedi , Rajat Mittal , Nitin Saxena

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

Algebraic Geometry · Mathematics 2008-04-02 Hani Shaker

We address some questions concerning indecomposable polynomials and their behaviour under specialization. For instance we give a bound on a prime $p$ for the reduction modulo $p$ of an indecomposable polynomial $P(x)\in \Zz[x]$ to remain…

Commutative Algebra · Mathematics 2014-02-26 Arnaud Bodin , Guillaume Chéze , Pierre Débes

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

General Mathematics · Mathematics 2019-12-30 Duggirala Meher Krishna , Duggirala Ravi

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

Number Theory · Mathematics 2015-12-01 F. E. Brochero Martínez , Lucas Reis

Let $a,k\in\mathbb{N}$. For the $k-1$-th iterate of the exponential function $x\mapsto a^x$, also known as tetration, we write \[ ^k a:=a^{a^{.^{.^{.^{a}}}}}. \] In this paper, we show how an efficient algorithm for tetration modulo natural…

Number Theory · Mathematics 2020-07-07 Markus Hittmeir

We study the index of nilpotency relative to certain Hecke operators in spaces of modular forms with integer weight and level $N$ with integer coefficients modulo primes $p$ for $(p, N) \in \{(3, 1), (5, 1), (7, 1), (3, 4)\}$. In these…

Number Theory · Mathematics 2026-02-12 Matthew Boylan , Swati

We determine the action of the Hecke operators \(T_{\mathfrak{p},i}\) on the coefficient forms \(g_{1}, \dots, g_{r-1}, g_{r} = \Delta\), and \(h\), which together generate the ring of modular forms for \(\mathrm{GL}(r,…

Number Theory · Mathematics 2025-11-04 Ernst-Ulrich Gekeler

Given a valued field $(K,v)$ and an irreducible polynomial $g\in K[x]$, we survey the ideas of Ore, Maclane, Okutsu, Montes, Vaqui\'e and Herrera-Olalla-Mahboub-Spivakovsky, leading (under certain conditions) to an algorithm to find the…

Commutative Algebra · Mathematics 2022-07-06 Maria Alberich-Carramiñana , Jordi Guàrdia , Enric Nart , Adrien Poteaux , Joaquim Roé , Martin Weimann

We determine the order of magnitude of H^{(k+1)}(x,\vec{y},2\vec{y}), the number of integers up to x that are divisible by a product d_1...d_k with y_i<d_i\le 2y_i, when the numbers \log y_1,...,\log y_k have the same order of magnitude and…

Number Theory · Mathematics 2013-05-29 Dimitris Koukoulopoulos

For every prime integer $p$, an explicit factorization of the principal ideal $p\z_K$ into prime ideals of $\z_K$ is given, where $K$ is a quartic number field defined by an irreducible polynomial $X^4+aX+b\in\z[X]$.

Number Theory · Mathematics 2010-08-24 Lhoussain El Fadil

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Combinatorics · Mathematics 2016-10-18 Jacob Sprittulla

Given an odd prime $p$, we provide formulas for the Hensel lifts of polynomial roots modulo $p$, and give an explicit factorization over the ring of formal power series with integer coefficients for certain reducible polynomials whose…

Number Theory · Mathematics 2014-12-17 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $\Gamma_0(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$…

Number Theory · Mathematics 2018-06-25 Miao Gu , Greg Martin

We compute the intertwining relation between the Hecke operators and the Siegel lowering operators on Siegel modular forms of arbitrary level $N$ and character $\chi$ by using formulas for the action of the Hecke operators on Fourier…

Number Theory · Mathematics 2015-12-31 Martin J. Dickson

In this paper we study operators of the form $M(\phi)=T(\phi)+H(\phi)$ where $T(\phi)$ and $H(\phi)$ are the Toeplitz and Hankel operators acting on $H^p(\T)$ with generating function $\phi\in L^\iy(\T)$. It turns out that $M(\phi)$ is…

Functional Analysis · Mathematics 2007-05-23 Estelle Basor , Torsten Ehrhardt

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
‹ Prev 1 2 3 10 Next ›