English
Related papers

Related papers: Solid Amoebas of Maximally Sparse Polynomials

200 papers

The amoeba of a Laurent polynomial $f \in \C[z_1^{\pm 1},\ldots,z_n^{\pm 1}]$ is the image of its zero set $\mathcal{V}(f)$ under the log-absolute-value map. Understanding the space of amoebas (i.e., the decomposition of the space of all…

Algebraic Geometry · Mathematics 2013-04-24 Thorsten Theobald , Timo de Wolff

Let $V$ be a complex algebraic hypersurface defined by a polynomial $f$ with Newton polytope $\Delta$. It is well known that the spine of its amoeba has a structure of a tropical hypersurface. We prove in this paper that there exists a…

Algebraic Geometry · Mathematics 2009-12-05 Mounir Nisse

The paper deals with singularities of nonconfluent hypergeometric functions in several variables. Typically such a function is a multi-valued analytic function with singularities along an algebraic hypersurface. We describe such…

Complex Variables · Mathematics 2007-05-23 Mikael Passare , Timur Sadykov , August Tsikh

Given any complex Laurent polynomial $f$, $\mathrm{Amoeba}(f)$ is the image of its complex zero set under the coordinate-wise log absolute value map. We give an efficiently constructible polyhedral approximation, $\mathrm{ArchtTrop}(f)$, of…

Algebraic Geometry · Mathematics 2017-03-20 Martin Avendano , Roman Kogan , Mounir Nisse , J. Maurice Rojas

Given a complex algebraic hypersurface~$H$, we introduce a polyhedral complex which is a subset of the Newton polytope of the defining polynomial for~$H$ and enjoys the key topological and combinatorial properties of the amoeba of~$H.$ We…

Algebraic Geometry · Mathematics 2017-08-24 Mounir Nisse , Timur Sadykov

This paper is a report based on the results obtained during a three months internship at the University of Pittsburgh by the first author and under the mentorship of the second author. The notion of an amoeba of a subvariety in a torus…

Algebraic Geometry · Mathematics 2022-12-07 Rémi Delloque , Kiumars Kaveh

We study amoebas of exponential sums as functions of the support set $A$. To any amoeba, we associate a set of approximating sections of amoebas, which we call caissons. We show that a bounded modular lattice of subspaces of a certain…

Algebraic Geometry · Mathematics 2018-11-13 Jens Forsgård , Timo de Wolff

We consider Gromov's homological higher convexity for complements of tropical varieties, establishing it for complements of tropical hypersurfaces and curves, and for nonarchimedean amoebas of varieties that are complete intersections over…

Algebraic Geometry · Mathematics 2015-07-09 Mounir Nisse , Frank Sottile

We show that the amoeba of a complex algebraic variety defined as the solutions to a generic system of $n$ polynomials in $n$ variables has a finite basis. In other words, it is the intersection of finitely many hypersurface amoebas.…

Algebraic Geometry · Mathematics 2014-04-15 Mounir Nisse

Let $X$ be a smooth irreducible quasi-projective algebraic variety over a number field $K$. Suppose $X$ is equipped with a $p$-adic \'{e}tale local system compatible with an admissible graded-polarized variation of mixed Hodge structures on…

Number Theory · Mathematics 2025-08-15 Kenneth Chung Tak Chiu

In this paper we try to look at the compactification of Teichmuller spaces from a tropical viewpoint. We describe a general construction for the compactification of algebraic varieties, using their amoebas, and we describe the boundary via…

Algebraic Geometry · Mathematics 2007-05-23 Daniele Alessandrini

Given a hypersurface coamoeba of a Laurent polynomial f, it is an open problem to describe the structure of its set of connected complement components. In this paper we approach this problem by introducing the lopsided coamoeba. We show…

Algebraic Geometry · Mathematics 2014-01-21 Jens Forsgård , Petter Johansson

Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas of hypersurfaces have been intensively studied in recent…

Combinatorics · Mathematics 2017-02-07 Martina Juhnke-Kubitzke , Timo de Wolff

Monadic stability generalizes many tameness notions from structural graph theory such as planarity, bounded degree, bounded tree-width, and nowhere density. The sparsification conjecture predicts that the (possibly dense) monadically stable…

Discrete Mathematics · Computer Science 2026-01-23 Nikolas Mählmann , Sebastian Siebertz

Nicaise--Ottem introduced the notion of (stably) rational polytopes and studied this using a combinatorial description of the motivic volume. In this framework, we ask whether being non-stably rational is preserved under inclusions. We…

Algebraic Geometry · Mathematics 2023-11-03 Simen Westbye Moe

We study tropical degree bounds, stable tropical intersections, and tropical B\'ezout-type estimates through the geometry of Newton polytopes, mixed subdivisions, and lattice indices. We establish an upper bound for the tropical degree of a…

Algebraic Geometry · Mathematics 2026-05-26 Mounir Nisse

This paper analyzes the representation theoretic stability, in the sense of Thomas Church and Benson Farb, of the rank-selected homology of the Boolean lattice and the partition lattice, proving sharp uniform representation stability bounds…

Combinatorics · Mathematics 2026-05-13 Patricia Hersh , Sheila Sundaram

This paper investigates the cost of solving systems of sparse polynomial equations by homotopy continuation. First, a space of systems of $n$-variate polynomial equations is specified through $n$ monomial bases. The natural locus for the…

Numerical Analysis · Mathematics 2020-05-05 Gregorio Malajovich

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2014-05-05 Danko Adrovic , Jan Verschelde

In recent years it was proved that simple modifications of the classical Frank-Wolfe algorithm (aka conditional gradient algorithm) for smooth convex minimization over convex and compact polytopes, converge with linear rate, assuming the…

Optimization and Control · Mathematics 2021-01-08 Dan Garber
‹ Prev 1 2 3 10 Next ›