Related papers: From affine to barycentric coordinates in polytope…

We construct affine algebras with an arbitrary amount of simple modules of each dimension.

In this paper, we develop new affine-invariant algorithms for solving composite convex minimization problems with bounded domain. We present a general framework of Contracting-Point methods, which solve at each iteration an auxiliary…

This paper develops a correspondence relating convex hulls of fractional functions with those of polynomial functions over the same domain. Using this result, we develop a number of new reformulations and relaxations for fractional…

In many applications involving binary variables, only pairwise dependence measures, such as correlations, are available. However, for multi-way tables involving more than two variables, these quantities do not uniquely determine the joint…

For piecewise-linear maps the stable and unstable manifolds of hyperbolic periodic solutions are themselves piecewise-linear. Hence compact subsets of these manifolds can be represented using polytopes (i.e. polygons, in the case of…

I extend the framework of rigid analytic geometry to the setting of algebraic geometry relative to monoids, and study the associated notions of separated, proper, and overconvergent morphisms. The category of affine manifolds embeds as a…

We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…

A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d<4. We solve the problem up…

In this paper we discuss some affine properties of convex equal-area polygons, which are convex polygons such that all triangles formed by three consecutive vertices have the same area. Besides being able to approximate closed convex smooth…

In this paper, we present some common fixed point theorems for a commuting pair of mappings, including a generalized nonexpansive single valued mapping and a generalized nonexpansive multivalued mapping in strictly convex Banach spaces. The…

Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its…

This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…

For a polytope P a simplex S with vertex set V(S) is called a special simplex if every facet of P contains all but exactly one vertex of S. For such polytopes P with face complex F(P) containing a special simplex the subcomplex F(P) / V(S)…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…

Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

In this paper, we tie together two well studied topics related to finite Desarguesian affine and projective planes. The first topic concerns directions determined by a set, or even a multiset, of points in an affine plane. The second topic…

We show that there is a unique hypersurface of minimal degree passing through the non-faces of a polytope which is defined by a simple hyperplane arrangement. This generalizes the construction of the adjoint curve of a polygon by Wachspress…

Wavefront reconstruction is a critical component in various optical systems, including adaptive optics, interferometry, and phase contrast imaging. Traditional reconstruction methods often employ either the Cartesian (pixel) basis or the…