相关论文: Newton polyhedra of discriminants of projections

Assume that the coefficients of a polynomial in a complex variable are Laurent polynomials in some complex parameters. The parameter space (a complex torus) splits into strata corresponding to different combinations of coincidence of the…

The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…

Let $\chi$ be an order $c$ multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and $T$-adic Newton polygons of $f$. When $p>(d-e)(2d-1)$, we give a lower bound of…

We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…

We prove Newton's binomial formulas for Schubert Calculus to determine numbers of base point free linear series on the projective line with prescribed ramification divisor supported at given distinct points.

Let $X$ be the family of hypersurfaces in the odd-dimensional torus ${\mathbb T}^{2n+1}$ defined by a Laurent polynomial $f$ with fixed exponents and variable coefficients. We show that if $n\Delta$, the dilation of the Newton polytope…

We introduce a variation of the well-known Newton-Hironaka polytope for algebroid hypersurfaces. This combinatorial object is a perturbed version of the original one, parametrized by a real number. For well-chosen values of the parameter,…

We study normal directions to facets of the Newton polytope of the discriminant of the Laurent polynomial system via the tropical approach. We use the combinatorial construction proposed by Dickenstein, Feichtner and Sturmfels for the…

The purpose of this paper is to introduce the notion of mixed twistor structure, a generalization of the notion of mixed Hodge structure. The utility of this notion is to make possible a theory of weights for various things surrounding…

We introduce a new non-degeneracy condition at infinity for a real or a mixed polynomial mapping $F$ which allows us to approximate its bifurcation locus in terms of certain Newton polyhedra. We derive a sufficiency result for the Jacobian…

We introduce the notion of a weighted $\delta$-vector of a lattice polytope. Although the definition is motivated by motivic integration, we study weighted $\delta$-vectors from a combinatorial perspective. We present a version of Ehrhart…

This is the LaTeX version of the handwritten notes of a lecture at the Kyoto Singularities Symposium held at the RIMS in April 1978. It presents the relationship of various invariants of isolated singularities of complex analytic…

What polynomial in the coefficients of a system of algebraic equations should be called its discriminant? We prove a package of facts that provide a possible answer. Let us call a system typical, if the homeomorphic type of its set of…

The boundary of the Milnor fiber associated with a complex line arrangement is a three dimensional plumbed manifold, and it is a combinatorial invariant. We prove the reverse implication, which was conjectured N\'emethi and Szil\'ard. That…

As for the ${}_2F_3$ hypergeometric function of the form \begin{equation*} {}_2F_3\left[\begin{array}{c} a_1, a_2\\ b_1, b_2, b_3\end{array}\biggr| -x^2\right]\qquad(x>0), \end{equation*} where all of parameters are assumed to be positive,…

In this article, using generalized derivations, we obtain a simple idea to prove the non-commutative Newton binomial formula in unital algebras and then, we extend that formula to non-unital algebras. Additionally, we establish the…

Deep learning has received much attention lately due to the impressive empirical performance achieved by training algorithms. Consequently, a need for a better theoretical understanding of these problems has become more evident in recent…

We find a relation between mixed volumes of several polytopes and the convex hull of their union, deducing it from the following fact: the mixed volume of a collection of polytopes only depends on the product of their support functions…

In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…

The bifurcation sets of polynomial functions have been studied by many mathematicians from various points of view. In particular, N\'emethi and Zaharia described them in terms of Newton polytopes. In this paper, we will show analogous…