86 papers
Joint-Range Inequalities for Nonconvex QCQPs
Liding Xu, Sebastian Pokutta
We study cutting planes for nonconvex quadratically constrained quadratic programs (QCQPs) through a project-then-lift approach inspired by mixed-integer rounding (MIR) inequalitie…
When Does LLM Orchestration Pay Off? A Controlled Evaluation of Accuracy, Cost, and Task Difficulty
Nicolas Leins, Nico Pelleriti, Jana Gonnermann-Müller +1
LLM orchestration is often assumed to improve reasoning by allocating additional inference-time computation, yet its gains may not justify its cost. Existing comparisons also frequ…
Bounded-Support Additive Latin Transversals
Antoine Deza, Yan Gerard, Yijun Ma +1
The paper presents a randomized algorithm for finding matchings with prescribed color counts in edge‑colored graphs, and uses this to construct additive Latin transversals efficien…
The Weight Distribution of the Third-Order Reed-Muller Code of Length 2048
Kirill Khoruzhii, Patrick GelÃ, Sebastian Pokutta
We compute the weight distribution of the third-order Reed--Muller code RM(3,11) of length 2048. The weight enumerator is assembled from the coset weight enumerators of f+RM(2,10),…
A Counterexample to Ziegler's Cross-Polytope Conjecture for Simplicial 0/1-Polytopes
Volker Kaibel, Sebastian Pokutta
Ziegler proved that every simplicial -dimensional -polytope has at most vertices, and asked whether equality forces the polytope to be centrally symmetric and hence, e…
When Does Sparsity Mitigate the Curse of Depth in LLMs
Dilxat Muhtar, Xinyuan Song, Sebastian Pokutta +4
Recent work has demonstrated the curse of depth in large language models (LLMs), where later layers contribute less to learning and representation than earlier layers. Such under-u…