Related papers: An Implicitization Challenge for Binary Factor Ana…
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…
There are two well known tasks, related to Newton polyhedra: to study invariants of singularities in terms of their Newton polyhedra, and to describe Newton polyhedra of resultants and discriminants. We introduce so called resultantal…
The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…
In this paper, we classify singular real plane tropical curves by means of subdivisions of Newton polytopes. First, we introduce signed Bergman fans (generalizing positive Bergman fans from [AKW06]) that describe real tropicalizations of…
This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…
A highly recurrent traditional bottleneck in applied mathematics, for which the most popular codes (Mathematica and Matlab) do not offer a solution, is to find all the real solutions of a system of N nonlinear equations in a certain finite…
The K-partitioning problem consists of partitioning the vertices of a graph in K sets so as to minimize a function of the edge weights. We introduce a linear mixed integer formulation with edge variables and representative variables. We…
In this paper we consider the Newton polygons of $L$-functions coming from additive exponential sums associated to a polynomial over a finite field $\F_q$. These polygons define a stratification of the space of polynomials of fixed degree.…
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…
We give a bijection between a quotient space of the parameters and the space of moments for any $A$-hypergeometric distribution. An algorithmic method to compute the inverse image of the map is proposed utilizing the holonomic gradient…
Fine and Gill (1973) introduced the geometric representation for those comparative probability orders on n atoms that have an underlying probability measure. In this representation every such comparative probability order is represented by…
The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…
We study a tropical analogue of the projective dual variety of a hypersurface. When $X$ is a curve in $\mathbb{P}^2$ or a surface in $\mathbb{P}^3$, we provide an explicit description of $\text{Trop}(X^*)$ in terms of $\text{Trop}(X)$, as…
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…
The number of positive solutions of a system of two polynomials in two variables defined in the field of real numbers with a total of five distinct monomials cannot exceed 15. All previously known examples have at most 5 positive solutions.…
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.
We obtain 866 isomorphism classes of five-dimensional nonsingular toric Fano varieties using a computer program and the database of four-dimensional reflexive polytopes. The algorithm is based on the existence of facets of Fano polytopes…
We consider the homotopical dynamics on compact orientable surfaces of positive genus g. We establish a sufficient and necessary algebraic criterion for homotopy classes with infinitely many periodic points of maps on such surfaces in terms…
Let $P$ be a cubic $3$-connected bipartite plane graph which has a $2$-factor which consists only of facial $4$-cycles, and suppose that $P^{*}$ is the dual graph. We show that $P$ has at least $3^{\frac{2|P^{*}|}{\Delta^{2}{(P^{*})}}}$…
The polytope of integer partitions of $n$ is the convex hull of the corresponding $n$-dimensional integer points. Its vertices are of importance because every partition is their convex combination. Computation shows intriguing features of…