Shadows of Newton polytopes

Pavel Hrubeš; Amir Yehudayoff

doi:10.1007/s11856-023-2510-z

Shadows of Newton polytopes

Pavel Hrubeš, Amir Yehudayoff

Mathematics

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

We define the shadow complexity of a polytope P as the maximum number of vertices in a linear projection of P to the plane. We describe connections to algebraic complexity and to parametrized optimization. We also provide several basic examples and constructions, and develop tools for bounding shadow complexity.

Original language	English
Pages (from-to)	311-343
Number of pages	33
Journal	Israel Journal of Mathematics
Volume	256
Issue number	1
DOIs	https://doi.org/10.1007/s11856-023-2510-z
State	Published - Sep 2023

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.1007/s11856-023-2510-z

Cite this

@article{6bed91a2e97d428ab490f051f2e87a4e,

title = "Shadows of Newton polytopes",

abstract = "We define the shadow complexity of a polytope P as the maximum number of vertices in a linear projection of P to the plane. We describe connections to algebraic complexity and to parametrized optimization. We also provide several basic examples and constructions, and develop tools for bounding shadow complexity.",

author = "Pavel Hrube{\v s} and Amir Yehudayoff",

note = "Publisher Copyright: {\textcopyright} 2023, The Hebrew University of Jerusalem.",

year = "2023",

month = sep,

doi = "10.1007/s11856-023-2510-z",

language = "الإنجليزيّة",

volume = "256",

pages = "311--343",

journal = "Israel Journal of Mathematics",

issn = "0021-2172",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Shadows of Newton polytopes

AU - Hrubeš, Pavel

AU - Yehudayoff, Amir

PY - 2023/9

Y1 - 2023/9

N2 - We define the shadow complexity of a polytope P as the maximum number of vertices in a linear projection of P to the plane. We describe connections to algebraic complexity and to parametrized optimization. We also provide several basic examples and constructions, and develop tools for bounding shadow complexity.

AB - We define the shadow complexity of a polytope P as the maximum number of vertices in a linear projection of P to the plane. We describe connections to algebraic complexity and to parametrized optimization. We also provide several basic examples and constructions, and develop tools for bounding shadow complexity.

UR - http://www.scopus.com/inward/record.url?scp=85173716859&partnerID=8YFLogxK

U2 - 10.1007/s11856-023-2510-z

DO - 10.1007/s11856-023-2510-z

M3 - مقالة

SN - 0021-2172

VL - 256

SP - 311

EP - 343

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

IS - 1

ER -

Shadows of Newton polytopes

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this