相关论文: Elimination theory and Newton polytopes

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…

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.

A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.

An interpretation of selected parts of Newton's Principia, with modern notation and methods. Keplers Laws are derived from an inverse square law using Newton's methods.

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

We show how it is possible to define and study black holes of arbitrary shapes in the framework of Newtonian mechanics.

Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…

Tropical algebraic geometry offers new tools for elimination theory and implicitization. We determine the tropicalization of the image of a subvariety of an algebraic torus under any homomorphism from that torus to another torus.

The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…

The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in…

This study presents a axisymmetric solution of the Einstein equations for empty space. The geometry is studied by determining its Petrov classification and Killing vectors. Light propagation, orbital motion and asymptotic and Newtonian…

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 use the elimination theory to explicitly construct the (n-3)! order polynomial in one of the variables of the scattering equations. The answer can be given either in terms of a determinant of Sylvester type of dimension (n-3)! or a…

We study Noether's problem from the perspective of torsors under linear algebraic groups and descent.

We try to lay down the foundations of a Newtonian theory where inertia and gravitational fields appear in a unified way aiming to reach a better understanding of the general relativistic theory. We also formulate a kind of equivalence…

In this article we introduce a generalization of the Newton transformation to the case of a system of endomorphisms. We show that it can be used in the context of extrinsic geometry of foliations and distributions yielding new integral…

We extend the Newton's method and show the extended Newton's method leads to the binomial expansion of Newton's method that the convergences become the quadratic and linearly. In case of the quadratic convergence, we give the convergence…