Related papers: On contractible edges in convex decompositions
We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
Given a sequence of oriented links L^1,L^2,L^3,... each of which has a distinguished, unknotted component, there is a decomposition of the 3-sphere naturally associated to it, which is constructed as the components of the intersection of an…
We consider the moduli space of bordered Riemann surfaces with boundary and marked points. Such spaces appear in open-closed string theory, particularly with respect to holomorphic curves with Lagrangian submanifolds. We consider a…
A convex geometric graph $G$ is said to be packable if there exist edge-disjoint copies of $G$ in the complete convex geometric graph $K_n$ covering all but $o(n^2)$ edges. We prove that every convex geometric graph with cyclic chromatic…
Let $G$ be a graph on $[n]$ and $J_G$ be the binomial edge ideal of $G$ in the polynomial ring $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$. In this paper we investigate some topological properties of a poset associated to the minimal…
In this letter, first we give a decomposition for any Lie-Poisson structure $\pi_g$ associated to the modular vector. In particular, $\pi_g$ splits into two compatible Lie-Poisson structures if $dim{g} \leq 3$. As an application, we…
Let $P$ be a set of $n\geq 3$ points in general position in the plane. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in…
Consider a point on a convex surface in $\mathbb{R}^d$, $d \ge 2$ and a plane of support $\Pi$ to the surface at this point. Draw a plane parallel to $\Pi$ cutting a part of the surface. We study the limiting behavior of this part of…
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…
The notion of composite system made up of distinguishable parties is investigated in the context of arbitrary convex spaces.
The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some…
A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…
Let F be a foliation of codimension 2 on a compact manifold with at least one non-compact leaf. We show that then F must contain uncountably many non-compact leaves. We prove the same statement for oriented p-dimensional foliations of…
A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…
This monograph is on convex real projective structures on strongly tame n-orbifolds with some appropriate conditions on ends.
This paper introduces a notion of decompositions of integral varifolds into countably many integral varifolds, and the existence of such decomposition of integral varifolds whose first variation is representable by integration is…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
An unfolding of a polyhedron along its edges is called a vertex unfolding if adjacent faces are allowed to be connected at not only an edge but also a vertex. Demaine et al showed that every triangulated polyhedron has a vertex unfolding.…
We study the existence of incompressible embeddings of surfaces into the genus two handlebody. We show that for every compact surface with boundary, orientable or not, there is an incompressible embedding of the surface into the genus two…