3 papers
math.CO2026
New upper and lower bounds on covering codes K_q(n,R) for alphabets of size 5 <= q <= 21
Mark Marosi
Let K_q(n,R) denote the minimum cardinality of a q-ary code of length n with covering radius R. We improve the known bounds on K_q(n,R) in 83 cases (82 distinct cells). On the uppe…
cs.CL2025
Compute-Accuracy Pareto Frontiers for Open-Source Reasoning Large Language Models
Ákos Prucs, Nara Csutora, Mátyás Antal +1
Large Language Models (LLMs) are demonstrating rapid improvements on complex reasoning benchmarks, particularly when allowed to utilize intermediate reasoning steps before convergi…
cs.LG2025
Circuits, Features, and Heuristics in Molecular Transformers
Kristof Varadi, Mark Marosi, Peter Antal
Transformers generate valid and diverse chemical structures, but little is known about the mechanisms that enable these models to capture the rules of molecular representation. We…