This paper proposes a Genetic Algorithm with constraint repair mechanism for optimally allocating educational resources to high school mathematics students under study time constraints.

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…

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…

The paper proposes a multimodal data analytics framework combining knowledge graphs and temporal modeling to accurately predict advanced mathematics learning difficulties and provide early academic wa…

The paper introduces COMPOSE, a dual-graph framework that generates plausible future mathematical theorems by simultaneously conditioning a language model on both the scientific citation context and t…

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

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

This paper presents an algorithm to generate snake-like polyominoes within a given rectangle and provides exact formulas for the maximal area of such polyominoes for certain dimensions.

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

This paper proves that the satisfiability problem of existential Presburger arithmetic extended with divisibility predicates (EPAD) is PP-hard.

This paper proves that a majority of filled-in Sudoku grids require a logarithmic fraction of cells to be filled by clues, and constructs grids requiring 18 and 80 clues for 9x9 and 16x16 Sudoku, resp…

This paper investigates the closeness of singularity for $n imes n$ unimodular matrices, specifically for $(2k+1)$-ary and $(k+1)$-ary cases of $4 imes 4$ nonnegative unimodular matrices.

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.

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…

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…