3 papers
math.NT2025
Sums of nearest integer continued fractions with bounded digits:
Wieb Bosma, Alex Brouwers
Adapting Cantor set methods that were used by Hall and Hlawka for regular continued fractions, we prove that every real number can be obtained as the sum of two real numbers for wh…
math.NT2025
Using Walnut to solve problems from the OEIS
Wieb Bosma, Rene Bruin, Robbert Fokkink +3
We use the automatic theorem prover Walnut to resolve various open problems from the OEIS and beyond. Specifically, we clarify the structure of sequence A260311, which concerns run…
math.CO2025
Hoffman colorings of graphs
Aida Abiad, Wieb Bosma, Thijs van Veluw
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining…