English
Related papers

Related papers: Factorization tests and algorithms arising from co…

200 papers

Let $N$ be a non-squarefree positive integer and let $\ell$ be an odd prime such that $\ell^2$ does not divide $N$. Consider the Hecke ring $\mathbb{T}(N)$ of weight $2$ for $\Gamma_0(N)$, and its rational Eisenstein primes of…

Number Theory · Mathematics 2018-05-21 Hwajong Yoo

We develop an explicit theory of formal modular forms over arbitrary number fields $K$, as functions of modular points. We define modular points for $\Gamma_0({\mathfrak n})$ and $\Gamma_1({\mathfrak n})$, where the level ${\mathfrak n}$ is…

Number Theory · Mathematics 2026-01-27 J. E. Cremona

We determine the asymptotic density $\delta_k$ of the set of ordered $k$-tuples $(n_1,...,n_k)\in \N^k, k\ge 2$, such that there exists no prime power $p^a$, $a\ge 1$, appearing in the canonical factorization of each $n_i$, $1\le i\le k$,…

Number Theory · Mathematics 2007-05-23 László Tóth

Let $\lambda_{\phi}(n)$ be the Fourier coefficients of a Hecke holomorphic or Hecke--Maass cusp form on ${\rm SL}_2(\mathbb Z)$, and $f$ be any multiplicative function that satisfies two mild hypotheses. We establish a non-trivial upper…

Number Theory · Mathematics 2022-04-19 Yujiao Jiang , Guangshi Lü

Let $f$ be a non-CM Hecke eigencusp form of level 1 and fixed weight, and let $\{\lambda_f(n)\}_n$ be its sequence of normalized Fourier coefficients. We show that if $K/ \mathbb{Q}$ is any number field, and $\mathcal{N}_K$ denotes the…

Number Theory · Mathematics 2022-06-07 Alexander P. Mangerel

We revisit the problem of integer factorization with number-theoretic oracles, including a well-known problem: can we factor an integer $N$ unconditionally, in deterministic polynomial time, given the value of the Euler totient $$\Phi$(N)$?…

Number Theory · Mathematics 2021-08-16 Fran{\c c}ois Morain , Gu{é}na{ë}l Renault , Benjamin Smith

Let $n=a^2b$, where $b$ is square-free. In this paper we present an algorithm based on class groups of binary quadratic forms that finds the square-free decomposition of $n$, i.e. $a$ and $b$, in heuristic expected time: $$…

Number Theory · Mathematics 2023-08-14 Erik Mulder

A square-free integer is a positive integer that is not divisible by the square of any prime. Merten's function, $M(x)$ is defined as the difference between the number of square free integers with an even number of prime factors and the…

Number Theory · Mathematics 2018-05-02 Irfan Okay

We describe a novel method for bounding the dimension $d$ of the largest simple Hecke submodule of $S_2(\Gamma_0(N);\mathbb{Q})$ from below. Such bounds are of interest because of their relevance to the structure of $J_0(N)$, for instance.…

Number Theory · Mathematics 2016-11-01 Michael Lipnowski , George J. Schaeffer

Let N be a positive integer and let f be a newform of weight 2 on \Gamma_0(N). In earlier joint work with K. Ribet and W. Stein, we introduced the notions of the modular number and the congruence number of the quotient abelian variety A_f…

Number Theory · Mathematics 2025-10-07 Amod Agashe

We prove that Hecke eigenvalues for any Hilbert and Siegel modular forms are algebraic integers. Our method does not rely on cohomologicality nor Galois representations. We apply the integrality of Hecke eigenvalues for Hilbert modular…

Number Theory · Mathematics 2024-01-23 Kenji Sakugawa , Shingo Sugiyama

We prove various converse theorems for automorphic forms on \Gamma_0(N), each assuming fewer twisted functional equations than the last. We show that no twisting at all is needed for holomorphic modular forms in the case that N is 18, 20,…

Number Theory · Mathematics 2023-07-14 Benjamin Bedert , George Cooper , Thomas Oliver , Pengcheng Zhang

For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a…

Data Structures and Algorithms · Computer Science 2021-12-15 Kristin Sheridan , Joseph Berleant , Mark Bathe , Anne Condon , Virginia Vassilevska Williams

We develop a new algorithm to compute a basis for $M_k(\Gamma_0(N))$, the space of weight $k$ holomorphic modular forms on $\Gamma_0(N)$, in the case when the graded algebra of modular forms over $\Gamma_0(N)$ is generated at weight two.…

Number Theory · Mathematics 2017-09-25 Michael Lam , Noah McClelland , Matthew Petty , John Webb

We investigate the analogue of the Quantum Unique Ergodicity (QUE) conjecture for half-integral weight automorphic forms. Assuming the Generalized Riemann Hypothesis (GRH) we establish QUE for both half-integral weight holomorphic Hecke…

Number Theory · Mathematics 2020-02-12 Stephen Lester , Maksym Radziwiłł

In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns),…

Machine Learning · Statistics 2014-04-07 Nicolas Gillis , Stephen A. Vavasis

Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.

Group Theory · Mathematics 2017-02-10 Bettina Eick

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

Combinatorics · Mathematics 2019-09-04 Jacob Sprittulla

Let $k$ be an even integer and $S_k$ be the space of cusp forms of weight $k$ on $\SL_2(\ZZ)$. Let $S = \oplus_{k\in 2\ZZ} S_k$. For $f, g\in S$, we let $R(f, g) = \{ (a_f(p), a_g(p)) \in \mathbb{P}^1(\CC)\ |\ \text{$p$ is a prime} \}$ be…

Number Theory · Mathematics 2019-02-08 Dohoon Choi , Subong Lim

In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…

Data Structures and Algorithms · Computer Science 2026-02-05 Dan Johnson , Michael Levet , Petr Vojtěchovský , Brett Widholm