Related papers: Decomposition of multiple packings with subquadrat…

Let $X$ be a set, $B_{X}$ denotes the family of all subsets of $X$ and $F: X \longrightarrow B_{X}$ be a set-valued mapping such that $x \in F(x)$, $sup_{x\in X} | F(x)|< \kappa$, $sup_{x\in X} | F^{-1}(x)|< \kappa$ for all $x\in X$ and…

We give a method for obtaining a handle decomposition of an $n$-manifold if the manifold is given by isometric side-pairings of a polyhedron in $\en$, $\sn$ or $\hn$. Every cycle of $k$-faces on the polyhedron corresponds to an…

A compact subset $K$ of the complex plane $\C$ is a set of polynomial (respectively rational) approximation if $P(K)=A(K)$ (respectively $R(K)=A(K)$), where $P(K)$ (respectively $R(K)$) is the family of functions on $K$ which are uniform…

The problem of packing as many subgraphs isomorphic to $H \in \mathcal H$ as possible in a graph for a class $\mathcal H$ of graphs is well studied in the literature. Both vertex-disjoint and edge-disjoint versions are known to be…

Deciding whether a graph can be edge-decomposed into a matching and a $k$-bounded linear forest was recently shown by Campbell, H{\"o}rsch and Moore to be NP-complete for every $k \ge 9$, and solvable in polynomial time for $k=1,2$. In the…

We consider the problem of decomposing some $t$-uniform hypergraph $G$ into copies of another, say $H$, with nonnegative rational weights. For fixed $H$ on $k$ vertices, we show that this is always possible for all $G$ having sufficiently…

We consider the problem of discovering overlapping communities in networks which we model as generalizations of Graph Packing problems with overlap. We seek a collection $\mathcal{S}' \subseteq \mathcal{S}$ consisting of at least $k$ sets…

We consider a planar graph $G$ in which the edges have nonnegative integer lengths such that the length of every cycle of $G$ is even, and three faces are distinguished, called holes in $G$. It is known that there exists a packing of cuts…

For each positive integer n the HOMFLY polynomial of links specializes to a one-variable polynomial that can be recovered from the representation theory of quantum sl(n). For each such n we build a doubly-graded homology theory of links…

We study analytic deformations and unfoldings of holomorphic foliations in complex projective plane $\mathbb{C}P(2)$. Let $\{\mathcal{F}_t\}_{t \in \mathbb{D}_{\epsilon}}$ be topological trivial (in $\mathbb{C}^2$) analytic deformation of a…

The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…

We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join…

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…

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

Let $p(m)$ (respectively, $q(m)$) be the maximum number $k$ such that any tree with $m$ edges can be transformed by contracting edges (respectively, by removing vertices) into a caterpillar with $k$ edges. We derive closed-form expressions…

Let Y be an infinite covering space of a projective manifold M in P^N of dimension n geq 2. Let C be the intersection with M of at most n-1 generic hypersurfaces of degree d in P^N. The preimage X of C in Y is a connected submanifold. Let…

The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…

We prove that for every integer $k$, every finite set of points in the plane can be $k$-colored so that every half-plane that contains at least $2k-1$ points, also contains at least one point from every color class. We also show that the…

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…

Using tropical geometry, Mikhalkin has proved that every smooth complex hypersurface in $\mathbb{CP}^{n+1}$ decomposes into pairs of pants: a pair of pants is a real compact $2n$-manifold with cornered boundary obtained by removing an open…