English
Related papers

Related papers: Topology of the view complex

200 papers

We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…

Combinatorics · Mathematics 2008-04-12 Sangwook Kim

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…

Commutative Algebra · Mathematics 2009-02-26 Mohammad Mahmoudi , Amir Mousivand , Siamak Yassemi

The family of $\mathfrak{I}$-contractible graphs and contractible transformations was defined by A. Ivashchenko in the mid-90's. In this paper we study the collapsibility and homological properties of the clique complex associated to…

Combinatorics · Mathematics 2022-04-28 Jesus F. Espinoza , Martín-Eduardo Frías-Armenta , Héctor A. Hernández

In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the concept of a vertex splittable ideal and show that a simplicial complex $\Delta$ is vertex decomposable if and only if $I_{\Delta^{\vee}}$…

Commutative Algebra · Mathematics 2016-08-24 Somayeh Moradi , Fahimeh Khosh-Ahang

Observing certain patches in an image reduces the uncertainty of others. Their realization lowers the distribution entropy of each remaining patch feature, analogous to collapsing a particle's wave function in quantum mechanics. This…

Computer Vision and Pattern Recognition · Computer Science 2025-12-01 Wei Guo , Shunqi Mao , Zhuonan Liang , Heng Wang , Weidong Cai

For a metric space $(X, d)$ and a scale parameter $r \geq 0$, the Vietoris-Rips complex $\mathcal{VR}(X;r)$ is a simplicial complex on vertex set $X$, where a finite set $\sigma \subseteq X$ is a simplex if and only if diameter of $\sigma$…

Combinatorics · Mathematics 2023-05-16 Samir Shukla

We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space $X$, and output a clustering of the data based on the selection of a…

Machine Learning · Computer Science 2022-09-28 Antonio Rieser

The antiprism triangulation provides a natural way to subdivide a simplicial complex $\Delta$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as…

Combinatorics · Mathematics 2021-09-07 Christos A. Athanasiadis , Jan-Marten Brunink , Martina Juhnke-Kubitzke

We proof here the existence of a topological thick and thin decomposition of any closed definable thick isolated singularity germ in the spirit of the recently discovered metric thick and thin decomposition of complex normal surface…

Metric Geometry · Mathematics 2012-08-22 Lev Birbrair , Alexandre Fernandes , Vincent Grandjean

In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…

Information Theory · Computer Science 2024-09-26 Yansheng Wu , Chao Li , Jong Yoon Hyun

Many coupled problems in engineering and science can be described by elliptic partial differential equations on adjacent domains, where the coupling can be considered either as a thin equidimensional overlap between the model domains, or as…

Algebraic Topology · Mathematics 2024-11-07 Daniel Førland Holmen , Jan Martin Nordbotten , Jon Eivind Vatne

Given a simplicial complex $X$, we construct a simplicial complex $\Omega X$ that may be regarded as a combinatorial version of the based loop space of a topological space. Our construction explicitly describes the simplices of $\Omega X$…

Algebraic Topology · Mathematics 2025-07-17 Gregory Lupton , Jonathan Scott

A central problem in topological data analysis is that of computing the homology of a given simplicial complex. Said complexes can have arbitrary large number of simplices, as can happen, for example, if the space is the Rips-Vietoris or…

Combinatorics · Mathematics 2021-11-11 Francisco Martinez-Figueroa

Chirotopes are a common combinatorial abstraction of (planar) point sets. In this paper we investigate decomposition methods for chirotopes, and their application to the problem of counting the number of triangulations supported by a given…

Computational Geometry · Computer Science 2026-03-12 Mathilde Bouvel , Valentin Féray , Xavier Goaoc , Florent Koechlin

A Rado simplicial complex X is a generalisation of the well-known Rado graph. X is a countable simplicial complex which contains any countable simplicial complex as its induced subcomplex. The Rado simplicial complex is highly symmetric, it…

Combinatorics · Mathematics 2020-01-31 Michael Farber , Lewis Mead , Lewin Strauss

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…

In this paper we apply Donaldson's general moment map framework for the action of a symplectomorphism group on the corresponding space of compatible (almost) complex structures to the case of rational ruled surfaces. This gives a new…

Symplectic Geometry · Mathematics 2007-05-23 Miguel Abreu , Gustavo Granja , Nitu Kitchloo

Since the time when the first optical instruments have been invented, an idea that the visible image of an object under observation depends on tools of observation became commonly assumed in physics. A way to formalize it in mathematics is…

Functional Analysis · Mathematics 2019-03-14 S. S. Akbarov

Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex Delta_{A,H} as the subdivision of the link of A induced by H. In particular, this generalizes Steingrimsson's coloring…

Combinatorics · Mathematics 2007-05-23 Axel Hultman

We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…

Group Theory · Mathematics 2020-04-20 Tomasz Prytuła