Related papers: Deformed Intersections of Half-spaces
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…
Polypols are natural generalizations of polytopes, with boundaries given by nonlinear algebraic hypersurfaces. We describe polypols in the plane and in 3-space that admit a unique adjoint hypersurface and study them from an…
Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…
This is the paper as published. The topology of a complex plane curve singularity with real branches is deduced from any real deformation having delta crossings. An example of the computation of the global geometric monodromy of a…
In this paper we use the deformation procedure introduced in former work on deformed defects to investigate several new models for real scalar field. We introduce an interesting deformation function, from which we obtain two distinct…
A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…
In this article we address the length of perverse sheaves arising as direct images of rank one local systems on complements of hyperplane arrangements. In the case of a cone over an essential line arrangement with at most triple points, we…
Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group…
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.
Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs of G, we consider the notion of associativity and tubes on posets. This leads to a new family of simple convex polytopes obtained by…
An \emph{obstacle representation} of a graph consists of a set of polygonal obstacles and a distinct point for each vertex such that two points see each other if and only if the corresponding vertices are adjacent. Obstacle representations…
In this paper, we consider prescribed shifted Gauss curvature equations for horo-convex hypersurfaces in $\mathbb{H}^{n+1}$. Under some sufficient condition, we obtain an existence result by the standard degree theory based on the a prior…
Dendriform coalgebras are the dual notion of dendriform algebras and are splitting of associative coalgebras. In this paper, we define a cohomology theory for dendriform coalgebras based on some combinatorial maps. We show that the…
Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…
In this article we classify normal forms and unfoldings of linear maps in eigenspaces of (anti)-automorphisms of order two. Our main motivation is provided by applications to linear systems of ordinary differential equations, general and…
The purpose of this work is to collect in one place available information on line arrangements known in the literature as braid, monomial, Ceva or Fermat arrangement. They have been studied for a long time and appeared recently in…
It is shown that the structure of the generalized quadrangle of order two is fully encoded in the properties of the Desargues configuration. A point of the quadrangle is represented by a geometric hyperplane of the Desargues configuration…