Related papers: Separating Pants Decompositions in the Pants Compl…
The 'separation dimension' of a graph $G$ is the smallest natural number $k$ for which the vertices of $G$ can be embedded in $\mathbb{R}^k$ such that any pair of disjoint edges in $G$ can be separated by a hyperplane normal to one of the…
We determine which connected surfaces can be partitioned into topological circles. There are exactly seven such surfaces up to homeomorphism: those of finite type, of Euler characteristic zero, and with compact boundary components. As a…
We investigate arcs on a pair of pants and present an algorithm to compute the self-intersection number of an arc. Additionally, we establish bounds for the self-intersection number in terms of the word length. We also prove that the…
We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…
We prove an $l^p$ decoupling inequality for hypersurfaces with nonzero Gaussian curvature and use it to derive a corresponding $l^p$ decoupling for curves not contained in a hyperplane. This extends our earlier work from [2]
Given a graph $G$, a subgraph $H$ is isometric if $d_H(u,v) = d_G(u,v)$ for every pair $u,v\in V(H)$, where $d$ is the distance function. A graph $G$ is distance preserving (dp) if it has an isometric subgraph of every possible order. A…
A path (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most…
We explore the gapless topological phases of a $p$-wave superconductor, probing its rich topologically ordered phases and underlying quantum phenomena. The topological order of the system is characterized by studying its entanglement…
Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…
Tree-decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. The main property of tree-decompositions is the width (the maximum size of a bag minus 1). We show that every graph has a…
We address the following general question: given a graph class C on which we can solve Maximum Matching in (quasi) linear time, does the same hold true for the class of graphs that can be modularly decomposed into C ? A major difficulty in…
We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition. The length of a path-decomposition of a graph is the…
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number,…
Separability is one of the most basic and important topological properties. In this paper, the separability in (strongly) topological gyrogroups is studied. It is proved that every first-countable left {\omega}-narrow strongly topological…
In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More…
We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…
We rigorously derive a strain-gradient model of plasticity as a $\Gamma$-limit of continuum bodies containing finitely-many edge-dislocations (in two dimensions). The key difference from previous such derivations is the elemental notion of…
A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of…
We propose an intuitive interpretation for nontrivial $L^2$-Betti numbers of compact Riemann surfaces in terms of certain loops in embedded pairs of pants. This description uses twisted homology associated to the Hurewicz map of the…
We prove that the separated curve complex of a closed orientable surface of genus g is (g-3)-connected. We also obtain a connectivity property for a separated curve complex of the open surface that is obtained by removing a finite set from…