Related papers: Wronski Pairs of Honeycomb Curves

We study the map which sends vectors of polynomials into their Wronski determinants. This defines a projection map of a Grassmann variety which we call a Wronski map. Our main result is computation of degrees of the real Wronski maps.…

Real algebraic geometry adapts the methods and ideas from (complex) algebraic geometry to study the real solutions to systems of polynomial equations and polynomial inequalities. As it is the real solutions to such systems modeling…

We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…

We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

Polypols are natural generalizations of polytopes, with boundaries given by nonlinear algebraic hypersurfaces. We describe polypols in the plane and in 3-space that admit a unique adjoint hypersurface and study them from an…

We give a simple formula for the signature of a foldable triangulation of a lattice polygon in terms of its boundary. This yields lower bounds on the number of real roots of certain of systems of polynomial equations known as "Wronski…

We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…

The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…

We consider spaces of plane curves in the setting of algebraic geometry and of singularity theory. On one hand there are the complete linear systems, on the other we consider unfolding spaces of bivariate polynomials of Brieskorn-Pham type.…

In this paper, we revisit foundations of umbral calculus using a straightforward approach based on an explicit matrix realization of binomial convolution. We construct an umbral duality of Wronskian type for rational curves in echelon form,…

Given $mp$ different $p$-planes in general position in $(m+p)$-dimensional space, a classical problem is to ask how many $p$-planes intersect all of them. For example when $m = p = 2$, this is precisely the question of "lines meeting four…

We study the structure of collections of algebraic curves in three dimensions that have many curve-curve incidences. In particular, let $k$ be a field and let $\mathcal{L}$ be a collection of $n$ space curves in $k^3$, with…

Envelopes of parameterized families of plane curves is an important topic, both for the mathematics involved and for its applications. Nowadays, it is generally studied in a technology-rich environment, and automated methods are developed…

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…

We consider how the problem of determining normal forms for a specific class of nonholonomic systems leads to various interesting and concrete bridges between two apparently unrelated themes. Various ideas that traditionally pertain to the…

We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in 3D. We do not assume general position. Namely, we handle degenerate input, and produce exact results. We…

Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…