scholarly journals APX-Hardness and Approximation for the k-Burning Number Problem

2021 ◽  
pp. 272-283
Author(s):  
Debajyoti Mondal ◽  
N. Parthiban ◽  
V. Kavitha ◽  
Indra Rajasingh
Keyword(s):  
Number Problem

On the cut number problem for the 4, and 5-cubes

2020 ◽  
Author(s):  
M.R. Emamy-K ◽  
R. Arce-Nazario
Keyword(s):  
Number Problem

Cryptanalysis of elliptic curve hidden number problem from PKC 2017

2019 ◽  
Vol 88 (2) ◽  
pp. 341-361
Author(s):  
Jun Xu ◽  
Lei Hu ◽  
Santanu Sarkar
Keyword(s):  
Elliptic Curve ◽  
Number Problem ◽  
Hidden Number Problem

scholarly journals SOME VARIANTS OF THE CONGRUENT NUMBER PROBLEM II

2002 ◽  
Vol 56 (1) ◽  
pp. 147-165 ◽  
Author(s):  
Shin-ichi YOSHIDA
Keyword(s):  
Congruent Number ◽  
Number Problem ◽  
Congruent Number Problem

Detecting Large Simple Rational Hecke Modules for Γ0(N) via Congruences

2018 ◽  
Vol 2020 (19) ◽  
pp. 6149-6168
Author(s):  
Michael Lipnowski ◽  
George J Schaeffer
Keyword(s):  
Modular Forms ◽  
Class Number ◽  
Target Space ◽  
Large Set ◽  
Hecke Eigenvalues ◽  
Artin's Conjecture ◽  
Number Problem ◽  
Novel Method ◽  
Hecke Modules ◽  
Primitive Roots

Abstract 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. In contrast with previous results of this kind, our bound does not rely on the equidistribution of Hecke eigenvalues. Instead, it is obtained via a Hecke-compatible congruence between the target space and a space of modular forms whose Hecke eigenvalues are easily controlled. We prove conditional bounds, the strongest of which is $d\gg _{\epsilon } N^{1/2-\epsilon }$ over a large set of primes $N$, contingent on Soundararajan’s heuristics for the class number problem and Artin’s conjecture on primitive roots. For prime levels $N\equiv 7\mod 8,$ our method yields an unconditional bound of $d\geq \log _{2}\log _{2}(\frac{N}{8})$, which is larger than the known bound of $d\gg \sqrt{\log \log N}$ due to Murty–Sinha and Royer. A stronger unconditional bound of $d\gg \log N$ can be obtained in more specialized (but infinitely many) cases. We also propose a number of Maeda-style conjectures based on our data, and we outline a possible congruence-based approach toward the conjectural Hecke simplicity of $S_{k}(\textrm{SL}_{2}(\mathbb{Z});\mathbb{Q})$.

A refined analysis on the jump number problem of interval orders

2015 ◽  
Vol 115 (11) ◽  
pp. 797-800
Author(s):  
Chen Yuan ◽  
Haibin Kan
Keyword(s):  
Jump Number ◽  
Interval Orders ◽  
Number Problem
Sign in / Sign up

Export Citation Format

Share Document