Related papers: Almost-toric Hypersurfaces

A monoid hypersurface is an irreducible hypersurface of degree d which has a singular point of multiplicity d-1. Any monoid hypersurface admits a rational parameterization, hence is of potential interest in computer aided geometric design.…

We build two embedded resolution procedures of a quasi-ordinary singularity of complex analytic hypersurface, by using toric morphisms which depend only on the characteristic monomials associated to a quasi-ordinary projection of the…

Polar weighted homogeneous polynomials are the class of special polynomials of real variables $x_i,y_i, i=1,..., n$ with $z_i=x_i+\sqrt{-1} y_i$, which enjoys a "polar action". In many aspects, their behavior looks like that of complex…

The geometry of hypersurfaces is generalized to pseudo-hypersurfaces, which are defined by Pfaff equations. The general methods are then applied to modeling the kinematics of motion constrained by a single linear, non-holonomic constraint.…

This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost…

This paper studies geometric properties of the Iterated Matrix Multiplication polynomial and the hypersurface that it defines. We focus on geometric aspects that may be relevant for complexity theory such as the symmetry group of the…

We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…

A hypertoric variety is a quaternionic analogue of a toric variety. Just as the topology of toric varieties is closely related to the combinatorics of polytopes, the topology of hypertoric varieties interacts richly with the combinatorics…

In this note, we use estimates given in the recent preprint [Her11b]to deduce a formula for the F-pure threshold of a binomial hypersurface over a field of prime characteristic. These formulas are given in terms of the associated splitting…

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

We unveil in concrete terms the general machinery of the syzygy-based algorithms for the implicitization of rational surfaces in terms of the monomials in the polynomials defining the parametrization, following and expanding our joint…

Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…

Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…

We present a variety of geometrical and combinatorial tools that are used in the study of geometric structures on surfaces: volume, contact, symplectic, complex and almost complex structures. We start with a series of local rigidity results…

In this paper we apply for the first time a new method for multivariate equation solving which was developed in \cite{gh1}, \cite{gh2}, \cite{gh3} for complex root determination to the {\em real} case. Our main result concerns the problem…

We provide a combinatorial characterization of monomial linear systems on toric varieties whose general member is quasismooth. This is given both in terms of the Newton polytope and in terms of the matrix of exponents of a monomial basis.

The objective of this paper is to show how the recently proposed method by Giusti, Heintz, Morais, Morgenstern, Pardo \cite{gihemorpar} can be applied to a case of real polynomial equation solving. Our main result concerns the problem of…

This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…

We study the topology of the real algebraic hypersurfaces in $\mathbb{P}^n$ that can be constructed via combinatorial patchworking using triangulations that are dilations by two of other triangulations. By examining the real critical points…

A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed 'dense', solving them…