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

20 results for “mathematics”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.PLEmpiricalRecentOct 1, 2026

Proof Interfaces for Exploratory Mathematics

Nishant Kheterpal, Matthew Keenan, Cyrus Omar, Jean-Baptiste Jeannin

This paper extends the Hazel Prover interface to support exploratory mathematics for both students and experts.

View →
cs.LGcs.AIcs.CLTheoreticalRecentJun 12, 2026

Flood and Harvest: The Provable Necessity of Trivia for Generating Valuable Mathematics via the Lens of Language Generation in the Limit

Xiaoyu Li, Andi Han, Dai Shi, Zheng Gao +2 more

The paper explores the relationship between AI systems, proof assistants, and the generation of formal mathematics.

View →
cs.AIcs.CCcs.HCEmpiricalRecentAug 11, 2026

Long-Horizon AI Research for Grothendieck Constant: A Case Study in Human-AI Mathematical Collaboration

Alan Li, Rahul Saha, Anton Xue, Swarat Chaudhuri +3 more

AI was used to improve bounds on the Grothendieck constant $K_G$ in mathematics research, leading to novel insights.

View →
cs.AIRecentMay 28, 2026

Formalizing Mathematics at Scale

Ahmad Rammal, Niket Patel, Fabian Gloeckle, Amaury Hayat +4 more

The paper introduces AutoformBot, a multi-agent system that successfully autoformalizes a large corpus of open-access graduate-level mathematics textbooks into a verified library in Lean 4, demonstrat…

View →
cs.IRcs.AImath.HOEmpiricalRecentJun 24, 2026

TheoremGraph: Bridging Formal and Informal Mathematics

Simon Kurgan, Evan Wang, Eric Leonen, Sophie Szeto +5 more

The paper introduces TheoremGraph, a unified statement-level dependency graph spanning both informal and formal mathematics.

View →
cs.CCcs.LOTheoreticalRecentOct 24, 2026

Meta-Mathematics of Algebraic Complexity

Michal Garlik, Svyatoslav Gryaznov, Jiaqi Lu, Rahul Santhanam +1 more

The paper studies the meta-mathematics of algebraic circuit lower bounds and their relationship with proof systems and bounded arithmetic theories.

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 →
cs.DMTheoreticalRecentJun 11, 2026

Fibonacci and Catalan Numbers Meet in Staircase Polyominoes

Jean-Luc Baril, José Luis Ramírez, Samuel Ramírez, Diego Villamizar

This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.

View →
cs.DMcs.CGTheoreticalRecentJun 11, 2026

On the Counting Sequence of Z-convex Polyominoes

Luca Castelli, Paolo Massazza

This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.

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.CCTheoreticalRecentJul 21, 2026

Counting spanning quasi-trees of ribbon graphs: determinants and #P-completeness

William Whistler

This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.

View →
cs.DMcs.DSmath.COTheoreticalRecentJun 16, 2026

An alternative way of defining finite graphs

Maxim Nazarov

The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.

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 →
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.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.DSEmpiricalRecentJun 9, 2026

Enumerating Inclusion-Maximal Arithmetic Progressions

Brian Bemman, Maximilien Gadouleau, Oliver W. Gnilke, George B. Mertzios

A new algorithm is proposed for enumerating inclusion-maximal arithmetic progressions in a sequence, improving upon previous time complexity.

View →