Related papers: PALP: A Package for Analyzing Lattice Polytopes wi…
Topological integral transforms have found many applications in shape analysis, from prediction of clinical outcomes in brain cancer to analysis of barley seeds. Using Euler characteristic as a measure, these objects record rich geometric…
We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…
A non trivial application of a modern computer language ("C") in a highly structured and object-oriented fashion is presented. The contest is that of Lie algebra representations (irreps), specifically the problem of reducing the products of…
We present a MATLAB package called the Pha-sorArray Toolbox that has been developed to make harmonic analysis and control methods both practical and user-friendly. The toolbox adopts an object-oriented architecture that enables intuitive…
polyDB is a database for discrete geometric objects. The database is accessible via web and an interface from the software package polymake. It contains various datasets from the area of lattice polytopes, combinatorial polytopes, matroids…
Convexification based on convex envelopes is ubiquitous in the non-linear optimization literature. Thanks to considerable efforts of the optimization community for decades, we are able to compute the convex envelopes of a considerable…
The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…
The theory of polyptych lattices is a framework to obtain a family of toric degenerations whose polytopes are related by piecewise-linear transformations. It can be regarded as a generalization of toric degenerations arising from cluster…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
Polynomial optimization problems (POPs) can be reformulated as geometric convex conic programs, as shown by Kim, Kojima, and Toh (SIOPT 30:1251-1273, 2020), though such formulations remain NP-hard. In this work, we prove that several…
We develop a version of Mikhalkin's lattice path algorithm for projective hypersurfaces of arbitrary degree and dimension, which enumerates singular tropical hypersurfaces passing through appropriate configuration of points. By proving a…
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…
This book draft gives the theory of a new method for p dimensional adaptive integration by repeated 2^p subdivision of simplexes and hypercubes. A new method of constructing high order integration routines for these geometries permits…
In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…
Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of…
Motived by the study of motion in a random environment we introduce and investigate a variant of the Temperley-Lieb algebra. This algebra is very rich, providing us three classes of solutions of the Yang-Baxter equation. This allows us to…
This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…
We consider the problem of computationally-efficient prediction from high dimensional and highly correlated predictors in challenging settings where accurate variable selection is effectively impossible. Direct application of penalization…
We present a computer algebra package based on Magma for performing computations in rational Cherednik algebras at arbitrary parameters and in Verma modules for restricted rational Cherednik algebras. Part of this package is a new general…
We present a general scheme for identifying fibrations in the framework of toric geometry and provide a large list of weights for Calabi--Yau 4-folds. We find 914,164 weights with degree $d\le150$ whose maximal Newton polyhedra are…