20 results for “mathematics”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper extends the Hazel Prover interface to support exploratory mathematics for both students and experts.
The paper explores the relationship between AI systems, proof assistants, and the generation of formal mathematics.
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.
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…
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.
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.
This paper provides an introduction to modern developments in combinatorial discrepancy theory, focusing on algorithmic and convex geometric ideas.
This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.
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.
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…
This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
This paper shows #P-completeness for several graph counting problems using a new technique.
The paper places the existential theory of the reals in the counting hierarchy and provides bounds for various problems.
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…
A new algorithm is proposed for enumerating inclusion-maximal arithmetic progressions in a sequence, improving upon previous time complexity.