activity
20212026
most citedLebesgue integration. Detailed proofs to be formalized in Coq

1 citations · 2 across the 18 of their papers we have counts for

collaborators
Showing 2025Show all

8 papers · 1 filter

math.CA2025

Many critical points for discrete Riesz energy on

François Clément, Stefan Steinerberger

It is widely believed that the energy functional has a number of cr…

cs.LO2025

A Rocq Formalization of Monomial and Graded Orders

Sylvie Boldo, François Clément, Vincent Martin +1

Even if binary relations and orders are a common formalization topic, we need to formalize specific orders (namely monomial and graded) in the process of formalizing in Rocq the fi…

math.CO2025

Balanced Stick Breaking

François Clément, Stefan Steinerberger

Consider an infinite sequence on the unit circle . We may interpret the first elements as places where the `circular stic…

math.CO2025

Regular Structures in Kronecker Permutations

François Clément

Kronecker sequences for some irrational have played an important role in many areas of mathematics. It is possible to associate to each finite s…

math.NA2025★ 1 cited

On the optimization of discrepancy measures

François Clément, Nathan Kirk, Art B. Owen +1

Numerical optimizations can find point sets with lower discrepancies than prior methods based on algebra, and discrepancies are computationally attractive for this. The …

math.CO2025

Monotone Paths on Acyclic 3-Regular Graphs

François Clément, Dan Guyer

Motivated by trying to understand the behavior of the simplex method, Athanasiadis, De Loera and Zhang provided upper and lower bounds on the number of the monotone paths on 3-poly…

cs.LG2025

carps: A Framework for Comparing N Hyperparameter Optimizers on M Benchmarks

Carolin Benjamins, Helena Graf, Sarah Segel +14

Hyperparameter Optimization (HPO) is crucial to develop well-performing machine learning models. In order to ease prototyping and benchmarking of HPO methods, we propose carps, a b…

math.CO2025

Small gaps in the Ulam sequence

François Clément, Stefan Steinerberger

The Ulam sequence, described by Stanislaw Ulam in the 1960s, starts and then iteratively adds the smallest integer that can be uniquely written as the sum of two distinct ear…