Related papers: Linear programs and convex hulls over fields of Pu…
The linear system $|D|$ of a divisor $D$ on a metric graph has the structure of a cell complex. We introduce the anchor divisors and anchor cells in it - they serve as the landmarks for us to compute the f-vector of the complex and find all…
We study the integrability of polynomial vector fields using Galois theory of linear differential equations when the associated foliations is reduced to a Riccati type foliation. In particular we obtain integrability results for some…
Prune-and-search is an important paradigm for solving many important geometric problems. We show that the general prune-and-search technique can be implemented where the objects are given in read-only memory. As examples we consider…
Linear programming describes the problem of optimising a linear objective function over a set of constraints on its variables. In this paper we present a solver for linear programs implemented in the proof assistant Isabelle/HOL. This…
Convex sets appear in various mathematical theories, and are used to define notions such as convex functions and hulls. As an abstraction from the usual definition of convex sets in vector spaces, we formalize in Coq an intrinsic…
We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and…
We present a novel class of methods to compute functions of matrices or their action on vectors that are suitable for parallel programming. Solving appropriate simple linear systems of equations in parallel (or computing the inverse of…
This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…
A fully implementable filtered polynomial approximation on spherical shells is considered. The method proposed is a quadrature-based version of a filtered polynomial approximation. The radial direction and the angular direction of the…
How can complexity theory and algorithms benefit from practical advances in computing? We give a short overview of some prior work using practical computing to attack problems in computational complexity and algorithms, informally describe…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
Duality of curves is one of the important aspects of the ``classical'' algebraic geometry. In this paper, using this foundation, the duality of tropical polynomials is constructed to introduce the duality of Non-Archimedean curves. Using…
We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…
The notion of geometric construction is introduced. This notion allows to compare incidence configurations in the algebraic and tropical plane. We provide an algorithm such that, given a tropical instance of a geometric construction, it…
We introduce new discrete best approximation problems, formulated and solved in the framework of tropical algebra, which deals with semirings and semifields with idempotent addition. Given a set of samples, each consisting of the input and…
We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Puiseux series including non-separable ones. The method works by transforming the polynomial and its roots into a special form and then…
Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of…
In this paper, we investigate vector fields on polyhedral complexes and their associated trajectories. We study vector fields which are analogue of the gradient vector field of a function in the smooth case. Our goal is to define a nice…
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…