相关论文: Newton polyhedra of discriminants of projections

Let a planar algebraic curve $C$ be defined over a valuation field by an equation $F(x,y)=0$. Valuations of the coefficients of $F$ define a subdivision of the Newton polygon $\Delta$ of the curve $C$. If a given point $p$ is of…

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

We prove that the Newton product of efficient polynomial projectors is still efficient. Various polynomial approximation theorems are established involving Newton product projectors on spaces of holomorphic functions on a neighborhood of a…

We prove the structure theorem of the intersection complexes of toric varieties in the category of mixed Hodge modules. This theorem is due to Bernstein, Khovanskii and MacPherson for the underlying complexes with rational coefficients. As…

Given a complex algebraic hypersurface~$H$, we introduce a polyhedral complex which is a subset of the Newton polytope of the defining polynomial for~$H$ and enjoys the key topological and combinatorial properties of the amoeba of~$H.$ We…

In this paper, we study the structure of Newton polygons for compositions of polynomials over the rationals. We establish sufficient conditions under which the successive vertices of the Newton polygon of the composition $ g(f^n(x)) $ with…

By introducing motivic Milnor fibers at infinity of polynomial maps, we propose some methods for the study of nilpotent parts of monodromies at infinity. The numbers of Jordan blocks in the monodromy at infinity will be described by the…

The purpose of this paper is to investigate order of contact on real hypersurfaces in ${\mathbb C}^n$ by using Newton polyhedra which are important notion in the study of singularity theory. To be more precise, an equivalence condition for…

Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.

Translation from the Latin original, "Demonstratio gemina theorematis Neutoniani, quo traditur relatio inter coefficientes cuiusvis aequationis algebraicae et summas potestatum radicum eiusdem" (1747). E153 in the Enestrom index. In this…

When studying the multilinear PageRank problem, a system of polynomial equations needs to be solved. In this paper, we develop convergence theory for a modified Newton method in a particular parameter regime. The sequence of vectors…

R. M. Brown's theorem on mixed Dirichlet and Neumann boundary conditions is extended in two ways for the special case of polyhedral domains. A (1) more general partition of the boundary into Dirichlet and Neumann sets is used on (2)…

The Gauss-Bonnet theorem for a polyhedron (a union of finitely many compact convex polytopes) in $n$-dimensional Euclidean space expresses the Euler characteristic of the polyhedron as a sum of certain curvatures, which are different from…

We apply tropical geometry to study the image of a map defined by Laurent polynomials with generic coefficients. If this image is a hypersurface then our approach gives a construction of its Newton polytope.

The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the…

Recently, Chapoton found a $q$-analog of Ehrhart polynomials, which are polynomials in $x$ whose coefficients are rational functions in $q$. Chapoton conjectured the shape of the Newton polygon of the numerator of the $q$-Ehrhart polynomial…

We prove that every supersymmetric Schur polynomial has a saturated Newton polytope (SNP). Our approach begins with a tableau-theoretic description of the support, which we encode as a polyhedron with a totally unimodular constraint matrix.…

In this paper we compute the Newton polytope $\mathcal M_A$ of the Morse discriminant in the space of univariate polynomials with the given support set $A.$ Namely, we establish a surjection between the set of all combinatorial types of…

We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…

This work is concerned with an inverse elastic scattering problem of identifying the unknown rigid obstacle embedded in an open space filled with a homogeneous and isotropic elastic medium. A Newton-type iteration method relying on the…