相关论文: Newton polyhedra of discriminants of projections
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
There are two well known tasks, related to Newton polyhedra: to study invariants of singularities in terms of their Newton polyhedra, and to describe Newton polyhedra of resultants and discriminants. We introduce so called resultantal…
We introduce the theory of local and global monodromies of polynomials in cohomology groups in various geometric situations, focusing on its relations with toric geometry and motivic Milnor fibers, and moreover in the modern languages of…
Poincar\'e's Polyhedron Theorem is a widely known valuable tool in constructing manifolds endowed with a prescribed geometric structure. It is one of the few criteria providing discreteness of groups of isometries. This work contains a…
In this work we present a formula for the Euler characteristic of the Milnor fiber of non-degenerate functions $f: X \to \mathbb{C}$ with isolated critical set relative to a stratification, where $X$ is a $2$-generic symmetric determinantal…
A new transparent proof of the well known good compactification theorem for the complex torus $(\Bbb C^*)^n$ is presented. This theorem provides a powerful tool in enumerative geometry for subvarieties in the complex torus. The paper also…
We studies the Newton polygon for the L-function of toric exponential sums attached to a family of two variable generalized hyperkloosterman sum,$f_{t}(x,y)=x^{n}+y+\frac{t}{xy}$ with $t$ the parameter. The explicit Newton polygon is…
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
In this paper we first describe the geometry of the Newton polyhedra of polynomials invariant under certain linear Hamiltonian circle actions. From the geometry of the polyhedra, various Poisson structures on the orbit spaces of the actions…
We present two algorithms that compute the Newton polytope of a polynomial defining a hypersurface H in C^n using numerical computation. The first algorithm assumes that we may only compute values of f - this may occur if f is given as a…
The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…
In this article we give an expression of the motivic Milnor fiber at infinity and the motivic nearby cycles at infinity of a polynomial $f$ in two variables with coefficients in an algebraic closed field of characteristic zero. This…
We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…
The motivic nearby fiber is an invariant obtained from degenerating a complex variety over a disc. It specializes to the Euler characteristic of the original variety but also contains information on the variation of Hodge structure…
We study the monodromies and the limit mixed Hodge structures of families of complete intersection varieties over a punctured disk in the complex plane. For this purpose, we express their motivic nearby fibers in terms of the geometric data…
We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…
In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the resulting subresultant polynomials be expressed in the same Newton basis as that…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…
The aim of this study is to provide a perspective to help understand the singular average operator over polynomial hypersurfaces. In particular, this perspective will provide brevity and the possibility of generalizing previous results…