Related papers: Slicing, Threading & Parametric Manifolds
We explore the geometric implications of introducing a spectral cut-off on Riemannian manifolds. This is naturally phrased in the framework of non-commutative geometry, where we work with spectral triples that are \emph{truncated} by…
By classical results of Rochlin, Thom, Wallace and Lickorish, it is well-known that any two 3-manifolds (with diffeomorphic boundaries) are related one to the other by surgery operations. Yet, by restricting the type of the surgeries, one…
Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on…
We generalize the classical de Rham decomposition theorem for Riemannian manifolds to the setting of geodesic metric spaces of finite dimension.
Boring is an operation which converts a knot or two-component link in a 3--manifold into another knot or two-component link. It generalizes rational tangle replacement and can be described as a type of 2--handle attachment. Sutured manifold…
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
We present an algorithm for low rank decomposition of tensors of any symmetry type, from fully asymmetric to fully symmetric. It recovers the decomposition one summand at a time via the higher-order power method. This approach is known to…
In a variety of settings we provide a method for decomposing a 3-manifold $M$ into pieces. When the pieces have the appropriate type of hyperbolicity, then the manifold $M$ is hyperbolic and its volume is bounded below by the sum of the…
Arnold, Falk, & Winther, in "Finite element exterior calculus, homological techniques, and applications" (2006), show how to geometrically decompose the full and trimmed polynomial spaces on simplicial elements into direct sums of…
We introduce 3+1 timelike foliation of the four dimensional Lorentz manifold to derive the 3+1 Sen-Ashtekar-Barbero-Immirzi formalism in case of $SO(2,1)$ rotation gauge group, which is possible due to the existence of the $so(2,1)$ algebra…
Partitioning and grouping of similar objects plays a fundamental role in image segmentation and in clustering problems. In such problems a typical goal is to group together similar objects, or pixels in the case of image processing. At the…
The distributed representation of correlated multi-view images is an important problem that arise in vision sensor networks. This paper concentrates on the joint reconstruction problem where the distributively compressed correlated images…
Nonlinear dimensionality reduction methods provide a valuable means to visualize and interpret high-dimensional data. However, many popular methods can fail dramatically, even on simple two-dimensional manifolds, due to problems such as…
Trimming is a core technique in geometric modeling. Unfortunately, the resulting objects do not take the requirements of numerical simulations into account and yield various problems. This paper outlines principal issues of trimmed models…
The symmetric spaces that appear as moduli spaces in string theory and supergravity can be decomposed with explicit metrics using parabolic subgroups. The resulting isometry between the original moduli space and this decomposition can be…
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…
Image segmentation has long been a basic problem in computer vision. Depth-wise Layering is a kind of segmentation that slices an image in a depth-wise sequence unlike the conventional image segmentation problems dealing with surface-wise…
We study the skew-symmetric prolongation of a Lie subalgebra $\g \subseteq \mathfrak{so}(n)$, in other words the intersection $\Lambda^3 \cap (\Lambda^1 \otimes \g)$.We compute this space in full generality. Applications include uniqueness…
In the recent years we have witnessed a rapid development of new algorithmic techniques for parameterized algorithms for graph separation problems. We present experimental evaluation of two cornerstone theoretical results in this area:…
We compute a minimum degree threshold sufficient for 3-partite graphs to admit a fractional triangle decomposition. Together with recent work of Barber, K\"uhn, Lo, Osthus and Taylor, this leads to bounds for exact decompositions and in…