中文
相关论文

相关论文: Newton polyhedra of discriminants of projections

200 篇论文

On the set of complex number $\mathbb{C}$ it is possible to define $n$-valued group for any positive integer $n$. The $n$-multiplication defines a symmetric polynomial $p_n = p_n(x, y, z)$ with integer coefficients. By the theorem on…

群论 · 数学 2023-05-15 Valeriy G. Bardakov , Tatyana A. Kozlovskaya

The discriminant of a multivariate polynomial with indeterminate coefficients is not necessarily a hypersurface, and characterizing its codimension was an open problem for quite a while. We resolve this problem for the discriminants of…

代数几何 · 数学 2026-02-17 Vladislav Pokidkin

We consider polynomially and rationally parameterized curves, where the polynomials in the parameterization have fixed supports and generic coefficients. We apply sparse (or toric) elimination theory in order to determine the vertex…

代数几何 · 数学 2008-11-04 Ioannis Z. Emiris , Christos Konaxis , Leonidas Palios

The $p$-adic Newton polygon is a visual tool that encodes information about the roots and factorization of a polynomial relative to a prime $p$. In this article, we investigate how the Newton polygon changes under polynomial composition. If…

数论 · 数学 2025-01-29 Rylan Gajek-Leonard , Uri Tomer

In this paper, we consider the problem of solving a constrained system of nonlinear equations. We propose an algorithm based on a combination of the Newton and conditional gradient methods, and establish its local convergence analysis. Our…

最优化与控制 · 数学 2016-08-25 Max L. N. Goncalves , Jefferson G. Melo

We characterise Newton polytopes of nondegenerate quadratic forms and Newton polyhedra of Morse singularities.

组合数学 · 数学 2019-10-15 Aliaksandr Yuran

We determine the $166\,104$ extremal monomials of the discriminant of a quaternary cubic form. These are in bijection with $D$-equivalence classes of regular triangulations of the $3$-dilated tetrahedron. We describe how to compute these…

组合数学 · 数学 2019-09-20 Lars Kastner , Robert Loewe

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

计算复杂性 · 计算机科学 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé

Using Newton polyhedra and non-degeneracy of matrices we present conditions which guarantee the Whitney equisingularity of families of isolated determinantal singularities.

代数几何 · 数学 2025-01-23 Thaís M. Dalbelo , Luiz Hartmann , Maicom Varella

We identify new sufficiency conditions for coercivity of general multivariate polynomials $f\in\mathbb{R}[x]$ which are expressed in terms of their Newton polytopes at infinity and which consist of a system of affine-linear inequalities in…

最优化与控制 · 数学 2020-01-13 Tomas Bajbar , Yoshiyuki Sekiguchi

For the class of polynomial quadrature rules we show that conveniently chosen bases allow to compute both the weights and the theoretical error expression of a $n$-point rule via the undetermined coefficients method. As an illustration, the…

数值分析 · 数学 2012-04-02 Mário M. Graça , M. Esmeralda Sousa-Dias

By calculating the equivariant mixed Hodge numbers of motivic Milnor fibers introduced by Denef-Loeser, we obtain explicit formulas for the Jordan normal forms of Milnor monodromies. The numbers of the Jordan blocks will be described by the…

代数几何 · 数学 2012-02-24 Yutaka Matsui , Kiyoshi Takeuchi

The well-known Bernstein-Kushnirenko theorem from the theory of Newton polyhedra relates algebraic geometry and the theory of mixed volumes. Recently the authors have found a far-reaching generalization of this theorem to generic systems of…

代数几何 · 数学 2008-12-31 Kiumars Kaveh , A. G. Khovanskii

We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…

组合数学 · 数学 2012-11-02 Edward D. Kim

We consider a continuous family $(f_s)$, $s\in[0,1]$ of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or…

代数几何 · 数学 2007-05-23 Arnaud Bodin

Let $ \mathcal{A}_1, \ldots, \mathcal{A}_k $ be finite sets in $ \mathbb{Z}^n $ and let $ Y \subset (\mathbb{C}^*)^n $ be an algebraic variety defined by a system of equations \[ f_1 = \ldots = f_k = 0, \] where $ f_1, \ldots, f_k $ are…

代数几何 · 数学 2018-10-02 Leonid Monin

At the heart of convex geometry lies the observation that the volume of convex bodies behaves as a polynomial. Many geometric inequalities may be expressed in terms of the coefficients of this polynomial, called mixed volumes. Among the…

度量几何 · 数学 2023-09-18 Yair Shenfeld , Ramon van Handel

In this paper we characterize, in two different ways, the Newton polygons which are jacobian Newton polygons of a branch. These characterizations give in particular combinatorial criteria of irreducibility for complex series in two…

代数几何 · 数学 2013-05-13 Evelia R. García Barroso , Janusz Gwoździewicz

A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…

组合数学 · 数学 2019-12-03 Cara Monical , Neriman Tokcan , Alexander Yong

The ring of conditions defined by C. De Concini and C. Procesi is an intersection theory for algebraic cycles in a spherical homogeneous space. In the paper we consider the ring of conditions for the group $(C^*)^n$. Up to a big extend this…

代数几何 · 数学 2017-05-16 Boris Kazarnovskii , Askold Khovanskii