Enumerative aspects of the Gross-Siebert program

We present enumerative aspects of the Gross-Siebert program in this introductory survey. After sketching the program's main themes and goals, we review the basic definitions and results of logarithmic and tropical geometry. We give examples and a proof for counting algebraic curves via tropical curves. To illustrate an application of tropical geometry and the Gross-Siebert program to mirror symmetry, we discuss the mirror symmetry of the projective plane.Comment: A version of these notes will appear as a chapter in an upcoming Fields Institute volume. 81 page

Multi-indexed Wilson and Askey-Wilson Polynomials

As the third stage of the project multi-indexed orthogonal polynomials, we present, in the framework of 'discrete quantum mechanics' with pure imaginary shifts in one dimension, the multi-indexed Wilson and Askey-Wilson polynomials. They are obtained from the original Wilson and Askey-Wilson polynomials by multiple application of the discrete analogue of the Darboux transformations or the Crum-Krein-Adler deletion of 'virtual state solutions' of type I and II, in a similar way to the multi-indexed Laguerre, Jacobi and (q-)Racah polynomials reported earlier.Comment: 30 pages. Three references added. To appear in J.Phys.A. arXiv admin note: text overlap with arXiv:1203.586

Linear programs and convex hulls over fields of puiseux fractions

We describe the implementation of a subfield of the field of formal Puiseux series in polymake. This is employed for solving linear programs and computing convex hulls depending on a real parameter. Moreover, this approach is also useful for computations in tropical geometry

On FGLM Algorithms with Tropical Gröbner bases

International audienceLet K be a field equipped with a valuation. Tropical varieties over K can be defined with a theory of Gröbner bases taking into account the valuation of K. Because of the use of the valuation, the theory of tropical Gröbner bases has proved to provide settings for computations over polynomial rings over a p-adic field that are more stable than that of classical Gröbner bases. In this article, we investigate how the FGLM change of ordering algorithm can be adapted to the tropical setting. As the valuations of the polynomial coefficients are taken into account, the classical FGLM algorithm's incremental way, monomo-mial by monomial, to compute the multiplication matrices and the change of basis matrix can not be transposed at all to the tropical setting. We mitigate this issue by developing new linear algebra algorithms and apply them to our new tropical FGLM algorithms. Motivations are twofold. Firstly, to compute tropical varieties, one usually goes through the computation of many tropical Gröbner bases defined for varying weights (and then varying term orders). For an ideal of dimension 0, the tropical FGLM algorithm provides an efficient way to go from a tropical Gröbner basis from one weight to one for another weight. Secondly, the FGLM strategy can be applied to go from a tropical Gröbner basis to a classical Gröbner basis. We provide tools to chain the stable computation of a tropical Gröbner basis (for weight [0,. .. , 0]) with the p-adic stabilized variants of FGLM of [RV16] to compute a lexicographical or shape position basis. All our algorithms have been implemented into SageMath. We provide numerical examples to illustrate time-complexity. We then illustrate the superiority of our strategy regarding to the stability of p-adic numerical computations

Log-barrier interior point methods are not strongly polynomial

This paper supersedes arXiv:1405.4161. 31 pages, 5 figures, 1 tableInternational audienceWe prove that primal-dual log-barrier interior point methods are not strongly polynomial, by constructing a family of linear programs with $3r+1$ inequalities in dimension $2r$ for which the number of iterations performed is in $\Omega(2^r)$. The total curvature of the central path of these linear programs is also exponential in $r$, disproving a continuous analogue of the Hirsch conjecture proposed by Deza, Terlaky and Zinchenko. Our method is to tropicalize the central path in linear programming. The tropical central path is the piecewise-linear limit of the central paths of parameterized families of classical linear programs viewed through logarithmic glasses. This allows us to provide combinatorial lower bounds for the number of iterations and the total curvature, in a general setting