Related papers: Defect Polytopes and Counter-Examples With polymak…
We develop a homotopical variant of the classic notion of an algebraic theory as a tool for producing deformations of homotopy theories. From this, we extract a framework for constructing and reasoning with obstruction theories and spectral…
Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…
We will use toric degenerations of the projective plane ${{\mathbb{P}}^ 2}$ to give a new proof of the triple points interpolation problems in the projective plane. We also give a complete list of toric surfaces that are useful as…
We discuss the application of random projections to conic programming: notably linear, second-order and semidefinite programs. We prove general approximation results on feasibility and optimality using the framework of formally real Jordan…
We consider isomonodromic deformations of connections with a simple pole on the torus, motivated by the elliptic version of the sixth Painlev\'e equation. We establish an extended symmetry, complementing known results. The Calogero-Moser…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
We develop novel tools for computing the likelihood correspondence of an arrangement of hypersurfaces in a projective space. This uses the module of logarithmic derivations. This object is well-studied in the linear case, when the…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
In previous work, a class of noninvertible topological dynamical systems $f: X \to X$ was introduced and studied; we called these {\em topologically coarse expanding conformal} systems. To such a system is naturally associated a preferred…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
We consider the disjoint bilinear programming problem in which one of the disjoint subsets has the structure of an acute-angled polytope. An optimality criterion for such a problem is formulated and proved, and based on this, a polynomial…
In this paper, we explain a procedure based on a classical result of Sturm that can be used to determine rigorously whether a given trigonometric polynomial is nonnegative in a certain interval or not. Many examples are given. This…
A software for simplification of Dirac matrix polynomials that arise in particle physics problems is implemented.
In this paper, we consider a new class of generalized Convex structure and we investigate their tropical limits. Some properties are pointing out such that translation homotheticity and others ones allowing to consider the case of discrete…
We study the enumerative geometry of orbits of multidimensional toric action on projective algebraic varieties and develop a new cyclic differential-graded operad, conjecturally governing the real version of the enumerative geometry of…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
We study the geometry of centrally-symmetric random polytopes, generated by $N$ independent copies of a random vector $X$ taking values in $\mathbb{R}^n$. We show that under minimal assumptions on $X$, for $N \gtrsim n$ and with high…
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this paper we explore this correspondence to classify smooth lattice polytopes…
The software TrIm offers implementations of tropical implicitization and tropical elimination, as developed by Tevelev and the authors. Given a polynomial map with generic coefficients, TrIm computes the tropical variety of the image. When…
We report on enumerating the triangulations of cyclic polytopes with the new software mptopcom. This is relevant for its connection with higher Stasheff-Tamari orders, which occur in category theory and algebraic combinatorics.