Related papers: Transversal special parabolic points in the graph …
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…
Computing the isotopy type of a hypersurface, defined as the positive real zero set of a multivariate polynomial, is a challenging problem in real algebraic geometry. We focus on the case where the defining polynomial has combinatorially…
A cumbersome hypothesis for Viro patchworking of real algebraic curves is the convexity of the given subdivision. It is an open question in general to know whether the convexity is necessary. In the case of trigonal curves we interpret Viro…
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…
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…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
We prove that Viro's patchworking produces real algebraic curves with the maximal number of real inflection points. In particular this implies that maximally inflected real algebraic $M$-curves realize many isotopy types. The strategy we…
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…
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…
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…
We study a question with connections to linear algebra, real algebraic geometry, combinatorics, and complex analysis. Let $p(x,y)$ be a polynomial of degree $d$ with $N$ positive coefficients and no negative coefficients, such that $p=1$…
We establish a patchworking theorem \`a la Viro for the Log-critical locus of algebraic curves in $(\mathbb{C}^*)^2$. As an application, we prove the existence of projective curves of arbitrary degree with smooth connected Log-critical…
We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…
In this article, we introduce and investigate polynomial curvelets on spheres, which form a class of Parseval frames for $L^2(\mathbb{S}^{d-1})$, $d \geq 3$. The proposed construction offers a directionally sensitive multiscale…
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…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
We study the equipotential surfaces around of a two particle system in 3-d under a pairwise good potential as the one of Van der Waals. The level sets are completely determined by the solutions of polynomials of at most fourth degree that…
An $(n,d,\lambda)$-graph is a $d$ regular graph on $n$ vertices in which the absolute value of any nontrivial eigenvalue is at most $\lambda$. For any constant $d \geq 3$, $\epsilon>0$ and all sufficiently large $n$ we show that there is a…
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…
The generating functions of the Severi degrees for sufficiently ample line bundles on algebraic surfaces are multiplicative in the topological invariants of the surface and the line bundle. Recently new proofs of this fact were given for…