Related papers: Defect Polytopes and Counter-Examples With polymak…
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
In this article we investigate a class of linear error correcting codes in relation with the order polytopes. In particular we consider the order polytopes of tree posets and bipartite posets. We calculate the parameters of the associated…
We produce a decomposition of the parameter space of the $A$-hypergeometric system associated to a projective monomial curve as a union of an arrangement of lines and its complement, in such a way that the analytic behavior of the solutions…
The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in…
We present two examples in toric geometry concerning the relationship between toric and quasitoric manifolds, and provide the sufficient conditions on the base polytope and characteristic map so that the resulting quasitoric manifold is…
This is a pdf print of the homonymous Maple file, freely available at http://www.maplesoft.com/applications/view.aspx?SID=127621, providing procedures which are able to produce the toric data associated with a (polarized) weighted…
We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also…
The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions -- computing the size of projections of high dimensional polytopes…
These notes survey some basic results in toric varieties over a field with examples and applications. A computer algebra package (written by the second author) is described which deals with both affine and projective toric varieties in any…
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…
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
Polymorphism in programming languages enables code reuse. Here, we show that polymorphism has broad applicability far beyond computations for technical computing: parallelism in distributed computing, presentation of visualizations of…
We find a relation between mixed volumes of several polytopes and the convex hull of their union, deducing it from the following fact: the mixed volume of a collection of polytopes only depends on the product of their support functions…
The polytopic definition introduced recently describing the topology of manifolds is used to formulate a generating function pertinent to its topological properties. In particular, a polynomial in terms of one variable and a tori underlying…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
This paper deals with the computation of polytopic invariant sets for polynomial dynamical systems. An invariant set of a dynamical system is a subset of the state space such that if the state of the system belongs to the set at a given…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…