Related papers: Hyperplane families creating envelopes
We construct an infinite family of homologous, non-isotopic, symplectic surfaces of any genus greater than one in a certain class of closed, simply connected, symplectic four-manifolds. Our construction is the first example of this…
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…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
First, we obtain a new formula for Bremermann type upper envelopes, that arise frequently in convex analysis and pluripotential theory, in terms of the Legendre transform of the convex- or plurisubharmonic-envelope of the boundary data.…
In a metric space $M=(X,d)$, we say that $v$ is between $u$ and $w$ if $d(u,w)=d(u,v)+d(v,w)$. Taking all triples $\{u,v,w\}$ such that $v$ is between $u$ and $w$, one can associate a 3-uniform hypergraph with each finite metric space $M$.…
We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which…
We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…
Covering problems are classical computational problems concerning whether a certain combinatorial structure 'covers' another. For example, the minimum vertex covering problem aims to find the smallest set of vertices in a graph so that each…
A family of sets in the plane is simple if the intersection of its any subfamily is arc-connected, and it is pierced by a line $L$ if the intersection of its any member with $L$ is a nonempty segment. It is proved that the intersection…
We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…
We consider the geometry of four spatial displacements, arranged in cyclic order, such that the relative motion between neighbouring displacements is a pure rotation. We compute the locus of points whose homologous images lie on a circle,…
Graphs have been utilized as a powerful tool to model pairwise relationships between people or objects. Such structure is a special type of a broader concept referred to as hypergraph, in which each hyperedge may consist of an arbitrary…
A problem posed by Erd\H{o}s in 1945 initiated the study of non-separable arrangements of convex bodies. A finite collection of convex bodies in Euclidean $d$-space is called a non-separable family (or NS-family) if every hyperplane…
A convex geometric hypergraph or cgh consists of a family of subsets of a strictly convex set of points in the plane. There are eight pairwise nonisomorphic cgh's consisting of two disjoint triples. These were studied at length by Bra{\ss}…
An $n\times n\times\dots\times n$ hypercube is made from $n^d$ unit hypercubes. Two unit hypercubes are neighbours if they share a $(d-1)$-dimensional face. In each step of a dismantling process, we remove a unit hypercube that has…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…
We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…
A solution to the problem of topological classification of real cubic fourfolds is presented. It is shown that the real locus of a real non-singular cubic fourfold is obtained from a projective 4-space either by adding several trivial one-…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
We construct infinite families of non-simple isotopy classes of links in overtwisted contact structures on $S^1$-bundles over surfaces. These examples include: (1) a pair of Legendrian links that are not Legendrian isotopic, but which are…