Related papers: Topology of the view complex
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…
The purpose of this paper is to investigate the properties of spectral and tiling subsets of cyclic groups, with an eye towards the spectral set conjecture in one dimension, which states that a bounded measurable subset of $\mathbb{R}$…
A general method for constructing simplicial complex from observed time series of dynamical systems based on the delay coordinate reconstruction procedure is presented. The obtained simplicial complex preserves all pertinent topological…
Higher chromatic numbers $\chi_s$ of simplicial complexes naturally generalize the chromatic number $\chi_1$ of a graph. In any fixed dimension $d$, the $s$-chromatic number $\chi_s$ of $d$-complexes can become arbitrarily large for…
We prove that it is NP-complete to decide whether a given (3-dimensional) simplicial complex is collapsible. This work extends a result of Malgouyres and Franc\'{e}s showing that it is NP-complete to decide whether a given simplicial…
Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may look to add or delete few edges to uncover the cluster…
We study the fate of a localized wavepacket in a classical conformal field theory with attractive interaction V(phi) = -lambda/4 phi^4. As potential is unbounded from below, homogeneous field collapses to singularity in finite time.…
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 consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
Studying crepant blow-ups of (compound) du Val singularities, we classify complexes of coherent sheaves which admit no negative self-extensions -- such a complex, up to flops and mutation equivalences, must either be (1) a module over a…
Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…
A finite subgroup of the conformal group SL(2,C) can be related to invariant polynomials on a hypersurface in C^3. The latter then carries a simple singularity, which resolves by a finite iteration of basic cycles of deprojections. The…
We recently introduced a notion of tilings of geometric realizations of finite relative simplicial complexes and related those tilings to the discrete Morse theory of R. Forman, especially when they have the property of being shellable, a…
We provide two candidates for symplectic Weiss calculus based on two different, but closely related, collections of groups. In the case of the non-compact symplectic groups, i.e., automorphism groups of vector spaces with symplectic forms,…
We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…
The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of…
While sporadic examples of virtual resolutions with homology have been constructed, their occurrence is not well understood or controlled. Our results build a new set of tools for studying virtual resolutions of monomial ideals as arising…
We will show that the singular cohomology groups of a smooth quasi-projective complex variety relative to a normal crossing divisor can be described in terms of delta-admissible chains. Roughly speaking, a delta-admissible chain is a…
simpcomp is an extension to GAP, the well known system for computational discrete algebra. It allows the user to work with simplicial complexes. In the latest version, support for simplicial blowups and discrete normal surfaces was added,…
A set of fundamental matrices relating pairs of cameras in some configuration can be represented as edges of a "viewing graph". Whether or not these fundamental matrices are generically sufficient to recover the global camera configuration…