8 citations · 24 across the 17 of their papers we have counts for
25 papers
Automatic ply-specific analyses of CFRP micrographs using shortest-path-based ply distinction
Jonas Naumann, Jonas P. Appels, Julius Biermann +3
We present an automated approach to distinguish between ply instances in semantic segmentation masks of high-resolution carbon-fiber reinforced polymer micrographs. Interpreting th…
IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation
Johannes Schmitt, Gergely Bérczi, Jasper Dekoninck +57
As the mathematical capabilities of large language models (LLMs) improve, it becomes increasingly important to evaluate their performance on research-level tasks at the frontier of…
Revealing hidden physical nonclassicality with nonnegative polynomials
Ties-A. Ohst, Benjamin Yadin, Birte Ostermann +3
Understanding quantum phenomena which go beyond classical concepts is a focus of modern quantum physics. Here, we show how the theory of nonnegative polynomials emerging around Hil…
A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
Sabrina C. L. Ammann, Birte Ostermann, Sebastian Stiller +1
The Traveling Salesman Problem (TSP) is one of the most extensively researched and widely applied combinatorial optimization problems. It is NP-hard even in the symmetric and metri…
Realistic Runtime Analysis for Quantum Simplex Computation
Sabrina Ammann, Maximilian Hess, Debora Ramacciotti +10
In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic wors…
Initial Application of SONC to Lyapunov Stability of Dynamical Systems
Janin Heuer, Timo de Wolff
Certifying the stability of dynamical systems is a central and challenging task in control theory and systems analysis. To tackle these problems we present an algorithmic approach…
Learning Variational Models with Unrolling and Bilevel Optimization
Christoph Brauer, Niklas Breustedt, Timo de Wolff +1
In this paper we consider the problem of learning variational models in the context of supervised learning via risk minimization. Our goal is to provide a deeper understanding of t…
Parameter region for multistationarity in site phosphorylation networks
Elisenda Feliu, Nidhi Kaihnsa, Timo de Wolff +1
Multisite phosphorylation is a signaling mechanism well known to give rise to multiple steady states, a property termed multistationarity. When phosphorylation occurs in a sequenti…
A Polyhedral Homotopy Algorithm For Real Zeros
Alperen A. Ergür, Timo de Wolff
We design a homotopy continuation algorithm, that is based on numerically tracking Viro's patchworking method, for finding real zeros of sparse polynomial systems. The algorithm is…
The algebraic boundary of the sonc cone
Jens Forsgård, Timo de Wolff
In this article, we explore the connections between nonnegativity, the theory of -discriminants, and tropical geometry. For an integral support set , we…
Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM Exponentials
Victor Magron, Henning Seidler, Timo de Wolff
We provide two hybrid numeric-symbolic optimization algorithms, computing exact sums of nonnegative circuits (SONC) and sums of arithmetic-geometric-exponentials (SAGE) decompositi…
The Lattice of Amoebas
Jens Forsgård, Timo de Wolff
We study amoebas of exponential sums as functions of the support set . To any amoeba, we associate a set of approximating sections of amoebas, which we call caissons. We show th…
Lopsided Approximation of Amoebas
Jens Forsgård, Laura Felicia Matusevich, Nathan Mehlhop +1
The amoeba of a Laurent polynomial is the image of the corresponding hypersurface under the coordinatewise log absolute value map. In this article, we demonstrate that a theoretica…
A Positivstellensatz for Sums of Nonnegative Circuit Polynomials
Mareike Dressler, Sadik Iliman, Timo de Wolff
Recently, the second and the third author developed sums of nonnegative circuit polynomials (SONC) as a new certificate of nonnegativity for real polynomials, which is independent…
An Approach to Constrained Polynomial Optimization via Nonnegative Circuit Polynomials and Geometric Programming
Mareike Dressler, Sadik Iliman, Timo de Wolff
In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, wh…
Imaginary projections of polynomials
Thorsten Jörgens, Thorsten Theobald, Timo de Wolff
We introduce the imaginary projection of a multivariate polynomial as the projection of the variety of onto its imaginary part, $\mathcal{I}(f) \…
Intersections of Amoebas
Martina Juhnke-Kubitzke, Timo de Wolff
Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas…
A Sharp Upper Bound for the Complexity of Labeled Oriented Trees
Moritz Christmann, Timo de Wolff
A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial…
Norms of Roots of Trinomials
Thorsten Theobald, Timo de Wolff
The behavior of norms of roots of univariate trinomials for fixed support with respect to the choice of…
Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
Sadik Iliman, Timo de Wolff
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnega…
Amoebas, Nonnegative Polynomials and Sums of Squares Supported on Circuits
Sadik Iliman, Timo de Wolff
We completely characterize sections of the cones of nonnegative polynomials, convex polynomials and sums of squares with polynomials supported on circuits, a genuine class of spars…
The Boundary of Amoebas
Franziska Schroeter, Timo de Wolff
The computation of amoebas has been a challenging open problem for the last dozen years. The most natural approach, namely to compute an amoeba via its boundary, has not been pract…
Separating inequalities for nonnegative polynomials that are not sums of squares
Sadik Iliman, Timo de Wolff
Ternary sextics and quaternary quartics are the smallest cases where there exist nonnegative polynomials that are not sums of squares (SOS). A complete classification of the differ…
Amoebas of genus at most one
Thorsten Theobald, Timo de Wolff
The amoeba of a Laurent polynomial $f \in \C[z_1^{\pm 1},\ldots,z_n^{\pm 1}]$ is the image of its zero set under the log-absolute-value map. Understanding the spac…