Related papers: Matrix Models, Integral Polyhedra and Toric Geomet…

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…

This paper is devoted to systematically extend $f$-mirror symmetry between families of hypersurfaces in complete toric varieties, as introduced in \cite{R-fTV}, to families of complete intersections subvarieties. Namely, $f$-mirror symmetry…

In this paper we study algorithmic aspects of tropical intersection theory. We analyse how divisors and intersection products on tropical cycles can actually be computed using polyhedral geometry. The main focus of this paper is the study…

This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…

We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…

This paper presents an algebraic construction of Euler-Maclaurin formulas for polytopes. The formulas obtained generalize and unite the previous lattice point formulas of Morelli and Pommersheim-Thomas, and the Euler-Maclaurin formulas of…

This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…

Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…

This article is based on my lecture notes from summer schools at the Universities of Utah (June 2007) and Warwick (September 2007). We provide an introduction to explicit methods in the study of moduli spaces of quiver representations and…

This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…

We propose a novel method of finding the classical limit of the matrix geometry. We define coherent states for a general matrix geometry described by a large-N sequence of D Hermitian matrices X_\mu (\mu =1,2, ..., D) and construct a…

Tensor diagrams are a handy way to depict complicated relationships between objects in projective geometry. One of the simpler ones takes two copies of a $3\times 3$ matrix and computes its adjugate. In this paper, we give a geometric…

We study the ideal of the algebraic relations among 3-point functions from a combinatorial and topological perspective. We place this problem in the broader setting of incidence toric ideals associated with incidence matrices of t-subsets…

The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical…

In this text we review a few structural properties of matrix models that should at least partly generalize to random tensor models. We review some aspects of the loop equations for matrix models and their algebraic counterpart for tensor…

We extend the notion of triangle to "imaginary triangles" with complex valued sides and angles, and parametrize families of such triangles by plane algebraic curves. We study in detail families of triangles with two commensurable angles,…

An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of…

Colored tensor models have recently burst onto the scene as a promising conceptual and computational tool in the investigation of problems of random geometry in dimension three and higher. We present a snapshot of the cutting edge in this…

We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…

Using the sine-Gordon model as the prime example an alternative approach to integrable boundary conditions for a theory restricted to a half-line is proposed. The main idea is to explore the consequences of taking into account the…