Related papers: Separating Pants Decompositions in the Pants Compl…
We study the $F$-decomposition threshold $\delta_F$ for a given graph $F$. Here an $F$-decomposition of a graph $G$ is a collection of edge-disjoint copies of $F$ in $G$ which together cover every edge of $G$. (Such an $F$-decomposition can…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
We prove that if a graph has a tree-decomposition of width at most w, then it has a tree-decomposition of width at most w with certain desirable properties. We will use this result in a subsequent paper to show that every 2-connected graph…
We make progress on three long standing conjectures from the 1960s about path and cycle decompositions of graphs. Gallai conjectured that any connected graph on $n$ vertices can be decomposed into at most $\left\lceil…
In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…
We show that every smooth, orientable, closed, connected 4-manifold can be represented by a loop in the pants complex. We use this representation, together with the fact that the pants complex is simply connected, to provide an elementary…
The theory of geometric structures on a surface with nonempty boundary can be developed by using a decomposition of such a surface into hexagons, in the same way as the theory of geometric structures on a surface without boundary is…
We develop a theoretical description of the topological disentanglement occurring when torus knots reach the ends of a semi-flexible polymer under tension. These include decays into simpler knots and total unknotting. The minimal number of…
A smooth real curve is called separating in case the complement of the real locus inside the complex locus is disconnected. This is the case if there exists a morphism to the projective line whose inverse image of the real locus of the…
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…
A topological shape analysis is proposed and utilized to learn concepts that reflect shape commonalities. Our approach is two-fold: i) a spatial topology analysis of point cloud segment constellations within objects. Therein constellations…
We utilise the two principles of decoupling introduced in arXiv:2407.16108 to prove the following conditional result: assuming uniform decoupling for graphs of polynomials in all dimensions with identically zero Gaussian curvature, we can…
We introduce different notions of separation for families of Anosov representations. We show that, along a diverging sequence of such families, the critical exponent is asymptotic to a combinatorial invariant computable from the spectral…
We extend Mode-Coupling Theory (MCT) to inhomogeneous situations, relevant for supercooled liquid in pores, close to a surface, or in an external field. We compute the response of the dynamical structure factor to a static inhomogeneous…
One perspective on tree decompositions is that they display (low-order) separations of the underlying graph or matroid. The separations displayed by a tree decomposition are necessarily nested. In 2013, Clark and Whittle proved the…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
Perception research provides strong evidence in favor of part based representation of shapes in human visual system. Despite considerable differences among different theories in terms of how part boundaries are found, there is substantial…
A $(\beta,\delta,\Delta)$-padded decomposition of an edge-weighted graph $G = (V,E,w)$ is a stochastic decomposition into clusters of diameter at most $\Delta$ such that for every vertex $v\in V$, the probability that…
Distance geometry is the study of the arrangements of points in space using only the mutual distances between them. The basic idea in this letter is to use distance geometry for thermodynamics studies of small clusters in the microcanonical…
Multiparameter persistent homology has emerged as a powerful generalization of topological data analysis, capable of encoding multivariate filtrations. However, the algebraic complexity of multiparameter persistence modules, marked by wild…