ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Number theory”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.NTcs.CRcs.DSTheoreticalRecentJul 3, 2026

Calculating the floor of y**(1/m)

Alexandros V. Gerbessiotis

This paper presents two algorithms using the Newton-Raphson method to calculate the floor of y**(1/m) for natural integer numbers y > 2 and m > 1, which can be used to determine if y is an integer pow…

View →
cs.DMmath.NTTheoreticalRecentJul 16, 2026

Conjectural Decidability of the Skolem Problem

Florian Luca, Joël Ouaknine, James Worrell

This paper introduces the concept of 'large' zeros in linear recurrence sequences and establishes that they either do not exist or are very sparse, which could lead to decidability of the Skolem Probl…

View →
math.COcs.DMTheoreticalRecentJul 1, 2026

Annihilation, Independence, and Residue: Sharp Matching Bounds for the Annihilation Gap and a TxGraffiti Application

Ohr Kadrawi, Vadim E. Levit

This paper provides bounds on the difference between the annihilation number and independence number of a finite simple graph, and proves these bounds for various types of graphs.

View →
math.HOcs.DMcs.DSTheoreticalRecentJul 31, 2026

Discrepancy Theory: An Algorithmic and Geometric Perspective

Nikhil Bansal, Aleksandar Nikolov

This paper provides an introduction to modern developments in combinatorial discrepancy theory, focusing on algorithmic and convex geometric ideas.

View →
math.NTcs.CRcs.ITSurveyRecentJun 17, 2026

Structured lattices and their applications to security

Lenny Fukshansky, Camilla Hollanti, Rahinatou Y. Njah Nchiwo

This paper surveys structured lattices and their applications in lattice-based cryptography and secure wireless communications.

View →
math.HOcs.CRRecentMay 31, 2026

On the History of the Square and Multiply Algorithm

Nuh Aydin, Mohammad K. Azarian, Omid Khormali, Ghaya Mtimet

This paper traces the historical development of the square-and-multiply algorithm, arguing that while its conceptual foundation dates back to ancient Indian prosody, its formal articulation as a gener…

View →
math.NTcs.DScs.SCTheoreticalRecentJun 22, 2026

Faster enumeration of primes

David Harvey

This paper introduces new algorithms for finding prime numbers up to a given bound, achieving a speedup of log N over the sieve of Eratosthenes.

View →
cs.DMTheoreticalRecentJun 12, 2026

The Genesis Sequence, Tree Records and Endofunctions

Enrica Duchi, Adrián Lillo, Pablo Puerto, Mercedes Rosas +1 more

The paper establishes bijections between tree records, girth of connected endofunctions, and genesis sequences, deriving generating functions for tree and forest record numbers using Cayley's tree fun…

View →
cs.CCTheoreticalRecentJul 4, 2026

Additional properties of parity based bit-counting complexity classes and hierarchies

Tayfun Pay

The paper studies properties of parity based bit-counting complexity classes B|0|⊕P and B|1|⊕P, proves inclusions and closures, and shows they contain PH and are contained in CH.

View →
cs.CRquant-phApr 17, 2026

Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$

Ming-Xing Luo

This paper provides the first unconditional proof for Weber's Conjecture for the case $k ext{ up to } 12$, which is crucial for lattice-based cryptography.

View →
cs.CCcs.CGTheoreticalRecentOct 7, 2026

$\exists \mathbb{R} \subseteq \textsf{CH}$

Alex Meiburg

The paper places the existential theory of the reals in the counting hierarchy and provides bounds for various problems.

View →
math.COcs.DMTheoreticalRecentJun 8, 2026

On the generalized Turán number of complete bipartite graphs

Oliver Janzer, Sean Longbrake, Liana Yepremyan

The paper proves a lower and upper bound for the maximum number of copies of a graph F in an H-free graph on n vertices.

View →
cs.CCmath.FATheoreticalRecentOct 7, 2026

Primal/Dual Method for the Grothendieck Constant

Steven Heilman, Chris Jones, Giulio Malavolta

The authors determine the hundredths digit of the real Grothendieck constant with a new estimate.

View →
cs.DSTheoreticalRecentOct 19, 2026

Integer Programing: An Algorithm with Exponent Linear in the Dimension

Lin Chen, Yuchen Mao, Guochuan Zhang

The authors provide a deterministic algorithm for solving integer programs in standard form with improved running time.

View →
cs.CCmath.COTheoreticalRecentJun 28, 2026

On the Complexity of Counting Orderings in Graphs

Marcelo Arenas, María Alejandra Schild, Bernardo Subercaseaux

This paper shows #P-completeness for several graph counting problems using a new technique.

View →