Related papers: Deformed Intersections of Half-spaces

In 1926, Levi showed that, for every pseudoline arrangement $\mathcal{A}$ and two points in the plane, $\mathcal{A}$ can be extended by a pseudoline which contains the two prescribed points. Later extendability was studied for arrangements…

We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…

Realisations of associahedra with linearly non-isomorphic normal fans can be obtained by alteration of the right-hand sides of the facet-defining inequalities from a classical permutahedron. These polytopes can be expressed as Minkowski…

Given an $\Bbb{F}$-represented matroid $(M,\rho)$ with the ground set $[m]$, the representation $\rho$ naturally defines a hyperplane arrangement $\mathcal{A}_\rho$. We will study its parallel translates $\mathcal{A}_{\rho,{g}}$ of…

Varchenko defined the Varchenko matrix associated to any real hyperplane arrangement and computed its determinant. In this paper, we show that the Varchenko matrix of a hyperplane arrangement has a diagonal form if and only if it is…

We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…

We develop the basic theory of derived quasi-coherent ideals for stacks relative to a given derived algebraic context. We compare different notions of adic completeness with respect to derived ideals, define and compare formal spectra and…

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

A classic problem connecting algebraic and geometric combinatorics is the realization problem: given a poset, determine whether there exists a polytope whose face lattice is the poset. In 1990s, Kapranov defined a poset as a hybrid between…

This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…

Interpolation error estimates in terms of geometric quality measures are established for harmonic coordinates on polytopes in two and three dimensions. First we derive interpolation error estimates over convex polygons that depend on the…

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

Here, we resume and broaden the results concerned which appeared in math.AG/0101098 and math.AG/0104021. We start from summing up our example of a complex algebraic surface which is not deformation equivalent to its complex conjugate and…

We show that there are five types of planar curves such that arrangements of its translates are combinatorially equivalent to an arrangement of lines. These curves can be used to define norms giving constructions with many unit distances…

For derived curves intersecting a family of decomposable hyperplanes in subgeneral position, we obtain an analog of Cartan-Nochka Second Main Theorem, generalizing a classical result of Fujimoto about decomposable hyperplanes in general…

It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

In this article we prove two main results. Firstly, we show that any six-line arrangement, consisting of three pairs of mutually perpendicular lines, does not give rise to a "very generic or sufficiently general" discriminantal arrangement…

The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We focus on the problem of counting regions of reflection…

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…