Related papers: Polyhedral Methods in Numerical Algebraic Geometry
Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…
The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P = NP by introducing a universal, graph-based…
In this paper, we study the algebraic, rational and formal Puiseux series solutions of certain type of systems of autonomous ordinary differential equations. More precisely, we deal with systems which associated algebraic set is of…
Patchworking theorems serve as a basic element of the correspondence between tropical and algebraic curves, which is a core of the tropical enumerative geometry. We present a new version of a patchworking theorem which relates plane…
We discuss how the shape of a special Cosserat rod can be represented as a path in the special Euclidean algebra. By shape we mean all those geometric features that are invariant under isometries of the three-dimensional ambient space. The…
Given a simple polygon $\mathscr{P}$, two points $x$ and $y$ within $\mathscr{P}$ are {\em visible} to each other if the line segment between $x$ and $y$ is contained in $\mathscr{P}$. The {\em visibility region} of a point $x$ includes all…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
We consider an algebraic surface. For an irreducible curve on this surface and for a point on this curve one can associate an artinian ring, which is a sum of two-dimensional local fields. An example of two-dimensional local field is…
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…
In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope $P$ is a linear…
Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…
Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…
We study the geometry and arithmetic of the curves $C \colon y^3 = x^4 + ax^2 + b$ and their associated Prym abelian surfaces $P$. We prove a Torelli theorem in this context and give a geometric proof of the fact that $P$ has quaternionic…
We investigate geometric aspects of co-equational parametric resurgence, by studying physical problems whose formal asymptotic solutions give rise to Borel transforms lying on an algebraic curve. This perspective allows us to elucidate…
In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the second and the third…
Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…