Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithm for computing the truncation of the discriminant of a polynomial

From MaRDI portal
Publication:6043784
Jump to:navigation, search

DOI10.1134/s0361768823010061zbMath1523.14083MaRDI QIDQ6043784

Evgeny Mikhalkin, A. P. Lyapin

Publication date: 24 May 2023

Published in: Programming and Computer Software (Search for Journal in Brave)



Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Computational methods for problems pertaining to convex and discrete geometry (52-08)


Related Items (1)

On sums of Newton polytopes for discriminants of polynomials



Cites Work

  • Unnamed Item
  • Unnamed Item
  • On the analytic complexity of discriminants
  • Blow-ups for the Horn-Kapranov parametrization of the classical discriminant
  • On facets of the Newton polytope for the discriminant of the polynomial system
  • Geometry of factorization identities for discriminants
  • Tropical discriminants
  • Hispanic Heritage Month
  • Detailed Factorization Identities for Classical Discriminant


This page was built for publication: Algorithm for computing the truncation of the discriminant of a polynomial

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6043784&oldid=35465033"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 10 July 2024, at 05:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki