English
Related papers

Related papers: Viro's patchworking and the signed reduced A-discr…

200 papers

We introduce a class of combinatorial hypersurfaces in the complex projective space. They are submanifolds of codimension~2 in $\C P^n$ and are topologically "glued" out of algebraic hypersurfaces in $(\C^*)^n$. Our construction can be…

Algebraic Geometry · Mathematics 2016-09-07 Ilia Itenberg , Eugenii Shustin

Patchworking is a construction of a one-parameter family of real algebraic hypersurfaces. For sufficiently small positive values of the parameter, the hypersurfaces can be obtained by gluing of given hypersurfaces topologically. The author…

Algebraic Geometry · Mathematics 2007-05-23 Oleg Viro

In this article we focus on the study of special parabolic points in surfaces arising as graphs of polynomials, we give a theorem of Viro's patchworking type to build families of real polynomials in two variables with a prescribed number of…

Algebraic Geometry · Mathematics 2018-05-21 Fuensanta Aroca Bisquert , Angelito Camacho Calderón , Mirna Gómez Morales

We investigate the signed support, that is, the set of the exponent vectors and the signs of the coefficients, of a multivariate polynomial $f$. We describe conditions on the signed support ensuring that the semi-algebraic set, denoted as…

Algebraic Geometry · Mathematics 2024-08-28 Máté L. Telek

In this work we establish a connection between copositivity, that is, nonnegativity on the positive orthant, of sparse real Laurent polynomials and discriminants. Specifically, we consider Laurent polynomials in the positive orthant with…

Algebraic Geometry · Mathematics 2025-12-10 Elisenda Feliu , Joan Ferrer , Máté L. Telek

We extend the definition of $\mathcal{A}$-discriminant varieties, and Kapranov's parametrization of $\mathcal{A}$-discriminant varieties, to complex exponents. As an application, we study the special case where $\mathcal{A}$ is a fixed real…

Algebraic Geometry · Mathematics 2017-10-31 J. Maurice Rojas , Korben Rusek

A polynomial system with $n$ equations in $n$ variables supported on a set $\mathcal{W}\subset\mathbb{R}^n$ of $n+2$ points has at most $n+1$ non-degenerate positive solutions. Moreover, if this bound is reached, then $\mathcal{W}$ is…

Algebraic Geometry · Mathematics 2016-03-08 Boulos El Hilany

We investigate a version of Viro's method for constructing polynomial systems with many positive solutions, based on regular triangulations of the Newton polytope of the system. The number of positive solutions obtained with our method is…

Combinatorics · Mathematics 2019-06-04 Frédéric Bihan , Francisco Santos , Pierre-Jean Spaenlehauer

Viro method plays an important role in the study of topology of real algebraic hypersurfaces. The T-primitive hypersurfaces we study here appear as the result of Viro's combinatorial patchworking when one starts with a primitive…

Algebraic Geometry · Mathematics 2007-10-15 Benoit Bertrand

This paper generalises the homeomorphism theorem behind Viro's combinatorial patchworking of hypersurfaces in toric varieties to arbitrary codimension using tropical geometry. We first define the patchwork of a polyhedral space equipped…

Algebraic Geometry · Mathematics 2023-10-13 Johannes Rau , Arthur Renaudineau , Kris Shaw

We construct a polynomial of degree d in two variables whose Hessian curve has (d-2)^2 connected components using Viro patchworking. In particular, this implies the existence of a smooth real algebraic surface of degree d in RP^3 whose…

Algebraic Geometry · Mathematics 2009-04-30 Benoit Bertrand , Erwan Brugallé

In a previous work, we gave a construction of (not necessarily realizable) oriented matroids from a triangulation of a product of two simplices. In this follow-up paper, we use a variant of Viro's patchworking to derive a topological…

Combinatorics · Mathematics 2020-10-26 Marcel Celaya , Georg Loho , Chi Ho Yuen

Consider a regular triangulation of the convex-hull $P$ of a set $\mathcal A$ of $n$ points in $\mathbb R^d$, and a real matrix $C$ of size $d \times n$. A version of Viro's method allows to construct from these data an unmixed polynomial…

Algebraic Geometry · Mathematics 2016-04-19 Frédéric Bihan , Pierre-Jean Spaenlehauer

To a univariate monic polynomial is attached a special planar forest that is called the picture of the polynomial. Isotopy classes of pictures are called signatures. All combinatorially possible signatures are realized and spaces of…

Algebraic Geometry · Mathematics 2017-02-21 Norbert A'Campo

We call a real algebraic hypersurface in $(\mathbb{C}^*)^n$ simplicial if it is given by a real Laurent polynomial in $n$-variables that has exactly $n+1$ monomials with non-zero coefficients and such that the convex hull in $\mathbb{R}^n$…

Algebraic Geometry · Mathematics 2021-05-26 Charles Arnal

In this article, we describe a recursive method for constructing a family of real projective algebraic hypersurfaces in ambient dimension $n$ from families of such hypersurfaces in ambient dimensions $k=1,\ldots,n-1$. The asymptotic Betti…

Algebraic Geometry · Mathematics 2024-02-22 Charles Arnal

In this paper, we present four families of maximal real algebraic hypersurfaces of even degree in $\mathbb{RP}^4$ constructed using O. Viro's combinatorial patchworking method. We compare the Euler characteristic of the real part and the…

Algebraic Geometry · Mathematics 2023-10-30 Aloïs Demory

We present a Hilbert space geometric approach to the problem of characterizing the positive bivariate trigonometric polynomials that can be represented as the square of a two variable polynomial possessing a certain stability requirement,…

Complex Variables · Mathematics 2016-03-21 Jeffrey S. Geronimo , Plamen Iliev , Greg Knese

We give partial generalizations of the classical Descartes' rule of signs to multivariate polynomials (with real exponents), in the sense that we provide upper bounds on the number of connected components of the complement of a hypersurface…

Algebraic Geometry · Mathematics 2022-07-07 Elisenda Feliu , Máté L. Telek

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Optimization and Control · Mathematics 2008-01-24 Didier Henrion
‹ Prev 1 2 3 10 Next ›